2 a − 2 b = 2 0 1 6
If the positive integers a and b satisfy the above equation, then find the value of a + b .
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.
Good, your solution proves that there is only one unique solution to this problem! Bonus question: Prove that there's no integer solution to the equation 2 a − 2 b − 2 c = 2 0 1 0 .
In response to Challenge Master: Since a > b > c , we can write the equation as:
2 c ( 2 a − c − 2 b − c − 1 ) = 2 × 3 × 5 × 6 7
Since ( 2 a − c − 2 b − c − 1 ) is always odd , clearly we get c = 1 .Hence the equation now gets transformed to:
2 a − 1 − 2 b − 1 = 1 0 0 6 2 b − 1 ( 2 a − b − 1 ) = 2 × 5 0 3
Again , since ( 2 a − b − 1 ) is always odd , clearly we get b = 2 .Hence , the equation again gets transformed to:
2 a − 2 − 1 = 5 0 3 2 a − 2 = 5 0 4 = 2 3 × 3 2 × 7
Since 5 0 4 is not a perfect power of 2 , this clearly shows that no integer solution exists for the given equation.
Log in to reply
You had the inequality at the start reversed. Fixed. Nice solution. :D
Good solution
2016-2048-32. 2048 comes from our knowledge of powers of 2. 2^10 is 1 megabyte =1024 bytes. Hence 2016-2^11-2^5. Thus 11+5=16.
Awesome solution
Nice Solution
I think you have not answered Calvin sir's question :P
Log in to reply
Oh! I didn't notice it since we do not get a notification when Calvin Sir posts a note.Thanks @Azhaghu Roopesh M for making me notice it.
I think I have answered @Calvin Lin sir's question now. :P .For more details , click here
Shouldn't it be 2 b instead of 2 b in the first step?
Log in to reply
Yeah.Sorry , it was a typo.
Shouldn't it be "shouldn't" instead of souldn't ? :P :P :P just kidding
Question:
2 a − 2 b = 2 0 1 6 ( 1 )
I am an Engineer, so unlike mathematicians, we start every solution by making some assumptions based on the evidence before us. First I assume that if someone posted this question to Brilliant, then there is one unique solution that will result in the screen turning green when I hit submit. After that, things get quite simple.
If 2016 is converted to binary, the solution is clear by inspection.
2 0 1 6 = 1 1 1 1 1 0 0 0 0 0 2
In binary, the solutions for 2 a and 2 b take the form of a 1 followed by a and b zeros respectively. Finding two such numbers to create a difference resulting in 1 1 1 1 1 0 0 0 0 0 2 gives the solution to eqn. (1) expressed in binary.
1 0 0 0 0 0 0 0 0 0 0 2 − 1 0 0 0 0 = 1 1 1 1 1 0 0 0 0 0 2
Converting back to base 10 we see eqn. (1) in a more familiar form.
2 1 1 − 2 5 = 2 0 1 6 a = 1 1 b = 5
The solution is the sum of a and b.
a + b = 1 6
2016 = 2 ^5 * 63 ....... 64 - 1 = 63 .......... 64 = 2^6 .........
2^5( 2^6 - 1 ) = 2 ^ 11 - 2 ^ 5
for this reason : a + b = 16
You have only shown that one solution exists. For completeness, you should show that there is only one solution that can exist. Like what Nihar Mahajan did, we know that a > b , so factoring out 2 b from LHS gives 2 b ( 2 a − b − 1 ) , because it is a multiplication of an even number and an odd number, our solution must be unique.
Since 2^11= 2048 and 2048-2016=32 and 2^5 is 32 and 11+5=16 We use 2048 because 2048 is the closest to 2016
This is what I did. It sucks though, compared to other solutions ;)
Nearest integer greater than 2016 which is power of 12 is - 2048. Now, 2048-2016 = 32. 32 = 2^5. 2048 = 2^11. 2016 = 2048 - 32. 2016 = 2^11 - 2^5.
11+5=16. Answer is 16.
2 1 2 = 2 0 4 8 ? How do you know whether there's only one solution? See my note in Oscar Rojas's solution.
By trials,we put a=11 then 2^11=2048,b=5 so 2^5=32,expression=2048-32=2016,,a+b=16
2 a − 2 b = 2 0 1 6
Noticing that there are powers of 2 on the L.H.S. and 2016 is an even number, I wanted to see if I could manipulate the R.H.S. to become a power of 2. Then by inspection, we would be able to see what the answer was clearly. Here is the method I used:
Prime Factorize 2016:
2 0 1 6 = 2 5 × 3 2 × 7
Divide both sides by 2 5 and multiply 3 2 and 7 on the R.H.S. to get 63. The equation will look like this:
2 5 2 a − 2 b = 6 3
Notice that the 63 is only 1 away from a power of 2.
64 is 2 6 . If I add 1 to both sides, I will get:
2 5 2 a − 2 b + 1 = 6 3 + 1
2 5 2 a − 2 b + 1 = 6 4
Rewriting 1 and 64 as powers of 2:
2 5 2 a − 2 b + 2 0 = 2 6
Subtracting 2 0 from both sides:
2 5 2 a − 2 b = 2 6 − 2 0
Multiplying both sides by 2 5 :
2 a − 2 b = 2 5 ( 2 6 − 2 0 )
Distributing:
2 a − 2 b = 2 1 1 − 2 5
Here we can see what a and b are:
a = 1 1 and b = 5
Therefore a + b = 1 6
I I'm pretty adept in base 2 since I'm a computer science enthusiast so I knew 2^11 = 2048 and I knew 2^5 = 32 so I just added the exponent and I got 16
(2^a - 2^b) = (2^11 - 2^5) So a=11 b=5
This is equal to 2048-32 which gives us the answer
What if there are more such pairs?How can you guarantee that this is the only unique solution and there are no other solutions possible?
Log in to reply
For that query I will consider your solution
It will only be correct when we prove that no other pair exists
Problem Loading...
Note Loading...
Set Loading...
2 a − 2 b = 2 0 1 6
Since a > b , then , 2 b ( 2 a − b − 1 ) = 2 0 1 6 = 2 5 × 3 2 × 7 .
But since ( 2 a − b − 1 ) is always odd , no power of 2 must be provided to it.Thus by comparing L . H . S and R . H . S we get :
→ 2 b = 2 5 ⇒ b = 5 → 2 a − b − 1 = 6 3 ⇒ 2 a − 5 = 6 4 = 2 6 ⇒ a − 5 = 6 ⇒ a = 1 1
Thus , a + b = 1 1 + 5 = 1 6