The n-Children Problem
In 1959, Martin Gardner posed the Two-Children Problem and provided its solution. He later corrected his solution due to the ambiguity involved in the procedure of obtaining the given information. In 2010, Gary Foshee posed a generalization of Gardner’s problem by involving a second condition beyond...
Gespeichert in:
| Veröffentlicht in: | The College mathematics journal 2019-08, Vol.50 (4), p.242-249 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 249 |
|---|---|
| container_issue | 4 |
| container_start_page | 242 |
| container_title | The College mathematics journal |
| container_volume | 50 |
| creator | Engbers, John Hammett, Adam |
| description | In 1959, Martin Gardner posed the Two-Children Problem and provided its solution. He later corrected his solution due to the ambiguity involved in the procedure of obtaining the given information. In 2010, Gary Foshee posed a generalization of Gardner’s problem by involving a second condition beyond gender, namely the birth-day of the week. This article generalizes the Two-Children Problem to n children with m conditions, and gives a formula to compute this probability under one explicit procedure of obtaining the given information. |
| doi_str_mv | 10.1080/07468342.2019.1632663 |
| format | Article |
| fullrecord | <record><control><sourceid>jstor_proqu</sourceid><recordid>TN_cdi_proquest_journals_2294269262</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>48662719</jstor_id><sourcerecordid>48662719</sourcerecordid><originalsourceid>FETCH-LOGICAL-c223t-e5d6f96b49d2d62e2e1f2f7e375862c7bb7126043be6611ccf482b236791e7383</originalsourceid><addsrcrecordid>eNp9kEtLAzEUhYMoWEe37goF11Nzb9KbyU4pvqCgi7oO80jolOmkJlOk_94Zprp0dRf3O-fAx9gU-Bx4xu-5kpQJiXPkoOdAAonEGZuAFpCCkHTOJgOTDtAlu4pxyzmHTNGE3a43dtamy03dVMG2s4_gi8burtmFy5tob043YZ_PT-vla7p6f3lbPq7SElF0qV1U5DQVUldYEVq04NApK9QiIyxVUShA4lIUlgigLJ3MsEBBSoNVIhMJuxt798F_HWzszNYfQttPGkQtkTQS9tRipMrgYwzWmX2od3k4GuBmUGB-FZhBgTkp6HPTMbeNnQ9_IZkRoertJOxh_Net82GXf_vQVKbLj40PLuRtWUcj_p_4AdkraKY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2294269262</pqid></control><display><type>article</type><title>The n-Children Problem</title><source>JSTOR Mathematics & Statistics</source><source>JSTOR</source><creator>Engbers, John ; Hammett, Adam</creator><creatorcontrib>Engbers, John ; Hammett, Adam</creatorcontrib><description>In 1959, Martin Gardner posed the Two-Children Problem and provided its solution. He later corrected his solution due to the ambiguity involved in the procedure of obtaining the given information. In 2010, Gary Foshee posed a generalization of Gardner’s problem by involving a second condition beyond gender, namely the birth-day of the week. This article generalizes the Two-Children Problem to n children with m conditions, and gives a formula to compute this probability under one explicit procedure of obtaining the given information.</description><identifier>ISSN: 0746-8342</identifier><identifier>EISSN: 1931-1346</identifier><identifier>DOI: 10.1080/07468342.2019.1632663</identifier><language>eng</language><publisher>Washington: Taylor & Francis</publisher><ispartof>The College mathematics journal, 2019-08, Vol.50 (4), p.242-249</ispartof><rights>The Mathematical Association of America 2019</rights><rights>The Mathematical Association of America</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c223t-e5d6f96b49d2d62e2e1f2f7e375862c7bb7126043be6611ccf482b236791e7383</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/48662719$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/48662719$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>314,780,784,803,832,27915,27916,58008,58012,58241,58245</link.rule.ids></links><search><creatorcontrib>Engbers, John</creatorcontrib><creatorcontrib>Hammett, Adam</creatorcontrib><title>The n-Children Problem</title><title>The College mathematics journal</title><description>In 1959, Martin Gardner posed the Two-Children Problem and provided its solution. He later corrected his solution due to the ambiguity involved in the procedure of obtaining the given information. In 2010, Gary Foshee posed a generalization of Gardner’s problem by involving a second condition beyond gender, namely the birth-day of the week. This article generalizes the Two-Children Problem to n children with m conditions, and gives a formula to compute this probability under one explicit procedure of obtaining the given information.</description><issn>0746-8342</issn><issn>1931-1346</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLAzEUhYMoWEe37goF11Nzb9KbyU4pvqCgi7oO80jolOmkJlOk_94Zprp0dRf3O-fAx9gU-Bx4xu-5kpQJiXPkoOdAAonEGZuAFpCCkHTOJgOTDtAlu4pxyzmHTNGE3a43dtamy03dVMG2s4_gi8burtmFy5tob043YZ_PT-vla7p6f3lbPq7SElF0qV1U5DQVUldYEVq04NApK9QiIyxVUShA4lIUlgigLJ3MsEBBSoNVIhMJuxt798F_HWzszNYfQttPGkQtkTQS9tRipMrgYwzWmX2od3k4GuBmUGB-FZhBgTkp6HPTMbeNnQ9_IZkRoertJOxh_Net82GXf_vQVKbLj40PLuRtWUcj_p_4AdkraKY</recordid><startdate>20190808</startdate><enddate>20190808</enddate><creator>Engbers, John</creator><creator>Hammett, Adam</creator><general>Taylor & Francis</general><general>Taylor & Francis, Ltd</general><general>Taylor & Francis Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope></search><sort><creationdate>20190808</creationdate><title>The n-Children Problem</title><author>Engbers, John ; Hammett, Adam</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c223t-e5d6f96b49d2d62e2e1f2f7e375862c7bb7126043be6611ccf482b236791e7383</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Engbers, John</creatorcontrib><creatorcontrib>Hammett, Adam</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><jtitle>The College mathematics journal</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Engbers, John</au><au>Hammett, Adam</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The n-Children Problem</atitle><jtitle>The College mathematics journal</jtitle><date>2019-08-08</date><risdate>2019</risdate><volume>50</volume><issue>4</issue><spage>242</spage><epage>249</epage><pages>242-249</pages><issn>0746-8342</issn><eissn>1931-1346</eissn><abstract>In 1959, Martin Gardner posed the Two-Children Problem and provided its solution. He later corrected his solution due to the ambiguity involved in the procedure of obtaining the given information. In 2010, Gary Foshee posed a generalization of Gardner’s problem by involving a second condition beyond gender, namely the birth-day of the week. This article generalizes the Two-Children Problem to n children with m conditions, and gives a formula to compute this probability under one explicit procedure of obtaining the given information.</abstract><cop>Washington</cop><pub>Taylor & Francis</pub><doi>10.1080/07468342.2019.1632663</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0746-8342 |
| ispartof | The College mathematics journal, 2019-08, Vol.50 (4), p.242-249 |
| issn | 0746-8342 1931-1346 |
| language | eng |
| recordid | cdi_proquest_journals_2294269262 |
| source | JSTOR Mathematics & Statistics; JSTOR |
| title | The n-Children Problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T20%3A34%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20n-Children%20Problem&rft.jtitle=The%20College%20mathematics%20journal&rft.au=Engbers,%20John&rft.date=2019-08-08&rft.volume=50&rft.issue=4&rft.spage=242&rft.epage=249&rft.pages=242-249&rft.issn=0746-8342&rft.eissn=1931-1346&rft_id=info:doi/10.1080/07468342.2019.1632663&rft_dat=%3Cjstor_proqu%3E48662719%3C/jstor_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2294269262&rft_id=info:pmid/&rft_jstor_id=48662719&rfr_iscdi=true |