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.
Sir, how did you break x 3 ≡ 1 0 1 0 ( m o d 2 0 2 1 ) into x 3 ≡ 2 1 ( m o d 4 3 ) and x 3 ≡ 2 3 ( m o d 4 7 ) ?
Log in to reply
2 0 2 1 = 4 3 × 4 7 and 1 0 1 0 ≡ 2 1 ( m o d 4 3 ) and 1 0 1 0 ≡ 2 3 ( m o d 4 7 ) .
@Mark Hennings Sir, how did you test the solutions manually?? I tried but only found the solutions 4 and 15 to the first equation and after that, it was practically impossible to solve on paper....Any help??
Log in to reply
One method is: Excel
You can do the first by noting that the equation x 3 ≡ 2 1 ( m o d 4 3 ) is the same as x 3 ≡ 6 4 ≡ 4 3 ( m o d 4 3 ) , and so we need to solve the equation x 3 − 4 3 ≡ ( x − 4 ) ( x 2 + 4 x + 1 6 ) ≡ ( x − 4 ) ( ( x + 2 ) 2 + 1 2 ) ( m o d 4 3 ) so we can break it down to either x ≡ 4 ( m o d 4 3 ) or each ( x + 2 ) 2 ≡ 3 1 ( m o d 4 3 ) . At least this means that we are only solving a quadratic equation. Given that you found 1 5 , you have one of the roots, and it will then be easy to find the other one.
The other equation can be handled similarly. Since x 3 ≡ 2 3 ≡ − 9 3 ( m o d 4 7 ) we obtain one root ( 3 8 ) and can reduce the rest of the eqation to a quadratic. If you know about quadratic residues and Legendre symbols, you can show that this quadratic has no roots, and hence that 3 8 is the only solution modulo 4 7 .
Log in to reply
@Mark Hennings Oh!! Thanks a lot Sir..!! I don't know why the breaking down into quadratics did not strike me!! Thanks a lot!!
I found only the following 9 solutions. Which are the others?
( 6 4 9 , 2 7 2 5 4 7 8 9 3 ) , ( 2 6 7 0 , 1 8 9 7 7 6 5 3 8 5 8 ) , ( 6 7 1 2 , 3 0 1 4 8 4 2 1 6 3 7 8 ) , ( 8 3 5 7 , 5 8 1 9 1 5 5 2 4 3 5 3 ) , ( 1 0 3 7 8 , 1 1 1 4 4 2 2 1 5 1 5 3 8 ) , ( 1 0 7 5 4 , 1 2 3 9 9 9 1 8 5 7 6 1 8 ) , ( 1 6 4 4 1 , 4 4 3 0 9 1 5 0 6 2 3 7 3 ) , ( 1 7 0 5 2 , 4 9 4 3 5 0 1 9 3 9 5 7 8 ) , ( 1 8 1 8 9 , 5 9 9 9 7 7 8 3 4 0 3 3 6 )
Log in to reply
Sir, the solutions are of the form x ≡ 2 7 3 , 6 4 9 , 8 8 4 ( m o d 2 0 2 1 ) . Anyways was your approach different from sir Mark Hennings'?
This is trivial in python.
solutions = 0
for x in range(1, 20000+1):
if ((2015 * x**3) + 2018) % 2021 == 0:
solutions = solutions + 1
print(solutions)
Problem Loading...
Note Loading...
Set Loading...
We need to solve the congruence 2 0 1 5 x 3 ≡ 3 ( m o d 2 0 2 1 ) , which is equivalent to x 3 ≡ 1 0 1 0 ( m o d 2 0 2 1 ) , which is in turn equivalent to the simultaneous congruences x 3 ≡ 2 1 ( m o d 4 3 ) x 3 ≡ 2 3 ( m o d 4 7 ) Testing gives the solution to the congruence x 3 ≡ 2 1 ( m o d 4 3 ) as x ≡ 4 , 1 5 , 2 4 ( m o d 4 3 ) , while the congruence x 3 ≡ 2 3 ( m o d 4 7 ) has the single solution x ≡ 3 8 ( m o d 4 7 ) .
If x ≡ 4 ( m o d 4 3 ) and x ≡ 3 8 ( m o d 4 7 ) , then we can use the Chinese Remainder Theorem to obtain x ≡ 6 4 9 ( m o d 2 0 2 1 ) . If x ≡ 1 5 ( m o d 4 3 ) and x ≡ 3 8 ( m o d 4 7 ) , then we can similarly obtain x ≡ 2 7 3 ( m o d 2 0 2 1 ) . Finally, if x ≡ 2 4 ( m o d 4 3 ) and x ≡ 3 8 ( m o d 4 7 ) , we obtain x ≡ 8 8 4 ( m o d 2 0 2 1 ) . Thus the solutions of our original equation are of the form x ≡ 2 7 3 , 6 4 9 , 8 8 4 ( m o d 2 0 2 1 ) . There are 3 0 such numbers between 1 and 1 9 9 9 9 .