What is the last digit of the lowest common multiple of ( 3 2 0 0 2 + 1 ) and ( 3 2 0 0 2 − 1 ) ?
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.
Great!, but just one input. GCD of the two numbers is 2, we can say this as both the numbers are necessarily even. So the LCM is half the product of the two numbers, not particularly the product of the two numbers.
How do you prove that the last digit is 0, not 5?
@Freddie Hand The tenth digit will be even as the pattern tells-
3 3 = 2 7
3 4 = 8 1
3 5 = 2 4 3
3 6 = 7 2 9
and so on ⋯
Problem Loading...
Note Loading...
Set Loading...
It is quite easy
The LCM must be the product of the two = 3 4 0 0 4 − 1
Hence
We can see by Euler's Totient Function
ϕ ( 1 0 ) = 4
SO 3 4 = 1 m o d 1 0
3 4 0 0 4 = 1 m o d 1 0 [Powers are rasied to 1001 ]