Difference between revisions of "2015 AIME II Problems/Problem 5"
m (Add Solution Section) |
(→Solution) |
||
Line 4: | Line 4: | ||
==Solution== | ==Solution== | ||
+ | Call the given grid "Grid A". Consider Grid B, where the vertices of Grid B fall in the centers of the squares of Grid A; thus, Grid B has dimensions <math>(n-1) \times (n-1)</math>. There is a one-to-one correspondence between the edges of Grid B and the number of adjacent pairs of unit squares in Grid A. The number of edges in Grid b is <math>2n(n-1)</math>, and the number of ways to pick two squares out of grid A is <math>\dbinom{n^2}{2}</math>. So, the probability that the two chosen squares are adjacent is <math>\frac{2n(n-1)}{\dbinom{n^2}{2}} = \frac{2n(n-1}{\frac{n^2(n^2-1)}{2}} = \frac{4}{n(n+1)}</math>. We wish to find <math>n</math> such that <math>\frac{4}{n(n+1)} < \frac{1}{2015}</math>, and the first such <math>n</math> is <math>\boxed{90}</math>. |
Revision as of 20:43, 26 March 2015
Problem
Two unit squares are selected at random without replacement from an grid of unit squares. Find the least positive integer such that the probability that the two selected unit squares are horizontally or vertically adjacent is less than .
Solution
Call the given grid "Grid A". Consider Grid B, where the vertices of Grid B fall in the centers of the squares of Grid A; thus, Grid B has dimensions . There is a one-to-one correspondence between the edges of Grid B and the number of adjacent pairs of unit squares in Grid A. The number of edges in Grid b is , and the number of ways to pick two squares out of grid A is . So, the probability that the two chosen squares are adjacent is . We wish to find such that , and the first such is .