Find the sum of all positive integers a such that a 2 ( 2 a − a 3 ) + 1 is a power of 7 .
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.
wow!
First observe that a must be even. This means
a 2 ( 2 a − a 3 ) + 1 ≡ 1 ( m o d 3 ) ⟹ a ≡ 0 , 1 ( m o d 3 ) ⟹ a ≡ 0 , 4 ( m o d 6 )
For a ≡ 0 ( m o d 6 ) , we see that this is impossible after plugging in a = 6 k and testing all 0 ≤ k ≤ 6 modulo 7 . For a ≡ 4 ( m o d 6 ) , we see that a = 6 k + 4 is only a residue for k = 7 k + 1 modulo 7 . Hence, a ≡ 1 0 ( m o d 4 2 ) . But we see that if k ≥ 1 , then a = 4 2 k + 1 0 is a nonresidue, meaning that k = 0 is the only solution: 1 0 .
You've ended your proof very abruptly. I did not understand even a single step of it.
Few questions here:
Why does the fact that a is even imply that it is congruent to 0 , 1 ( m o d 3 ) ? In particular, why must a 2 ( 2 a − a 3 ) be divisible by three and why do you know that it is divisible by three when a ≡ 1 ( m o d 3 ) ?
How can you find the residue modulo 7 so easily when you test a = 6 k and similarly a = 6 k + 4 ?
What do you mean by "if k ≥ 1 then a = 4 2 k + 1 0 is a nonresidue?"
Maybe I missed this, but how can you be sure that k = 0 even yields a solution? I see that it does by checking, but was there something you said in your proof that I missed?
Thanks
Log in to reply
a 2 ( 2 a − a 3 ) is divisible by 3 because
a 2 ( 2 a − a 3 ) = 7 k − 1 = ( 7 − 1 ) ( 7 k − 1 + . . . . + 1 ) = 6 ( 7 k − 1 + . . . + 1 )
Therefore,it is divisible by both 3 and 2..But I am still at a loss to comprehend the other parts of the proof.
How do you know that "if k ≥ 1 , , then a = 4 2 k + 1 0 is a nonresidue?"
Can you fill in the missing parts of the solution? There are so many gaps in it- I dont see how you go from one to the next.
Doesn't a being congruent to 0 or 1 mod 3 mean a is congruent to 0, 1, 3, or 4 mod 6, not just 0 or 4?
Edit: Also, a can be congruent to 2 mod 3. Take a=5 or a=11, for instance.
a^2(2^a - a^3) + 1 = 7^n.
a^2(2^a - a^3) = 7^n - 1.
7^n - 1 is always even.
=> a^2(2^a - a^3) is also always even.
2^a is even so if a were odd, odd x (even - odd) =odd x odd = odd.
and thats bad.
so a is even.
as 7^n is exponential is is never negative.
and 7^n - 1 is positive ( provided n > 0 ).
so we want a^2(2^a - a^3) to be positive.
for that 2^a - a^3 > 0.
2^a > a^3.
and this happens when a =< 10.
so now we have all tools ready, we are going to brute now.
in a^2(2^a - a^3) + 1 = 7^n.
a=10 then a^2(2^a - a^3) + 1 = 10^2(2^10 - 10^3) + 1 = 100(1024 - 1000) + 1 = 2401 = 7^4.
and for a > 10 we get no value as seven exponentials.
we have only a=10 as solution.
precisely
∑a = 10.
how do you justify "and for a > 10 we get no value as seven exponentials."?
Log in to reply
Soham says that 2 a > a 3 occurs at a ≤ 1 0 but in fact it occurs at a ≥ 1 0 , so Soham only checked a ≤ 1 0 .
Log in to reply
I also used some random values for a >=10 and accidentally guessed the answer right in the first try. Can you tell me how did you justify that we don't get any value as seven exponential.
a=10 is the only value which equals a power of 7; a=10 gives 2401 which is 7^4
Why is that???How can you be sure that values greater than 10 will not be a solution???
for the above equation to be true 2^1 must be greater than a^3 . so if u check for values of a for which the above eqn is true ull find that a>=10 satisfies the eqn . so substituting a=10 we get 2401=7^3 The PROBLEM CAN ALSO BE SOLVED IN ANOTHER METHOD power of 7's -->units digit-->can be ----->1,7,3,9 and so we can conclude sayin that a^2(2^a-a^3) is even becoz wen u subtract the 1 in the ques with the units digit we infer that its even so a^2 has to be even becoz if a^2 is odd then a^3 is also odd and we will get a even quantity which can never be a power of 7. Therefore 2^a-a^3 shud be even Checkin for values only possibility a =10 hence PROVED ;)
we can prove that a<=44, let a^2(2^a-a^3)+1=7^n, it' obvious that a is even, let a=2 m ,and a>=10 .both side mod 4, we have 1 =7^n , thus n is even, let n=2 k, then we have a^2 (2^a)-(7^k)^2=a^5-1 then a^5-1=[a (2^(a/2))-7^k][a (2^(a/2))+7^k] [a (2^(a/2))-7^k] is a positive integer so [a (2^(a/2))-7^k>=1 then we have a^5-1>=[a (2^(a/2))+7^k], obviously, a^5>a^5-1 and a (2^(a/2))+7^k>a (2^(a/2)) so a^5>a*(2^(a/2)) ,thus a^4>2^(a/2) then we get a<=44 (which is very loose),
Log in to reply
this soln. can be completed if we also note that a ≡ 3 ( m o d 7 ) and a ≡ 1 ( m o d 3 ) . This can be proved as follows:
The first and third case are not possible since a ≡ 1 ( m o d 3 ) is the only possibility.(putting a ≡ 2 ( m o d 3 ) in the expression given gives 0 mod 3.)
Thus a can take only values of the form 10+21k,k=0,1,... Since a ≤ 4 4 , the only possibilities are 10,31. a=10 is fine but the unit digit when we put a=31 is 8 which is not possible for a power of 7. Hence the only possibility is a=10.
Log in to reply
At first I thought of that third bullet as well. However, I realized it was inaccurate. Cubing doesn't exactly cycle like that . It is 0, 1, 1, 6, 1, 6, 6. It cycles mod 7, not like powers of 2, which cycles every 3. So you would have to take 21 cases, which if you are like me, would be too lazy to do. Plus it wouldn't lead to the desired result, probably. Furthermore, you could have found this mistake because a can be congruent to 0 mod 3, not just 1. Edit: a can also be congruent to 2 mod 3.
Log in to reply
@Alexander Xue – It is just coincidence that for square and power of 2 i wrote it in cycles. But it wasn't my intention because it just doesn't matter what the cycle is to write down the third bullet.
All you need to see is what are the various remainders you get when you modout a square, a power of 2 and a cube by 7 and then find out the correct combinations for which the third bullet is congruent to 0 mod 7.
For example when you take 2 from the first bracket, then the combinations
2 ( 2 − 6 ) + 1 and 2 ( 4 − 1 ) + 1 only give 0 mod 7.
Similarly you can check for other values 0,1 and 4. You should just get the above 3 cases in which a ≡ 0 ( m o d 3 ) doesn't occur because it implies 2 a ≡ 1 ( m o d 7 ) which is not possible.
Log in to reply
@Utkarsh Agrawal – Ah I see. Thanks. But a can be congruent to 2 mod 3. Take 5 for instance. Or 11. For a being congruent to 2 mod 3 and being odd, the equation becomes 1(2-8)+1 which is 1 mod 3, not 0. Also, in that last paragraph, where you said 2^a being congruent to 1 mod 7 is not possible, can you clarify on that? I can't see how it is not possible.
Log in to reply
@Alexander Xue – a congruent to 2 mod 3 is not possible because then the given expression becomes divisible by 3, which we don't want.
2^a congruent to 1 mod 7 is not possible because it doesn't occur in any(and clearly only) of the 3 cases I've listed above.
Log in to reply
@Utkarsh Agrawal – A being congruent to 2 mod 3 does not mean the given expression is divisible by 3...Just check 5 or 11 as I said in my previous comment. You may have been confused by 2^2 being congruent to 1 mod 3, but 2^(x), where x is congruent to 2 mod 3, is not necessarily congruent to 1 mod 3. The order of 2 mod 3 is 2, not 3, so it makes the cases a bit confusing--a^2 and a^3 will cycle in 3 but 2^a cycles in 2.
Log in to reply
@Alexander Xue – Yes , but actually we have a is even . so 2^(a)is always congruent to 1 mod 3, so if a is congruent to 2 mod 3, a^2(2^a-a^3)+1=a^2(1-a^3)+1=0 mod 3 .
@Alexander Xue – But a is even as well.
Both solutions are incomplete.You have just proven that a must be even for the entire expression to be odd.You have not shown that no other solution exists apart from a=10.
Log in to reply
I'm afraid I also don't know how to prove that there are no solutions a > 1 0 .
I considered the possibility that there are simply no a values such that the expression is a multiple of 7 5 (in which case the result would follow without much difficulty). It turns out, however, that there are a values such that the expression is a multiple of 7 5 ... a = 1 0 + 3 ⋅ 5 ⋅ 7 4 = 3 6 0 2 5 for example.
Problem Loading...
Note Loading...
Set Loading...
As most would have realized, by testing small values, a = 1 0 seems to be the only solution. However, it is harder to show that this is indeed the only possible solution.
First of all, if a is odd, then both a 2 and 2 a − a 3 are odd, so a 2 ( 2 a − a 3 ) + 1 is even, thus it is not a power of 7 . So a = 2 c for some integer c .
Suppose a 2 ( 2 a − a 3 ) + 1 = 7 b . Replacing a by 2 c , we get 4 c 2 ( 4 c − 8 c 3 ) = 7 b − 1 Modulo 3 , we get c 2 ( 1 + c ) ≡ 0 ( m o d 3 ) , so either c ≡ 0 or c ≡ 2 modulo 3 .
Now we consider this equation modulo 7 . We know that 4 3 ≡ 1 ( m o d 7 ) . Note that if c ≡ 0 ( m o d 3 ) , then 4 c ≡ 1 ( m o d 7 ) ; if c ≡ 2 ( m o d 3 ) , then 4 c ≡ 2 ( m o d 7 ) . Looking at all different residues of c modulo 7 we get that the only possibility is that c ≡ 2 ( m o d 3 ) and c ≡ 5 ( m o d 7 ) . This means c ≡ 5 ( m o d 2 1 ) , so c = 5 , 2 6 , 4 7 , . . . It is easy to check that c = 5 works, and it corresponds to a = 1 0 . We will prove that this is the only possibility.
Now considering the same equation modulo 8 , we easily conclude that b is even, say b = 2 d . Then note that 4 c 2 ⋅ 4 c and 7 b = 7 2 d are both perfect squares. Because for c ≥ 2 6 , 4 c 2 ⋅ ( 4 c − 8 c 3 ) + 1 is less than 4 c 2 ⋅ 4 c , it must be less than or equal to ( 2 c ⋅ 2 c − 1 ) 2 . This implies 3 2 c 5 ≥ 2 ⋅ 2 c ⋅ 2 c . This simplifies to 2 c ≤ 8 c 4 It is easy to see that this inequality is false for c ≥ 2 6 , thus c = 5 is the only solution.
So the answer is 10.