- The following is an archived discussion of the DYK nomination of the article below. Please do not modify this page. Subsequent comments should be made on the appropriate discussion page (such as this nomination's talk page, the article's talk page or Wikipedia talk:Did you know), unless there is consensus to re-open the discussion at this page. No further edits should be made to this page.
The result was: promoted by Cwmhiraeth (talk) 07:21, 1 March 2017 (UTC)
| DYK toolbox |
|---|
Penny graph
edit- ... that, no matter how n non-overlapping pennies are arranged on a table, at least 0.258n of them will not touch each other? Source: The original source, Swanepoel 2002, is subscription-only, but the same result is cited by Dumitrescu and Jiang. See the first paragraph of section 3: "Swanepoel further raised it to 8n/31".
Created by David Eppstein (talk). Self-nominated at 22:56, 19 February 2017 (UTC).
- Length, Date, Earwigs, QPQ, and Cite check. Mifter Public (talk) 17:06, 23 February 2017 (UTC)
