find HCF
\(\Huge \tt \color{black}{(2^{100}-1,2^{120}-1)}\)
@ikram002p
hmmm idk any simply method , but both sides devide 3,11,31,41 thus gcf=3*11*31*41 hmm
@ganeshie8 have an idea ?
if \(\large a|b\), then \(\large 2^{a}-1 | 2^{b}-1\)
|dw:1411473616799:dw|
:O i dont remember this
u mean a divided by b??
yes "a|b" is read as "a divides b"
for example : 2 | 6
5 | 25 etc
but :O
u mean 2^20
\(\large a|b \implies b = aq\) for some \(q\) so, \(\large \begin{align}2^{b}-1 &= a^{aq}-1\\~\\&=(2^a)^q-1\\~\\&=(2^a-1)(\text{some stuff})\end{align} \)
@ikram002p thats the proof for \(\large a|b \implies 2^a-1 | 2^b-1\)
yeah :O why i forget it :'(
but i still feel hmm something wrong about it
For this particular problem : Notice that \(\large \gcd(100,120) = 20\) \(\large 20|100 \implies 2^{20}-1 | 2^{100}-1\) \(\large 20|120 \implies 2^{20}-1 | 2^{120}-1\)
so \(\large 2^{20}-1\) is a common factor of both the given numbers, but how do we know it is the highest common factor ?
wrong about what ?
na nothing
we're using x^n-y^n formula remember, x-y is a factor of x^n-y^n ?
(x^2-y^2)=(x+y)(x-y)
http://math.stackexchange.com/questions/117660/proving-xn-yn-x-yxn-1-xn-2-y-x-yn-2-yn-1
im ok with it now
Okay please explain it to mathmath333, i gtg for now.. also we're not done with this problem because we have just proven that 2^20-1 is a common factor, but we don't know whether it is the highest or not yet
i cant stay online , however we might use ax+by=d
devide x=2^120-1 y=2^100-1 d=2^20-1 then show that (x/d ,y/d) are relativly prime
eclids algorithm solve it right ?
what grade are you doing
Join our real-time social learning platform and learn together with your friends!