[QUOTE=davieddy;277798]
Is it prime?[/QUOTE]

Kind of y'all to avoid pointing out that 11 11 11 11 11 11
was 2^12 - 1, although things might differ in bases other than 2.

David

Skyrim?
 

[QUOTE=ckdo;277848]Happy [URL="http://www.elderscrolls.com/skyrim/"]Skyrim[/URL] day, everyone! :w00t:[/QUOTE]I know practically nothing about The Elder Scrolls series beyond what's in The Fileplanet.com email newsletter. Here are some Skyrim links to mods that were in today’s newsletter: [URL]http://blog.fileplanet.com/2011/11/18/5-oddest-skyrim-mods/[/URL]
[URL]http://blog.fileplanet.com/2011/11/14/monday-mod-elder-scrolls-v-skyrim-detailed-faces/[/URL]
[URL]http://pc.gamespy.com/pc/elder-scrolls-v/1212918p1.html[/URL]
[URL]http://www.skyrimnexus.com/[/URL]
Or check out [URL="http://www.fileshack.com/"]http://www.fileshack.com[/URL]
After today, I won’t remember anymore to post Skyrim related files on this thread.

The Repunit Project has moved
 

[QUOTE=stathmk;278081]I found out about an hour ago about repunit.org. It’s a more appropriate project to join than the repunit project that I was planning on starting.[/QUOTE]The Repunit project has moved to [URL]http://www.elektrosoft.it/matematica/repunit/repunit.htm[/URL] if you're interested. I should have remembered to post here months ago that it's moved.

[QUOTE=stathmk;324992]The Repunit project has moved to [URL]http://www.elektrosoft.it/matematica/repunit/repunit.htm[/URL] if you're interested. I should have remembered to post here months ago that it's moved.[/QUOTE]

DId you look at Makoto Kamada's pages?

Luigi

Re: Makoto Kamada's pages
 

[QUOTE=ET_;325014]DId you look at Makoto Kamada's pages?

Luigi[/QUOTE]Thank you. Yes, I looked at them probably just after 11-11-2011 and I had forgotten that Makoto is the one behind them. I just now looked at them again after you posted. They are mostly about the factoring. I’m using Prime95 to attempt to find the actual probable prime repunits with over 2 million digits. I’m not trying to find the factors. The others in the Repunit Project might still be trying to find factors like these 3 probable primes:
(10^76,537-1)/(9*66,127,969) is 76,529 digits.
Phi(20233,10)/4797891757/550721298613 is 20,211 digits.
Phi(12413,10)/148957/4344551/38157563/323883992987 is 12,382 digits.

There’s a Luigi Morelli listed under contributors at [URL]http://homepage2.nifty.com/m_kamada/math/factorizations.htm[/URL] , but I don’t know if you meant you are him and worked with Makoto Kamada.

I just realized that Mersenne numbers are repunits in base-2.

I've known about the fact that they're all 1s for years, I just hadn't connected them to the term repunit.

Makes me think about the other numbers:

2- divisible by 2
3- divisible by 3
4- divisible by 2
5- divisible by 5
6- dvisible by 2

Damnit, just realized that they'd all be divisible by a repunit of the same number of digits. And I was so excited about the potential of 7, lol.

[QUOTE=jasong;325462]Damnit, just realized that they'd all be divisible by a repunit of the same number of digits. And I was so excited about the potential of 7, lol.[/QUOTE]
Haha, you are not irremediable lost, then :razz:
Not only they must be repunits, to have any chance to be prime, but the number of 1s that appear must be prime too, otherwise they can be grouped and factored. For example 111111 in any base, is divisible by 11 and by 111 in that base: 11*1 01 01 = 11 11 11, or 111*001 001= 111 111 - it can be written in digit groups either as 11 11 11 or respective 111 111. Therefore, the number of ones must be prime - this is a generalization of the proof of the fact that if the Mp=2^p-1 is prime, so is p (the number of 1 in Mp written in base 2).

How do I test p(1,111,111,111)?
 

I’m learning Windows Primo. Please take a look at [URL]http://primes.utm.edu/top20/page.php?id=54[/URL] and [URL]http://www.ellipsa.eu/[/URL] . I understand that partitions are done in Primo, right? As of this moment, I tried to test p(120052058) in Textpad and Primo and I’m doing something wrong. I’d like to test or find a factor of p(1,111,111,111). How many digits would it have?

I’d like to figure out how many digits p((10^19-1)/9) and p((10^23-1)/9) have if somebody could figure this out. I’d also like to know how many digits F((10^19-1)/9) and F((10^23-1)/9) have. I estimate that F((10^19-1)/9) has 246*10^15 digits. I estimate that F((10^23-1)/9) has 246*10^19 digits. I’d also like to know how many digits 2^(R(19))-1 and 2^(R(23))-1 have. I estimate that they have a third of a quintillion digits and 3 1/3 sextillion digits.

[B]Edit:[/B] I almost forgot to mention L(R(19)) and L(R(23)). How many digits would they have?

[QUOTE=stathmk;327412]I’d like to test or find a factor of p(1,111,111,111). How many digits would it have?[/QUOTE]

[url]http://www.mersenne.ca/factor.php?n=1111111111[/url]

Partitions
 

[QUOTE=Uncwilly;327417][URL]http://www.mersenne.ca/factor.php?n=1111111111[/URL][/QUOTE]Sir, you are thinking of 1,111,111,111. I meant the partition of it. Click on the link in my post to the Top 20 partitions.