My Math Forum Math camp qualifying quiz 2014 Problem 3

 Math Events Math Events, Competitions, Meetups - Local, Regional, State, National, International

 November 23rd, 2014, 03:09 PM #1 Newbie   Joined: Nov 2014 From: Amherst, MA Posts: 3 Thanks: 0 Math Focus: number theory Math camp qualifying quiz 2014 Problem 3 3. Let Pn be a regular n-sided polygon inscribed in a circle of radius 1. What is the minimum number of circles of radius 1/2 required to cover Pn completely? (Both Pn and the circles in this problem include the boundary as well as the interior.) Note: in order to prove that something is the minimum, you need to prove both that it works and that nothing smaller works.
November 23rd, 2014, 07:44 PM   #2
Banned Camp

Joined: Jun 2014
From: Earth

Posts: 945
Thanks: 191

Quote:
 Originally Posted by MariaAgnesi 3. Let Pn be a regular n-sided polygon inscribed in a circle of radius 1. What is the minimum number of circles of radius 1/2 required to cover Pn completely? (Both Pn and the circles in this problem include the boundary as well as the interior.) Note: in order to prove that something is the minimum, you need to prove both that it works and that nothing smaller works.
(Repeat message)

If you're really gifted, then you need to demonstrate it here. Show some of your attempts here.
If you can't even show some of what you know about what you know here, then you're
probably not ready to pass that qualifying for that math camp. And you shouldn't go to the math camp.

Last edited by Math Message Board tutor; November 23rd, 2014 at 07:47 PM.

 Tags 2014, camp, math, problem, qualifying, quiz

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post MariaAgnesi Math Events 1 November 23rd, 2014 07:46 PM csoles Elementary Math 3 February 26th, 2012 03:18 PM aaron-math Calculus 16 November 19th, 2011 06:03 AM GameOfNerds New Users 0 September 7th, 2011 02:30 PM waqasma New Users 1 March 29th, 2011 10:46 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top