mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Hardware

Reply
 
Thread Tools
Old 2006-10-22, 21:04   #1
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

3×7×167 Posts
Default How do I interpret Prime95 factoring benchmarks?

Okay, I know that, for instance 2^x is half as big as 2^(x+1), so 2^60 is half as big as 2^61 and 1/4th as big as 2^62. Unfortunately, Prime95 gives the amount of time to test one factor, but I have no way of knowing how many factors are in a range.

Have I simply not managed to pick up on something that should be obvious?
jasong is offline   Reply With Quote
Old 2006-10-23, 12:08   #2
dsouza123
 
dsouza123's Avatar
 
Sep 2002

2·331 Posts
Default

For a 61 bit trial factor, it's value is between 2^60 and 2^61,
Given a Mersenne number m which is 2^p - 1 with p the prime exponent.

roughly 0.05*[int(2^61/(2*p)) - int(2^60/(2*p)]

because trial factors q are of the form 2*k*p + 1 with k = 1,2,3 etc
also they are 1 or 7 mod 8 and are also must be prime themselves.

The help file also mentions most get seived out leaving about 5 %
to test.
dsouza123 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
benchmarks similar to Prime95? ixfd64 Hardware 0 2011-01-12 22:15
P-1 factoring with Prime95 MatWur-S530113 Factoring 1 2007-09-22 02:53
How to interpret the report nimzo PrimeNet 5 2004-09-03 02:03
AMD Sempr0n Prime95 benchmarks!!! optim Hardware 18 2004-08-07 21:44
P-1 factoring in prime95 nucleon Math 5 2003-08-03 01:09

All times are UTC. The time now is 10:04.


Thu May 26 10:04:27 UTC 2022 up 42 days, 8:05, 0 users, load averages: 0.84, 1.04, 1.10

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.

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