Ask your own question, for FREE!
Meta-math 18 Online
ganeshie8 (ganeshie8):

How to find one prime factor of \(\large 2^{23}-1\) without using computer

OpenStudy (anonymous):

you can use https://www.mathway.com/

OpenStudy (acxbox22):

"without using computer"

OpenStudy (anonymous):

oh oops

OpenStudy (acxbox22):

@ganeshie8 d you know of a way?

ganeshie8 (ganeshie8):

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

OpenStudy (ikram002p):

never seen this before @rational

OpenStudy (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\)

OpenStudy (rational):

the first two results are same :- contrapositives of each other

OpenStudy (rational):

the last result is very useful in finding prime factors of 2^p-1

OpenStudy (rational):

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 \)

OpenStudy (ikram002p):

interesting O.O

OpenStudy (rational):

typo : \(\large 2k*23\color{Red}{+}1 = 46k+1\)

OpenStudy (ikram002p):

i should read more of these stuff

OpenStudy (rational):

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

OpenStudy (rational):

you need to check if 47 | 2^23-1 or not

OpenStudy (ikram002p):

yess yess but it well reduce possible factors to (1/2)*(1/46) for all n <2^23-1

OpenStudy (ikram002p):

will*

OpenStudy (rational):

yes

OpenStudy (ikram002p):

cool ^^

OpenStudy (rational):

it reduces by 2p only

OpenStudy (rational):

also very few numbers of form 2kp+1 will be prime so that eliminates lot of trials

OpenStudy (ikram002p):

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

OpenStudy (rational):

yeah reducing by sqrt(n) is not same as reducing by 2

OpenStudy (rational):

sqrt(n) <<<<<<< n/2

OpenStudy (rational):

sqrt(36) <<<<< 36/2

OpenStudy (ikram002p):

ohk :o

OpenStudy (rational):

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

OpenStudy (rational):

go through when free

OpenStudy (rational):

*odd prime factors of 2^p-1 will be of form 2kp+1

OpenStudy (ikram002p):

its really interesting as i said i never seen it before

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!