Difference between revisions of "2007 AMC 10A Problems/Problem 23"
m (→Solution 1) |
m (→Solution 2) |
||
Line 9: | Line 9: | ||
For every two factors <math>xy = 96</math>, we have <math>m+n=x, m-n=y \Longrightarrow m = \frac{x+y}{2}, n = \frac{x-y}{2}</math>. Since <math>m \ge n > 0</math>, <math>x+y \ge x-y > 0</math>, from which it follows that the number of ordered pairs <math>(m,n)</math> is given by the number of ordered pairs <math>(x,y): xy=96, x > y > 0</math>. There are <math>(5+1)(1+1) = 12</math> factors of <math>96</math>, which give us six pairs <math>(x,y)</math>. However, since <math>m,n</math> are positive integers, we also need that <math>\frac{x+y}{2}, \frac{x-y}{2}</math> are positive integers, so <math>x</math> and <math>y</math> must have the same [[parity]]. Thus we exclude the factors <math>(x,y) = (1,96)(3,32)</math>, and we are left with four pairs <math>\mathrm{(B)}</math>. | For every two factors <math>xy = 96</math>, we have <math>m+n=x, m-n=y \Longrightarrow m = \frac{x+y}{2}, n = \frac{x-y}{2}</math>. Since <math>m \ge n > 0</math>, <math>x+y \ge x-y > 0</math>, from which it follows that the number of ordered pairs <math>(m,n)</math> is given by the number of ordered pairs <math>(x,y): xy=96, x > y > 0</math>. There are <math>(5+1)(1+1) = 12</math> factors of <math>96</math>, which give us six pairs <math>(x,y)</math>. However, since <math>m,n</math> are positive integers, we also need that <math>\frac{x+y}{2}, \frac{x-y}{2}</math> are positive integers, so <math>x</math> and <math>y</math> must have the same [[parity]]. Thus we exclude the factors <math>(x,y) = (1,96)(3,32)</math>, and we are left with four pairs <math>\mathrm{(B)}</math>. | ||
===Solution 2=== | ===Solution 2=== | ||
+ | Efficient Solution- Krishna | ||
Similar to the solution above, reduce <math>96</math> to <math>2^5*3^1</math>. To find the number of distinct prime factors, add <math>1</math> to both exponents and multiply, which gives us <math>6*2=12</math> factors. Divide by <math>2</math> since <math>m</math> must be greater than or equal to <math>n</math>. We don't need to worry about <math>m</math> and <math>n</math> being equal because <math>96</math> is not a square number. Finally, subtract the two cases above for the same reason to get <math>\mathrm{(B)}</math>. | Similar to the solution above, reduce <math>96</math> to <math>2^5*3^1</math>. To find the number of distinct prime factors, add <math>1</math> to both exponents and multiply, which gives us <math>6*2=12</math> factors. Divide by <math>2</math> since <math>m</math> must be greater than or equal to <math>n</math>. We don't need to worry about <math>m</math> and <math>n</math> being equal because <math>96</math> is not a square number. Finally, subtract the two cases above for the same reason to get <math>\mathrm{(B)}</math>. | ||
Revision as of 01:39, 11 April 2020
Contents
Problem
How many ordered pairs of positive integers, with , have the property that their squares differ by ?
Solution 1
For every two factors , we have . Since , , from which it follows that the number of ordered pairs is given by the number of ordered pairs . There are factors of , which give us six pairs . However, since are positive integers, we also need that are positive integers, so and must have the same parity. Thus we exclude the factors , and we are left with four pairs .
Solution 2
Efficient Solution- Krishna Similar to the solution above, reduce to . To find the number of distinct prime factors, add to both exponents and multiply, which gives us factors. Divide by since must be greater than or equal to . We don't need to worry about and being equal because is not a square number. Finally, subtract the two cases above for the same reason to get .
See also
2007 AMC 10A (Problems • Answer Key • Resources) | ||
Preceded by Problem 22 |
Followed by Problem 24 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.