Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.

Topic: Easy problem without primes
Replies: 33   Last Post: Dec 31, 2013 9:22 AM

 Search Thread: Advanced Search

 Messages: [ Previous | Next ]
 quasi Posts: 9,897 Registered: 7/15/05
Re: Easy problem without primes
Posted: Dec 30, 2013 5:42 AM
 Plain Text Reply

quasi wrote:
>quasi wrote:
>>Peter Percival wrote:
>>>
>>>What is the biggest disk that can be covered by 13 unit disks?

>>
>>It's very easy to show 13 unit disks can cover a disk of radius
>>
>> 2*cos(Pi/13)
>>
>>but I suspect that's not best possible.

>
>Actually, I can already see what appears to be a better
>arrangement. I haven't computed the radius coverable with the
>new arrangement but I'm fairly sure it's bigger than what I
>had previously.

Yes, definitely bigger.

A disk of radius r = 1 + sqrt(3) can be covered by 13 unit disks.

I _think_ that's best possible.

quasi

Date Subject Author
12/29/13 Port563
12/29/13 Robin Chapman
12/29/13 Port563
12/29/13 quasi
12/29/13 Peter Percival
12/29/13 Port563
12/30/13 quasi
12/30/13 quasi
12/30/13 quasi
12/30/13 Port563
12/30/13 quasi
12/30/13 Port563
12/30/13 Phil Carmody
12/30/13 Port563
12/30/13 quasi
12/30/13 Port563
12/30/13 fom
12/31/13 David Bernier
12/31/13 James Waldby
12/31/13 Port563
12/30/13 Phil Carmody
12/30/13 Peter Percival
12/30/13 Port563
12/30/13 Wizard-Of-Oz
12/30/13 Peter Percival
12/30/13 Wizard-Of-Oz
12/30/13 fom
12/30/13 Phil Carmody
12/30/13 quasi
12/30/13 Port563
12/29/13 Port563
12/30/13 Dr J R Stockton
12/30/13 Port563
12/29/13 Steffen Schuler

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.