Talk:Circle packing in a circle

Latest comment: 7 months ago by 76.121.231.9 in topic Algebraic numbers

CorenBot copyvio question

edit

The material was split from Packing problem. It was already on wiki, and bears little similarity to the single sentence definition given on this link. I don't think there is any copyvio problem here (and I certainly never used that site as a source). --99of9 (talk) 05:01, 1 June 2011 (UTC)Reply

Add a section on proof methods?

edit

If "Circle packing in a circle" deserves its own page, one should attempt to list some known proof methods too (cf. similar discussion entry in Talk:Packing_problem).

[ɯ:] (talk) 11:16, 3 February 2013 (UTC)Reply

"Trivially optimal"

edit

Are the 5- and 6- circle cases really "trivially optimal"? Especially with the 6-circle case, I picture a 3x2 rectangular array, or perhaps staggered, as options... they might be pretty clearly bad options, but if I have to think about it, it's not trivial. And how can the 5-circle case be both proved by someone in 1968 and also be trivial? I mean sure, it looks trivial, but by that standard people could argue that for the 19-circle case or whatever. Wnt (talk) 20:58, 25 May 2015 (UTC)Reply

"density" values

edit

At least two density values are slightly too high; I'll edit that. The two in question are cases 6 and 7, where 6/9 and 7/9 are given as 0.6667... and 0.7778... respectively. Both are a bit too high. Although they round to the decimals stated, that rounding is up in both cases; the decimal fractions do not actually start with 0.6667... or 0.7778. 84.140.35.194 (talk) 13:07, 5 March 2019 (UTC)Reply

Algebraic numbers

edit

Should radii involving polynomial roots without closed form have their equations given? For example, the radius r of the smallest circle enclosing 12 packed circles being the root of 27r^10-270r^9+891r^8-648r^7-2826r^6+7884r^5-8050r^4+2104r^3+11151r^2-19310r-169 near 4. 76.121.231.9 (talk) 18:57, 21 April 2024 (UTC)Reply