mersenneforum.org Why is TFing small numbers harder?
 Register FAQ Search Today's Posts Mark Forums Read

 2014-12-19, 19:30 #1 casmith789   Dec 2014 1016 Posts Why is TFing small numbers harder? If I go to mersenne.ca I can work out the CPU credit for each assignment. Why is the CPU credit approx. 10x more when doing an exponent 10 times smaller? Shouldn't it be the same or even more for the larger exponent given bigger numbers are involved? e.g. M100000 from 2^70 to 2^71 - 2391 GHz days M1000000 from 2^70 to 2^71 - 239 GHz days M10000000 from 2^70 to 2^71 - 24 GHz days
 2014-12-19, 19:42 #2 paulunderwood     Sep 2002 Database er0rr 10000011010102 Posts Let Mp=2^p-1. Then Mp factors into the product of numbers of the form 2*p*n+1. So you get more bits for free with larger p when doing trial division, as you can step 2*p. I will leave it up to you to find out about factors modulo 8. Last fiddled with by paulunderwood on 2014-12-19 at 19:50
 2014-12-19, 20:16 #3 ATH Einyen     Dec 2003 Denmark 22·72·17 Posts For M100000 you need to search 2*n*p + 1 where n goes from: 2^70 / (2*100000) = 5,902,958,103,587,056 to 2^71 / (2*100000) = 11,805,916,207,174,113. For M1000000 n goes from 2^70 / (2*1000000) = 590,295,810,358,705 to 2^71 / (2*1000000) = 1,180,591,620,717,411 and for M10000000 n goes from 59,029,581,035,870 to 118,059,162,071,741. So each time the exponent raises by factor of 10 the search space decreases by a factor of 10, because we register the factor depth of the entire factor 2*p*n + 1 instead of the size or bit depth of the constant n. Last fiddled with by ATH on 2014-12-19 at 20:17
 2014-12-19, 22:35 #4 casmith789   Dec 2014 24 Posts Thanks guys, that makes sense
 2014-12-21, 16:23 #5 MattcAnderson     "Matthew Anderson" Dec 2010 Oregon, USA 2·34·7 Posts You're welcome.

 Similar Threads Thread Thread Starter Forum Replies Last Post aurashift Information & Answers 46 2015-05-01 04:09 Erich PrimeNet 16 2012-09-29 23:08 Unregistered Information & Answers 2 2011-08-22 22:53 Christenson Information & Answers 36 2011-02-16 04:29 cheesehead Math 7 2009-02-06 20:49

All times are UTC. The time now is 23:43.

Sun Jun 26 23:43:12 UTC 2022 up 73 days, 21:44, 1 user, load averages: 1.13, 1.12, 0.98

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.

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