Binary representtion of prime numbers

Status
Not open for further replies.
M

mahaju

Full Member level 2
Joined
Mar 17, 2007
Messages
125
Helped
7
Reputation
14
Reaction score
2
Trophy points
1,298
Activity points
2,252
Is there any way to check whether a number is prime from it's binary representation? And I do not mean the classical method of dividing the number n by numbers from 2 to n-1, but actually determining if it is a prime from it's patterns of 0's and 1's.

Here are some of the related things I have found

**broken link removed**

visualising prime numbers in binary | anjackson.net

If there is any such method I would like to write a program in C or C++ to determine if a number is prime by using it's binary representation

Thanks in advance
Smile
 

Well, the difference between binary and decimal is just base number and they aren't fundamentally much different. If you can't do it with decimal, you cannot do it with binary either.
 
Last edited:

do you know if this has been proved mathematically?
 

i dont think there is any method available for your help.
 

Nope, none that I recall reading about... On the other hand, if you pick the right base you can always represent your prime by the number 10.

If you're interested in fun patterns related to primes, check out Ulam spirals.
 

Status
Not open for further replies.

Similar threads

Menu
Log in
Register
Cookies are required to use this site. You must accept them to continue using the site. Learn more…