Difference between revisions of "2023 AMC 10B Problems/Problem 14"
Line 51: | Line 51: | ||
==Solution 3 (Discriminant)== | ==Solution 3 (Discriminant)== | ||
We can move all terms to one side and wrote the equation as a quadratic in terms of <math>n</math> to get <cmath>(1-m^2)n^2+(m)n+(m^2)=0.</cmath> The discriminant of this quadratic is <cmath>\Delta = m^2-4(1-m^2)(m^2)=m^2(4m^2-3).</cmath> For <math>n</math> to be an integer, we must have <math>m^2(4m^2-3)</math> be a perfect square. Thus, either <math>4m^2-3</math> is a perfect square or <math>m^2 = 0</math> and <math>m = 0</math>. The first case gives <math>m=-1,1</math>, which result in the equations <math>-n+1=0</math> and <math>n-1=0</math>, for a total of two pairs: <math>(-1,1)</math> and <math>(1,-1)</math>. The second case gives the equation <math>n^2=0</math>, so it's only pair is <math>(0,0)</math>. In total, the total number of solutions is <math>\boxed{\textbf{(C) 3}}</math>. | We can move all terms to one side and wrote the equation as a quadratic in terms of <math>n</math> to get <cmath>(1-m^2)n^2+(m)n+(m^2)=0.</cmath> The discriminant of this quadratic is <cmath>\Delta = m^2-4(1-m^2)(m^2)=m^2(4m^2-3).</cmath> For <math>n</math> to be an integer, we must have <math>m^2(4m^2-3)</math> be a perfect square. Thus, either <math>4m^2-3</math> is a perfect square or <math>m^2 = 0</math> and <math>m = 0</math>. The first case gives <math>m=-1,1</math>, which result in the equations <math>-n+1=0</math> and <math>n-1=0</math>, for a total of two pairs: <math>(-1,1)</math> and <math>(1,-1)</math>. The second case gives the equation <math>n^2=0</math>, so it's only pair is <math>(0,0)</math>. In total, the total number of solutions is <math>\boxed{\textbf{(C) 3}}</math>. | ||
+ | |||
+ | ~A_MatheMagician |
Revision as of 19:46, 15 November 2023
How many ordered pairs of integers satisfy the equation ?
Solution 1
Clearly, is 1 solution. However there are definitely more, so we apply Simon's Favorite Factoring Expression to get this:
This basically say that the product of two consecutive numbers must be a perfect square which is practically impossible except or . gives . gives .
~Technodoggo ~minor edits by lucaswujc
Solution 2
Case 1: .
In this case, .
Case 2: .
Denote . Denote and . Thus, .
Thus, the equation given in this problem can be written as
Modulo , we have . Because , we must have . Plugging this into the above equation, we get . Thus, we must have and .
Thus, there are two solutions in this case: and .
Putting all cases together, the total number of solutions is .
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
Solution 3 (Discriminant)
We can move all terms to one side and wrote the equation as a quadratic in terms of to get The discriminant of this quadratic is For to be an integer, we must have be a perfect square. Thus, either is a perfect square or and . The first case gives , which result in the equations and , for a total of two pairs: and . The second case gives the equation , so it's only pair is . In total, the total number of solutions is .
~A_MatheMagician