|November 23rd, 2014, 04:09 PM||#1|
Joined: Nov 2014
From: Amherst, MA
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
|November 23rd, 2014, 08:44 PM||#2|
Joined: Jun 2014
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 08:47 PM.
|2014, camp, math, problem, qualifying, quiz|
|Thread||Thread Starter||Forum||Replies||Last Post|
|Math camp qualifying quiz 2014 Problem 1||MariaAgnesi||Math Events||1||November 23rd, 2014 08:46 PM|
|Solve a problem please!!! Quiz Monday||csoles||Elementary Math||3||February 26th, 2012 04:18 PM|
|Quiz problem that I got killed on||aaron-math||Calculus||16||November 19th, 2011 07:03 AM|
|Want to help make math questions for a quiz game?||GameOfNerds||New Users||0||September 7th, 2011 02:30 PM|
|Math quiz||waqasma||New Users||1||March 29th, 2011 10:46 AM|