mersenneforum.org - Search Results

		mersenneforum.org > Search Forums
Search Results

Showing results 1 to 6 of 6
Search took 0.01 seconds. Search: Posts Made By: Citrix

Forum: Prime Cullen Prime

2006-12-26, 19:56

Replies: 22

Cullen prime problem

Views: 16,341

Posted By Citrix

It is about as fast as my program. My program...

It is about as fast as my program. My program only computes upto 2^31, so there is no way to compare on speeds after that. As for the compiler, I am using VC++ 6.0. Is there a better compiler I could...

Forum: Prime Cullen Prime

2006-12-26, 05:42

Replies: 22

Cullen prime problem

Views: 16,341

Posted By Citrix

@ rouge. I was able to modify your program...

@ rouge.

I was able to modify your program yesterday, to suit my needs, but it did not become as fast as we thought it would have become. I just increased the size of the array that stores all the...

Forum: Prime Cullen Prime

2006-11-28, 22:57

Replies: 22

Cullen prime problem

Views: 16,341

Posted By Citrix

For small ranges like people at prothsearch.net...

For small ranges like people at prothsearch.net work on, my program is slightly slower than yours, but when it comes to just looking cullens where the index is prime, my program becomes several times...

Forum: Prime Cullen Prime

2006-11-25, 05:55

Replies: 22

Cullen prime problem

Views: 16,341

Posted By Citrix

Your program is the first thing I tried, but your...

Your program is the first thing I tried, but your program is about 10 times slower than my crude program. (A range of 1 million with n= 0 to 5 M, takes 15 sec to sieve on a intel celeron 1.5 ghz, for...

Forum: Prime Cullen Prime

2006-11-24, 22:57

Replies: 22

Cullen prime problem

Views: 16,341

Posted By Citrix

The challenge is to find p*2^p+1 so this does not...

The challenge is to find p*2^p+1 so this does not qualify as a solution.:no:

Forum: Prime Cullen Prime

2006-11-24, 21:03

Replies: 22

Cullen prime problem

Views: 16,341

Posted By Citrix

Cullen prime problem (How everything began)

On http://primes.utm.edu/top20/page.php?id=6
There is an open problem to find a cullen prime p*2^p+1 where p is also prime. Has anyone done anywork on this?

I tried to write a crude sieving...

Showing results 1 to 6 of 6

All times are UTC. The time now is 16:37.

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