How to find one prime factor of \(\large 2^{23}-1\) without using computer
"without using computer"
oh oops
@ganeshie8 d you know of a way?
I'm still reading the material, but I know there is a nice way to work for numbers of this form : \[\large 2^p-1\] Euler proved \(\large 2^{31}-1\) is prime back in the days when electricity itself was not known https://primes.utm.edu/notes/by_year.html
never seen this before @rational
here are some results i know so far : 1) \(\large 2^a-1\) is a prime \(\large \implies \) \(\large a\) is a prime 2) \(\large a\) is composite \(\large 2^a-1\) is composite 3) odd prime factors of \(\large 2^p-1\) will be of form \(\large 2kp+1\)
the first two results are same :- contrapositives of each other
the last result is very useful in finding prime factors of 2^p-1
for example, finding prime factors of \(\large 2^{23}-1\) is extremely trivial because we know that they will be of form \(\large 2k*23 - 1 = 46k+1 \)
interesting O.O
typo : \(\large 2k*23\color{Red}{+}1 = 46k+1\)
i should read more of these stuff
but ofcourse not all numbers of this form are factors of 2^23-1 you need to check if the numbers really divide 2^23-1 or not
you need to check if 47 | 2^23-1 or not
yess yess but it well reduce possible factors to (1/2)*(1/46) for all n <2^23-1
will*
yes
cool ^^
it reduces by 2p only
also very few numbers of form 2kp+1 will be prime so that eliminates lot of trials
wait i took 1/2 from sqrt n thingy :o which will already reduce them to half then as u said 2p also factorz will be >2p
yeah reducing by sqrt(n) is not same as reducing by 2
sqrt(n) <<<<<<< n/2
sqrt(36) <<<<< 36/2
ohk :o
its an interesting proof to see why odd factors of 2^p-1 will be of form 2kp+1 i have posted this question in MSE the other day
go through when free
*odd prime factors of 2^p-1 will be of form 2kp+1
its really interesting as i said i never seen it before
Join our real-time social learning platform and learn together with your friends!