Suppose and be natural numbers such that the above holds true, where is a prime number. Find the number of solutions in .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Firstly, if b is odd, then 2 a − b is odd, so 4 b 2 a + b 2 a − b results in an irreducible fraction with a denominator divisible by 4. Thus, b is even. We will now consider 2 cases: when b = 4 k for some positive integer k , or when b = 2 m , where m is an odd positive integer.
Case 1: b = 4 k
Substituting this in, we get
p = 4 b 2 a + b 2 a − b ( k p ) 2 p 2 ( a + 2 k ) a ( k 2 − p 2 ) a = 4 4 k 2 a + 4 k 2 a − 4 k = k a + 2 k a − 2 k = a + 2 k a − 2 k = k 2 ( a − 2 k ) = 2 k ( k 2 + p 2 ) = k 2 − p 2 2 k ( k 2 + p 2 )
We know a must be an integer. We will consider 2 sub-cases now: when p ∣ k and when p ∣ k .
Case 1.1: p ∣ k
Let k = d p . We have
a = k 2 − p 2 2 k ( k 2 + p 2 ) = d 2 p 2 − p 2 2 d p ( d 2 p 2 + p 2 ) = d 2 − 1 2 d p ( d 2 + 1 )
We have g cd ( d , d 2 − 1 ) = 1 , so
d 2 − 1 2 p ( d 2 + 1 ) = 2 p ( 2 + d 2 − 1 1 ) ⟹ d 2 − 1 4 p ∈ Z ∈ Z
If d is even, we have d 2 − 1 is odd, so d 2 − 1 ∣ p ⟹ p = d 2 − 1 = ( d + 1 ) ( d − 1 ) . This is only possible if d − 1 = 1 , so d = 2 , p = 3 . Substituting this into the original formulae, we get ( a , b , p ) = ( 2 0 , 2 4 , 3 ) .
When d is odd, we must have d 2 − 1 ∣ 4 p ⟹ 4 p = d 2 − 1 ⟹ d = 3 , p = 2 . Therefore, we get ( a , b , p ) = ( 1 5 , 2 4 , 2 ) .
Case 1.2: p ∣ k
g cd ( k , k 2 − p 2 ) = g cd ( k , p 2 ) = 1 . Therefore,
g cd ( 2 k ( p 2 + k 2 ) , k 2 − p 2 ) = g cd ( 2 p 2 + 2 k 2 , k 2 − p 2 ) = g cd ( 4 p 2 , k 2 − p 2 )
Furthermore, g cd ( p 2 , k 2 − p 2 ) = g cd ( p 2 , k 2 ) = 1 . Thus,
g cd ( 4 p 2 , k 2 − p 2 ) = g cd ( 4 , k 2 − p 2 )
Thus, we want k 2 − p 2 = 1 , 2 , 4 . However, none of these values gives a positive solution for ( k , p ) , so there are no solutions in this case.
Case 2: b = 2 m
p = 4 b 2 a + b 2 a − b ( m 2 p ) 2 4 p 2 ( a + m ) a ( m 2 − 4 p 2 ) a = 4 2 m 2 a + 2 m 2 a − 2 m = 2 m a + m a − m = a + m a − m = m 2 ( a − m ) = m ( m 2 + 4 p 2 ) = m 2 − 4 p 2 m ( m 2 + 4 p 2 )
We do a similar case breakup as previously:
Case 2.1: p ∣ m
Let m = d p . We have
a = m 2 − 4 p 2 m ( m 2 + 4 p 2 ) = d 2 p 2 − 4 p 2 d p ( d 2 p 2 + 4 p 2 ) = d 2 − 4 d p ( d 2 + 4 )
Note that since m is odd, d must also be odd. Therefore, g cd ( d , d 2 − 4 ) = g cd ( d , 4 ) = 1 and g cd ( d 2 − 4 , d 2 + 4 ) = g cd ( d , 8 ) = 1 . herefore, in order for a to be an integer, d 2 − 4 p must be an integer. Thus, p = d 2 − 4 ⟹ p = ( d − 2 ) ( d + 2 ) ⟹ d − 2 = 1 . From this, we get ( p , d ) = ( 5 , 3 ) , so ( a , b , p ) = ( 3 9 , 3 0 , 5 ) .
Case 2.2: p ∣ m
We have g cd ( m , m 2 − 4 p 2 ) = g cd ( m , 4 p 2 ) = 1 since m is odd. Therefore, for a to be an integer, we must have
m 2 − 4 p 2 m 2 + 4 p 2 = 1 + m 2 − 4 p 2 8 p 2 ∈ Z
Furthermore, g cd ( m 2 − 4 p 2 , p 2 ) = 1 since m is odd, so we must have m 2 − 4 p 2 ∣ 8 . Thus, we must have m 2 − 4 p 2 = 1 , 2 , 4 , 8 . However, if we check these cases, we find no valid integer solutions.
Therefore, over all the cases, we have 3 solutions, namely ( 2 0 , 2 4 , 3 ) , ( 1 5 , 2 4 , 2 ) , ( 3 9 , 3 0 , 5 ) .