mersenneforum.org Super Cullen & Woodall primes
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2017-09-27, 01:28 #1 Citrix     Jun 2003 22×397 Posts Super Cullen & Woodall primes Super Cullen and Woodall defined as:- C(n)= n*2^(n*n)+1 W(n)= n*2^(n*n)-1 Primes so far 1*2^1-1 1*2^1+1 2*2^4-1 5*2^25+1 9*2^81+1 I think there are finite number of these primes, but I still wanted to search further. I have checked these up to 5 Million bits and plan to search further. I am using srsieve to sieve these numbers. Is there a faster sieve software or can gcwsieve be made faster for these numbers?
 2017-10-26, 09:12 #2 Citrix     Jun 2003 63416 Posts I have completed this to 8M bits. Continuing. I am using the following code to sieve. Does anyone have any suggestions on how to make this faster? Thanks. Code: //Adapted from multisieve void SuperCullenWoodallSieve::DoWork64Bit(uint64_t thePrime) { uint32_t nmin, nmax; nmin = 100; nmax = 32768; uint64_t temp, power; temp = thePrime + 1; temp >> 1; temp = expmod62(temp, nmax*nmax, thePrime); power = expmod62(2, 2 * nmax, thePrime); for (int x = nmax; x >= nmin; x--) { if (temp == x) LogFactor('-', x, 2, thePrime); if (temp == thePrime - x) LogFactor('+', x, 2, thePrime); temp = mulmod62(temp, power, thePrime); if (temp&1) { temp = temp + thePrime; } temp >> 1; if (power&1) { power = power + thePrime; } power >> 1; if (power&1) { power = power + thePrime; } power >> 1; } }

 Similar Threads Thread Thread Starter Forum Replies Last Post rogue And now for something completely different 42 2022-02-12 05:19 em99010pepe Factoring 9 2019-03-26 08:35 rogue And now for something completely different 13 2014-12-29 19:11 jasong jasong 9 2008-01-25 01:51 jasong Marin's Mersenne-aries 1 2007-11-18 23:17

All times are UTC. The time now is 06:35.

Wed Jun 29 06:35:19 UTC 2022 up 76 days, 4:36, 1 user, load averages: 1.25, 1.18, 1.05

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.

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