![]() | Birthday problem was a Natural sciences good articles nominee, but did not meet the good article criteria at the time. There may be suggestions below for improving the article. Once these issues have been addressed, the article can be renominated. Editors may also seek a reassessment of the decision if they believe there was a mistake. | |||||||||
|
![]() | This article is rated B-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||
|
This page has archives. Sections older than 90 days may be automatically archived by Lowercase sigmabot III when more than 3 sections are present. |
The text says, “The problem of a non-uniform number of births occurring during each day of the year was first addressed by Murray Klamkin in 1967.” which points to a paper from 1967 by Klamkin and Newman. This paper does not actually address the problem of non-uniform numbers of births. So I think this sentence should be cut, or the proper citation should be tracked down. 100.36.247.162 ( talk) 22:52, 5 December 2022 (UTC)
I just noticed this, which I don't see in the article: —Tamfang ( talk) 18:01, 28 March 2024 (UTC)
Or to put that another way, 23 is the smallest integer n such that . —Tamfang ( talk) 00:03, 30 March 2024 (UTC)
To me, the partition problem at the bottom of the article does not seem sufficiently related to the birthday problem. Is the motivation behind the inclusion that both problems have the "answer" 23? Zaspagety ( talk) 13:59, 9 April 2024 (UTC)
![]() | Birthday problem was a Natural sciences good articles nominee, but did not meet the good article criteria at the time. There may be suggestions below for improving the article. Once these issues have been addressed, the article can be renominated. Editors may also seek a reassessment of the decision if they believe there was a mistake. | |||||||||
|
![]() | This article is rated B-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||
|
This page has archives. Sections older than 90 days may be automatically archived by Lowercase sigmabot III when more than 3 sections are present. |
The text says, “The problem of a non-uniform number of births occurring during each day of the year was first addressed by Murray Klamkin in 1967.” which points to a paper from 1967 by Klamkin and Newman. This paper does not actually address the problem of non-uniform numbers of births. So I think this sentence should be cut, or the proper citation should be tracked down. 100.36.247.162 ( talk) 22:52, 5 December 2022 (UTC)
I just noticed this, which I don't see in the article: —Tamfang ( talk) 18:01, 28 March 2024 (UTC)
Or to put that another way, 23 is the smallest integer n such that . —Tamfang ( talk) 00:03, 30 March 2024 (UTC)
To me, the partition problem at the bottom of the article does not seem sufficiently related to the birthday problem. Is the motivation behind the inclusion that both problems have the "answer" 23? Zaspagety ( talk) 13:59, 9 April 2024 (UTC)