Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

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


Math Forum » Discussions » sci.math.* » sci.math.independent

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

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
quasi

Posts: 9,897
Registered: 7/15/05
Re: Easy problem without primes
Posted: Dec 30, 2013 5:42 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic 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
Read Easy problem without primes
Port563
12/29/13
Read Re: Easy problem without primes
Robin Chapman
12/29/13
Read Re: Easy problem without primes
Port563
12/29/13
Read Re: Easy problem without primes
quasi
12/29/13
Read Re: Easy problem without primes
Peter Percival
12/29/13
Read Re: Easy problem without primes
Port563
12/30/13
Read Re: Easy problem without primes
quasi
12/30/13
Read Re: Easy problem without primes
quasi
12/30/13
Read Re: Easy problem without primes
quasi
12/30/13
Read Re: Easy problem without primes
Port563
12/30/13
Read Re: Easy problem without primes
quasi
12/30/13
Read Re: Easy problem without primes
Port563
12/30/13
Read Re: Easy problem without primes
Phil Carmody
12/30/13
Read Re: Easy problem without primes
Port563
12/30/13
Read Re: Easy problem without primes
quasi
12/30/13
Read Re: Easy problem without primes
Port563
12/30/13
Read Re: Easy problem without primes
fom
12/31/13
Read Re: Easy problem without primes
David Bernier
12/31/13
Read Re: Easy problem without primes
James Waldby
12/31/13
Read Re: Easy problem without primes
Port563
12/30/13
Read Re: Easy problem without primes
Phil Carmody
12/30/13
Read Re: Easy problem without primes
Peter Percival
12/30/13
Read Re: Easy problem without primes
Port563
12/30/13
Read Re: Easy problem without primes
Wizard-Of-Oz
12/30/13
Read Re: Easy problem without primes
Peter Percival
12/30/13
Read Re: Easy problem without primes
Wizard-Of-Oz
12/30/13
Read Re: Easy problem without primes
fom
12/30/13
Read Re: Easy problem without primes
Phil Carmody
12/30/13
Read Re: Easy problem without primes
quasi
12/30/13
Read Re: Easy problem without primes
Port563
12/29/13
Read Re: Easy problem without primes
Port563
12/30/13
Read Re: Easy problem without primes
Dr J R Stockton
12/30/13
Read Re: Easy problem without primes
Port563
12/29/13
Read Re: Easy problem without primes
Steffen Schuler

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

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