For two non-negative integers a and b , the equation 3 ⋅ 2 a + 1 = b 2 has solutions ( a 1 , b 1 ) , ( a 2 , b 2 ) , . . . , ( a n , b n ) .
Find a 1 + b 1 + a 2 + b 2 + . . . + a n + b n ?
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.
How do you prove that 6 is the only solution for b + 1 for odd-values of b?
Log in to reply
We know that b + 1 is 3 times a power of 2, so 6, 12, 24, and so on. If b + 1 ≥ 1 2 , we have b − 1 ≥ 1 0 . Since b − 1 cannot be divisible by 4, it must be divisible by some other primes and hence is not a power of 2. Therefore b ± 1 = 6 is the only option.
Log in to reply
Why can't it be divisible by 4?
Log in to reply
@Heather Betel – It is because b-1>=10 and hence it cannot be divisible by 4 coz 10 is not divisible by 4 so b-1 should be divisible by some other prime no. which is not a power of 2!!!
Log in to reply
@Erica Phillips – Let b+1 = (3.2^k) then (3.2^k)-2=2^l => 3.2^k=2 (2^(l-1)+1) =>l must be 2 and therefore b+1 must be 6.
Same reasoning goes for the case b-1=3.2^k which lead to b-1 must be 6
If b is even then (b-1)(b+1) is odd hence a = 0, b = 2.
If b is odd, set b = 2c+1.
Then 3 ⋅ 2 a = ( b − 1 ) ( b + 1 ) = 2 c ( 2 c + 2 )
Thus 3 ⋅ 2 a − 2 = c ( c + 1 ) by dividing both sides by 4.
Since one of c & c+1 is odd, it must equal 3 as that's the only odd factor of the LHS. The conclusion follows by trying each case in turn
Me salio de pura chiripa xddd
The possible pairs are (0,2),(3,5),(4,7)
However, can you prove that these are the only solutions?
how to solve
We write 3 ⋅ 2 a = ( b − 1 ) ( b + 1 ) , so we must have that one of b − 1 and b + 1 is a power of 2 , and the other is 3 times a power of 2 . This means that ( b − 1 , b + 1 ) = ( 3 ⋅ 2 x , 3 ⋅ 2 x ± 2 ) . We'll do casework to find all solutions.
Case 1: 3 ⋅ 2 x + 2
If this were the case, then we note that we must have 3 ⋅ 2 x + 2 = 2 x + 2 since 2 < 3 < 2 2 , and the other term must be a power of 2 . Solving gives 3 ⋅ 2 x + 2 = 2 x + 1 + 2 x + 2 = 2 x + 2 2 x + 2 = 2 x + 2 − 2 x + 1 = 2 x + 1 2 = 2 x + 1 − 2 x = 2 x ⟹ x = 1 which gives the solution ( b − 1 , b + 1 ) = ( 3 ⋅ 2 , 3 ⋅ 2 + 2 ) = ( 6 , 8 ) ⟹ ( a , b ) = ( 4 , 7 ) .
Case 2: 3 ⋅ 2 x − 2
This time we must have that 3 ⋅ 2 x − 2 = 2 x or 3 ⋅ 2 x − 2 = 2 x + 1 due to bounding on 3 again. If the former were the case, we get 2 x + 1 − 2 = 0 ⟹ x = 0 which gives the solution ( b − 1 , b + 1 ) = ( 1 , 3 ) ⟹ ( a , b ) = ( 0 , 2 ) . If the latter were the case we get 3 ⋅ 2 x − 2 = 2 x + 1 + 2 x − 2 = 2 x + 1 2 x − 2 = 0 ⟹ x = 1 which gives the solution ( b − 1 , b + 1 ) = ( 4 , 6 ) ⟹ ( a , b ) = ( 3 , 5 ) . Hence, the solution is 0 + 2 + 3 + 5 + 4 + 7 = 2 1 .
3.2^x + 2 = 2 ^ (x+2) how this is true
Rewriting it as 3 × 2 a = ( b + 1 ) ( b − 1 ) shows we need to look for two numbers, two apart, picking one from the set {3,6,12,24,48,..} and the other from the set {1,2,4,8,16,32,...}. We have the following solutions:
Summing up all a's and b's : 2 + 0 + 5 + 3 + 7 + 4 = 2 1
We can use LTE to solve the problem easily
Show us how you lift it.
Clarifying my solution a bit better: If b is even, then ( b − 1 ) ( b + 1 ) is odd so a=0 and b=2.
If b is odd, then we set c = 2 b − 1 to get c ( c + 1 ) = 3 × 2 a − 2 . Now since no odd prime factors than 3 are present in this product,
Problem Loading...
Note Loading...
Set Loading...
Writing 3 ⋅ 2 a = ( b − 1 ) ( b + 1 ) , we see that either one of the numbers b − 1 and b + 1 must be a power of 2 ; the other must be a power of 2 multiplied by 3 . If b is even, we must have ( b − 1 ) ( b + 1 ) = 1 ⋅ 3 , giving ( a , b ) = ( 0 , 2 ) . If b is odd, either b + 1 = 6 , giving ( a , b ) = ( 3 , 5 ) , or b − 1 = 6 , giving ( a , b ) = ( 4 , 7 ) .