mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Archived Projects > 15k Search

 
 
Thread Tools
Old 2004-12-18, 21:10   #1
TTn
 

3·172 Posts
Lightbulb Binary representation prime number of 1's.

This is an interesting corelation to RMA, if all of these primes are GM:
http://www.research.att.com/projects/OEIS?Anum=A081093
Quote:
Sequence: 3,7,31,127,3583,8191,131071,524287
Name: Smallest prime having in binary representation prime(n) number of
1's.
Comments: a(n) = Min{p: A000120(p)=A000040(n), p prime}.
Example: a(5)=3583=A081092(266)=A000040(502) having eleven 1's:
'110111111111', and A000120(p)<11=prime(5) for primes
p<3583.
Author(s): Reinhard Zumkeller
I doubt it, but I'll have to check into this, to see if it can be utilized.


Last fiddled with by TTn on 2004-12-18 at 21:13
 
 

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
very long binary representation to decimal davar55 Programming 24 2014-12-07 00:19
[Curiosity] Binary logarithm of a Mersenne number jnml Miscellaneous Math 3 2013-11-30 05:35
How to generate base10 representation of Mersenne-prime perfect numbers? James Heinrich Miscellaneous Math 10 2012-03-08 07:20
Square numbers and binary representation ET_ Miscellaneous Math 40 2010-06-06 12:55
2-d binary representation only_human Miscellaneous Math 9 2009-02-23 00:11

All times are UTC. The time now is 18:11.

Sat Jun 6 18:11:33 UTC 2020 up 73 days, 15:44, 1 user, load averages: 2.19, 1.97, 1.91

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.