Let ( a 1 , b 1 ) , ( a 2 , b 2 ) , . . . , ( a n , b n ) be all the pairs of prime numbers that satisfy a + 1 a + b b + 1 = n + 2 2 n for some positive integer n . Then find the sum of all possible values of b − a .
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.
mind blowing solution @Kazem Sepehrinia I actually found all the solutions of the equation.
First I divided the question in two parts where
Case I : a = 2 which gives the solution as ( a , b , n ) = ( 2 , 5 , 2 8 ) , ( 2 , 7 , 1 9 )
Case II : a , b are odd primes. ( a , b , n ) = ( p , p + 2 , 2 ( 2 p 2 + 6 p + 3 ) ) where p , p + 2 both are prime numbers.
For finding the solution of the case II, I wrote b = a + m where m is an even natural number. (since a , b are odd primes.)
Then I solved for n in terms of a , m .
n = m − 1 2 ( 2 a 2 + 2 a m + 2 a + m + 1 ) = m − 1 4 ( a + 1 ) 2 + ( 4 a + 2 )
(Now see that ( 4 ( a + 1 ) 2 ) = e v e n , ( m − 1 ) = o d d .
So unless m = 2
m − 1 4 ( a + 1 ) 2 = n o n − i n t e g e r and hence forth n = n o n − i n t e g e r ;which is false .
Therfore m = 2 and we are done .
For case I after putting a = 2 we get b = n − 1 0 3 ( n + 2 ) .
b = 3 + n − 1 0 3 6 since b is an integer we get n = ( 1 1 , 1 2 , 1 4 , 1 6 , 1 3 , 1 9 , 2 2 , 2 8 , 4 6 ) .
But b is prime . therefore n = 1 9 , 2 8
Why does b > a + 1 imply that g cd ( b , a + 1 ) = 1 ? Can't we have b = 1 0 , a = 4 which gives us g cd ( 1 0 , 5 ) = 5 ?
Edit: I forgot that they had to be prime numbers. It would be helpful to add a short explanation.
First I divided the question in two parts where
Case I : a = 2 which gives the solution as ( a , b , n ) = ( 2 , 5 , 2 8 ) , ( 2 , 7 , 1 9 )
Case II : a , b are odd primes. ( a , b , n ) = ( p , p + 2 , 2 ( 2 p 2 + 6 p + 3 ) ) where p , p + 2 both are prime numbers.
For finding the solution of the case II, I wrote b = a + m where m is an even natural number. (since a , b are odd primes and b > a + 1 .)
Then I solved for n in terms of a , m .
n = m − 1 2 ( 2 a 2 + 2 a m + 2 a + m + 1 ) = m − 1 4 ( a + 1 ) 2 + ( 4 a + 2 )
(Now see that ( 4 ( a + 1 ) 2 ) = e v e n , ( m − 1 ) = o d d .
So unless m = 2
m − 1 4 ( a + 1 ) 2 = n o n − i n t e g e r and hence forth n = n o n − i n t e g e r ;which is false .
Therfore m = 2 and we are done .
For case I after putting a = 2 we get b = n − 1 0 3 ( n + 2 ) = 3 + n − 1 0 3 6 .
Since b is an integer we get n = ( 1 1 , 1 2 , 1 4 , 1 6 , 1 3 , 1 9 , 2 2 , 2 8 , 4 6 ) .
But b is prime .
Therefore n = 1 9 , 2 8
4 ( a + 1 ) 2 being even and m − 1 odd does not imply that m = 2 .
Log in to reply
you are right this means that these are not all the solutions. But can we find other solutions. Any idea.
Log in to reply
Regarding my solution, all of the solutions are ( a , b , n ) = ( p , p + 2 , 4 ( p + 1 ) ( p + 2 ) ) , where p and p + 2 are prime ( a , b , n ) = ( p , p + 3 , 2 ( p + 1 ) ( p + 3 ) ) , where p and p + 3 are prime ( a , b , n ) = ( p , p + 5 , ( p + 1 ) ( p + 5 ) ) , where p and p + 5 are prime.
Log in to reply
@Kazem Sepehrinia – so i need to use your technique to prove that no other solutions exist
@Kazem Sepehrinia – try my new question very nice you will like it .
We can rewriting equation to
b ( a + 1 ) b − a − 1 = n + 2 4
So it leads to two conditions
Case I:
{ k ( b − a − 1 ) = 4 ——-(1) k b ( a + 1 ) = n + 2 ——-(2)
For some positive integer k , because R H S of ( 2 ) must be positive.
So k = 1 , 2 , 4 ,
When k = 1 , b − a = 5 , solving this we get a only solution which is ( 2 , 7 , 1 9 ) proves b − a = 5 is valid.
When k = 2 , b − a = 3 , solving this we can easily figure out a solution ( 2 , 5 , 2 8 ) proves b − a = 3 is valid.
When k = 4 , b − a = 2 , solving this we can easily figure out a solution ( 3 , 5 , 7 8 ) proves b − a = 2 is valid.
Case II:
{ ( b − a − 1 ) = 4 k ——-(3) b ( a + 1 ) = k ( n + 2 ) ——-(4)
For some positive integer k .
When k = 1 , b − a = 5 , don't need to prove this.
When k = 2 , b − a = 9 , we get a = 2 , b = 1 1 but b ( a + 1 ) = 3 3 = 2 ( n + 1 ) so b − a = 9 invalid.
When k = 4 , b − a = 1 7 , we get a = 2 , b = 1 9 but b ( a + 1 ) = 1 9 × 3 = 4 ( n + 1 ) so b − a = 1 7 invalid.
So sum of the values of ( b − a ) be 5 + 3 + 2 = 1 0
Feel free to tell me if I have wrong.
Problem Loading...
Note Loading...
Set Loading...
a + 1 a + b b + 1 = n + 2 2 n ⟹ 1 − a + 1 1 + 1 + b 1 = 2 − n + 2 4 Or a + 1 1 − b 1 = n + 2 4 ⟹ b ( a + 1 ) b − a − 1 = n + 2 4 And finally ( n + 2 ) ( b − a − 1 ) = 4 b ( a + 1 ) Notice that since b > a + 1 and a , b are prime numbers, thus, g cd ( b , a + 1 ) = 1 . It follows that b − ( a + 1 ) is co-prime to both b and a + 1 . Hence b − a − 1 ∣ 4 , b − a − 1 = 1 , 2 , 4 and b − a = 2 , 3 , 5 . Notice that n = b − a − 1 4 b ( a + 1 ) − 2 is a positive integer.