Difference between revisions of "2024 AMC 10A Problems/Problem 11"
MRENTHUSIASM (talk | contribs) |
|||
Line 11: | Line 11: | ||
We square, rearrange, and apply the difference of squares formula to the given equation: <cmath>(n+m)(n-m)=49.</cmath> | We square, rearrange, and apply the difference of squares formula to the given equation: <cmath>(n+m)(n-m)=49.</cmath> | ||
It is clear that <math>n+m\geq n-m,</math> so <math>(n+m,n-m)=(49,1),(7,7),(-7,-7),(-1,-49).</math> Each ordered pair <math>(n+m,n-m)</math> gives one ordered pair <math>(m,n),</math> so there are <math>\boxed{\textbf{(D)}~4}</math> such ordered pairs <math>(m,n).</math> | It is clear that <math>n+m\geq n-m,</math> so <math>(n+m,n-m)=(49,1),(7,7),(-7,-7),(-1,-49).</math> Each ordered pair <math>(n+m,n-m)</math> gives one ordered pair <math>(m,n),</math> so there are <math>\boxed{\textbf{(D)}~4}</math> such ordered pairs <math>(m,n).</math> | ||
+ | |||
+ | == Problem == | ||
+ | How many ordered pairs of integers <math>(m, n)</math> satisfy <math>\sqrt{n^2 - 49} = m</math>? | ||
+ | |||
+ | <math>\textbf{(A)}~1\qquad\textbf{(B)}~2\qquad\textbf{(C)}~3\qquad\textbf{(D)}~4\qquad\textbf{(E)}</math> Infinitely many | ||
+ | |||
+ | == Solution 2 == | ||
+ | Squaring both sides of the given equation gives <cmath>n^2-49=m^2\rightarrow n^2-m^2=49\rightarrow (n+m)(n-m)=49</cmath>. Splitting <math>49</math> into its factors (keep in mind it doesn't ask for [b]positive[/b] integers, so the factors can be double negative, too) gives six cases: | ||
+ | <math>1\cdot49</math> | ||
+ | <math>7\cdot7</math> | ||
+ | <math>49\cdot1</math> | ||
+ | <math>-1\cdot -49</math> | ||
+ | <math>-7\cdot -7</math> | ||
+ | <math>-49\cdot -1</math>. | ||
+ | Note that the square root in the problem doesn't have <math>\pm</math> with it. Therefore, if there are two solutions, <math>(n,m)</math> and <math>(n,-m)</math>, then these together are to be counted as one solution. | ||
+ | The solutions expressed as <math>(n,m)</math> are: | ||
+ | <math>(25,24)</math> | ||
+ | <math>(25,-24)</math> | ||
+ | <math>(7,0)</math> | ||
+ | <math>(-7,0)</math> | ||
+ | <math>(-25,24)</math> | ||
+ | <math>(-25,-24)</math>. | ||
+ | <math>(25,24)</math> and <math>(25,-24)</math> are to be counted as one, same for <math>(-25,24)</math> and <math>(-25,-24)</math>. Therefore, the solution is <math>\boxed{\text{(D) }4}</math> ~Tacos_are_yummy_1 |
Revision as of 16:22, 8 November 2024
Contents
Problem
How many ordered pairs of integers satisfy ?
Infinitely many
Solution
Note that is a nonnegative integer.
We square, rearrange, and apply the difference of squares formula to the given equation: It is clear that so Each ordered pair gives one ordered pair so there are such ordered pairs
Problem
How many ordered pairs of integers satisfy ?
Infinitely many
Solution 2
Squaring both sides of the given equation gives . Splitting into its factors (keep in mind it doesn't ask for [b]positive[/b] integers, so the factors can be double negative, too) gives six cases: . Note that the square root in the problem doesn't have with it. Therefore, if there are two solutions, and , then these together are to be counted as one solution. The solutions expressed as are: . and are to be counted as one, same for and . Therefore, the solution is ~Tacos_are_yummy_1