mersenneforum.org  

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

 
 
Thread Tools
Old 2003-12-16, 21:22   #1
jocelynl
 
Sep 2002

2·131 Posts
Default program P-1 for K*2^n-1

Hi All,

as promised here is a sample of P-1 for K*2^n-1
It is manual, but I'm working to get it to work with the NewPGen file. Have a try at it and let me know what you think.
I didn't make from gmp. Just to many includes in those files.
the source is from Andi34 and I as we were both coding factoring algorythm ecm, fermat, p-1, trial, etc...

p.s. it won't stop until it's done (unless you kill it)
Joss L15.

Last fiddled with by jocelynl on 2003-12-16 at 21:24
jocelynl is offline  
Old 2003-12-17, 00:44   #2
Val
 

22×5×7×53 Posts
Default

Now we are talkin!

Trying it now
 
Old 2003-12-17, 02:44   #3
SlashDude
 
SlashDude's Avatar
 
Aug 2002
Minneapolis, MN

22·3·19 Posts
Default

I'm running it on 210885*2^999997-1

fyi-
It's "stuck" at Current = 6 for the last 3 hours.
I'll let it run overnight.
SlashDude is offline  
Old 2003-12-17, 03:21   #4
jocelynl
 
Sep 2002

2×131 Posts
Default

It's "stuck" at Current = 6 for the last 3 hours.
I'll let it run overnight.

Mark something must be wrong

try
210885 999997 10000

is should try p-1 up to prm(10000) wich is = 104729
is will test gcd every 827 p-1

I'll try 999996.
I'm at current=10 in 20 sec.

Joss.
jocelynl is offline  
Old 2003-12-17, 16:09   #5
jocelynl
 
Sep 2002

2×131 Posts
Default

V1.1 is out K.2^n-1
It will do gcd more often.
It has nextk and nextn to quickly do the next one.
jocelynl is offline  
Old 2003-12-17, 16:37   #6
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

2·41·59 Posts
Default

would you mind adding a short textfile to help us using it the right way?

Luigi
ET_ is offline  
Old 2003-12-17, 17:17   #7
jocelynl
 
Sep 2002

2·131 Posts
Default

A Small help file has been added.
Joss
jocelynl is offline  
Old 2003-12-17, 17:29   #8
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

113468 Posts
Default

GREAT!

Thank you!

Luigi
ET_ is offline  
Old 2003-12-18, 05:51   #9
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

1110001001102 Posts
Default

Thank you for a nice software! I tried it and it's working. It's a bit slow but my cpu is slow too, an old 800MHz P-3 (all fast cpu's are busy searching for primes )

I opened an old sieving output file and gave him
to factor 1003166*2^1003166-1 with a known factor 2633. Instead he found 38,512,891!

By the way, in our case with trial factoring done to 4*10^12 what's your recommendation for P? And do you plan a batch version that can read the output of NewPGen and work as a "fine-sieve"? Or inclusion in the new version of LLR ...
Kosmaj is offline  
Old 2003-12-18, 15:52   #10
jocelynl
 
Sep 2002

4068 Posts
Default

Quote:
And do you plan a batch version that can read the output of NewPGen and work as a "fine-sieve"? Or inclusion in the new version of LLR ...
Yes I'm working on the batch version to do the P-1

The sieve like NewPGen uses assembly and is very fast
My C++ is not fast enough.

I'm also working on the source file of LLR to get the P-1 to work directly from LLR.EXE It would be much faster than my P-1.
We would be able to use the second stage of P-1.

Joss
jocelynl is offline  
Old 2003-12-28, 12:04   #11
Val
 

120238 Posts
Default

Hey Joss,

Would you mind, if p-1 is used for a General Mersenne project?
 
 

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
GPU LLR program jasong GPU Computing 19 2011-08-23 03:32
So you think you can program rogue Lounge 5 2009-10-02 15:02
Program Primeinator Information & Answers 5 2009-07-16 21:42
Program for GPU tribal Information & Answers 5 2009-03-19 20:54
which program? drakkar67 Prime Sierpinski Project 14 2005-11-29 06:25

All times are UTC. The time now is 20:08.


Fri Jan 21 20:08:55 UTC 2022 up 182 days, 14:37, 0 users, load averages: 1.53, 1.49, 1.51

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔