How many triples of integers ( a , b , c ) satisfy a 2 + b 2 − 8 c = 3 ?
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.
x^2 can also be 4 (mod 8) (e.g. 2^2, 6^2). But the argument still holds.
Log in to reply
Agreed. I did mod 8 first because there was a coefficient of 8.
Log in to reply
Do you want to update your solution to either add the 4 case or change it to mod 4 just to avoid confusion?
Log in to reply
@Narciso Jaramillo – I see your point here. I have added in the mod 4 case since that is easier to read, and wrote up the mod 8 case properly.
Thanks for improving the solution!
Log in to reply
@Calvin Lin – Tiny nitpick: the result in the mod 8 case can't be 6, I think.
Oh wow, that's very short!
@Kushal Bose I think this is what @Ravneet Singh was talking about.
Log in to reply
Yes that is very nice way
I have done by using fundamental ways but his method is very time-saving.
:)
Mod 3, 4, 8 is very common when looking at squares. Because there was a coefficient of 8, I immediately tried mod 8.
Mod 4 also works out in the same way.
x ≡ 0 , 1 , 2 ( m o d 3 ) x 2 ≡ 0 , 1 ( m o d 3 )
So different combinations of a , b , c are shown below:
Case(1) : If a = 3 l , b = 3 m , c = 3 n then :
9 l 2 + 9 m 2 − 2 4 n = 3 ⟹ 3 l 2 + 3 m 2 − 8 n = 1
If l , m both odd or both even then L.H.S. will be even and R.H.S. is odd which is not possible.
So, either l or m will be odd-even or even-odd to sarisfy the equation.Let, l = 2 p and m = 2 q + 1 .
3 ( 4 p 2 + 4 q 2 + 4 q + 1 ) = 8 n + 1 ⟹ 1 2 k + 3 = 8 n + 1 ⟹ 1 2 k + 2 = 8 n ⟹ 6 k + 1 = 4 n .
L.H.S. is odd and R.H.S. is even that's not possible.So there is no solution.
Case(2): if a = 3 l + 1 , b = 3 m , c = 3 n + 1 then :
3 l ′ + 9 m 2 − 8 ( 3 n + 1 ) = 3 ⟹ 3 l ′ + 9 m 2 − 2 4 n = 1 1 ⟹ 3 ( l ′ + 3 m 2 − 8 n ) = 1 1 .
Here 3 ∣ 1 1 so there is no solution
Case(3): : if a = 3 l , b = 3 m + 1 , c = 3 n + 1 .
Same logic as above.
Case(4) : If a = 3 l + 1 , b = 3 m + 1 , c = 3 n + 2 then
3 l ′ + 3 m ′ − 8 ( 3 n + 2 ) = 3 ⟹ 3 l ′ + 3 m ′ − 2 4 n = 1 9 ⟹ 3 ( l ′ + m ′ − 8 n ) = 1 9 ⟹ 3 ( l ′ + m ′ − 8 n ) = 1 9 .
Here 3 ∣ 1 9 .So, there is no solution.
So, there are no ( a , b , c ) exists.
@Kushal Bose good solution....upvoted
But there is a shorter approach with the fact that every square number is either a multiple of 4 or 4n+1.
Problem Loading...
Note Loading...
Set Loading...
Recall that x 2 ≡ 0 , 1 ( m o d 4 ) . So,
a 2 + b 2 − 8 c ≡ ( 0 or 1 ) + ( 0 or 1 ) − 0 ≡ 0 , 1 , 2 ( m o d 4 )
Thus, the sum can never be equal to 3.
Similar approach working mod 8 due to the coefficient of 8:
Recall that x 2 ≡ 0 , 1 , 4 ( m o d 8 ) . So,
a 2 + b 2 − 8 c ≡ ( 0 , 1 or 4 ) + ( 0 , 1 or 4 ) − 0 ≡ 0 , 1 , 2 , 4 , 5 ( m o d 8 )
Thus, the sum can never be equal to 3.