Given that a has a remainder of 6 and b has a remainder of 1 when divided by 1 4 , what is the remainder of x when divided by 1 4 , given x is an integer solution to x 2 − 2 a x + b = 0
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.
Thanks for the reminder, lol. I didn't notice the image bears the answer to this question (for Japansese and non-Japanese speaker alike). Anyone who pays attention to the lower right corner of the image would have seen the answer written in numeral.
Anyway, there is another shorter solution which differs from the approach used in the image. Perhaps, if you have not paid too much attention to the image and let it guide your train of thought, you would have discovered it straightaway. It goes like this. :)
x 2 − 2 a x + b = 0
⇒ x 2 − 1 2 x + 1 ≡ 0 ( m o d 1 4 )
⇒ x 2 + 2 x + 1 ≡ 0 ( m o d 1 4 )
⇒ ( x + 1 ) 2 ≡ 0 ( m o d 1 4 )
⇒ x ≡ − 1 ( m o d 1 4 ) , giving 1 3 as the desired answer.
Nice work though working out the solution using the long way.
Log in to reply
or x ≡ 6 ± 6 2 − 1 ≡ 6 ± 3 6 + 1 3 ≡ 6 ± 7 ≡ 1 3 , − 1 ≡ 1 3 ( m o d 1 4 )
Log in to reply
I also did this way
Log in to reply
@Dev Sharma – I was thinking about a different method.
I was taught this way, so I don't really want to break the rules unless I have to.
Look at the equation mod 14,
x 2 − 2 ( 6 ) x + ( 1 ) = x 2 + 2 x + 1 = ( x + 1 ) 2 = 0 .
Therefore x is -1 = 13 (mod 14).
Solving the equation x 2 − 2 a x + b = 0 , we get x = 2 2 a ± 4 a 2 − 4 b = a ± a 2 − b In order for x to be an integer, a 2 − b = k 2 . This implies that: k 2 ≡ 7 ( m o d 1 4 ) ⇒ k ≡ 7 ( m o d 1 4 ) ⇒ x ≡ 6 ± 7 ≡ 1 3 ( m o d 1 4 )
Problem Loading...
Note Loading...
Set Loading...
You should really edit the image. There are people who know Japanese in Brilliant, including me :)
Anyway, here's the solution:
If x is an integer then suppose that x = 1 4 q 1 + r 1 for q 1 and r 1 being integers and 0 ≤ r 1 < 1 4 .
Also suppose that a = 1 4 q 2 + 6 and b = 1 4 q 3 + 1 for q 2 and q 3 being integers.
We have that:
x 2 − 2 a x + b = 0 ⇔ ( 1 4 q 1 + r 1 ) 2 − 2 ( 1 4 q 2 + 6 ) x + 1 4 q 3 + 1 = 0 ⇔ 1 4 ( 1 4 q 1 2 + 2 q 1 r 1 ) + r 1 2 + 1 4 ( − 2 x ) − 1 2 x + 1 4 q 3 + 1 = 0 ⇔ 1 4 ( 1 4 q 1 2 + 2 q 1 r 1 − 2 x + q 3 ) + r 1 2 − 1 2 ( 1 4 q 1 + r 1 ) + 1 = 0 ⇔ 1 4 ( 1 4 q 1 2 + 2 q 1 r 1 − 2 x + q 3 ) + 1 4 ( − 1 2 q 1 ) − 1 4 r 1 + 2 r 1 + 1 = 0 ⇔ 1 4 ( 1 4 q 1 2 + 2 q 1 r 1 − 2 x + q 3 − 1 2 q 1 − r 1 ) + ( r 1 + 1 ) 2 = 0
Obviously 1 4 ( 1 4 q 1 2 + 2 q 1 r 1 − 2 x + q 3 − 1 2 q 1 − r 1 ) ≡ 0 ( m o d 1 4 ) and 0 ≡ 0 ( m o d 1 4 ) .
Hence ( r 1 + 1 ) 2 ≡ 0 ( m o d 1 4 ) .
This leads to ( r 1 + 1 ) 2 ≡ 0 ( m o d 2 ) and ( r 1 + 1 ) 2 ≡ 0 ( m o d 7 ) .
Both lead to r 1 + 1 ≡ 0 ( m o d 2 ) and r 1 + 1 ≡ 0 ( m o d 7 ) (since 2 and 7 are primes), or r 1 + 1 ≡ 0 ( m o d 1 4 ) . And since 0 ≤ r 1 < 1 4 , r 1 = 1 3 .
After all of the messy work we've done, we can proudly announce that the remainder of x when divided by 1 4 is 1 3 .