How to find $gcd(5^{100}-1, 5^{120}-1)$?
The problem is numbers are really big ($5^{100}$ is 70 digits).
None of the numbers is prime.
I ran Euclid's algorithm on Python and found the answer in less than a second, however it seems that there is no on-paper approach to this problem, is it?
Thursday, 3 May 2018
gcd and lcm - GCD of two big numbers
Subscribe to:
Post Comments (Atom)
real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$
How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
$$ 3x+6y+5z=7 $$ The general solution to this linear Diophantine equation is as described here (Page 7-8) is: $$ x = 5k+2l+14 $$ $$ y = -l $...
-
I am trying to solve the following two problems: 1) Prove that the functions $\cos(z)$, $\sin(z)$ are surjective over the complex numbers. 2...
-
How to show the following inequality in Measure Theory: If $f$ is a non-negative measurable function defined on a measurable set $E$ then ...
No comments:
Post a Comment