- #1
Jkawa
- 4
- 0
Find all solutions to $m^2 - n^2 = 105$, for which both $m$ and $n$ are integers.
Jkawa said:Find all solutions to $m^2 - n^2 = 105$, for which both $m$ and $n$ are integers.
Prove It said:Notice $\displaystyle \begin{align*} m^2 - n^2 = \left( m - n \right) \left( m + n \right) \end{align*}$. So what are the factors of 105 that could be possible candidates for m-n and m+n?
Jkawa said:Upon inspection, I only see that the only solution to this is $m = 53$ and $n = 52$ because the rest of the factors do not equal 105. Am I correct?
MarkFL said:No, you can do the same with $3\cdot35$.
\(\displaystyle \frac{3+35}{2}=19\)
\(\displaystyle 19-3=16\)
\(\displaystyle (19+16)(19-16)=105\)
Try the other pairs. :D
A Diophantine equation is a polynomial equation in two or more unknowns where the solutions are restricted to be integers. In other words, the solutions to a Diophantine equation must be whole numbers.
There is no general method for solving all Diophantine equations. However, there are specific techniques that can be used depending on the form of the equation. Some common techniques include factoring, substitution, and using modular arithmetic.
The equation m^2 - n^2 = 105 is an example of a difference of squares Diophantine equation. It can be rewritten as (m + n)(m - n) = 105. This means that the solutions must be two integers whose product is 105.
There are multiple solutions to this equation. Some examples include m = 15 and n = 12, m = 55 and n = 50, and m = 106 and n = 105. There are an infinite number of solutions, as long as m and n are integers and their product is 105.
Yes, computers can be used to solve Diophantine equations. There are algorithms and computer programs specifically designed to solve these types of equations. However, the complexity of the equation and the size of the unknowns can greatly affect the time it takes for a computer to find a solution.