mersenneforum.org > Math Generating Random Primes
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2010-12-28, 00:59 #12 CRGreathouse     Aug 2006 5,987 Posts On the verge of being proven -- care to bet on this?
2010-12-28, 03:41   #13
CRGreathouse

Aug 2006

598710 Posts

Quote:
 Originally Posted by davar55 I think my YJ-Conjecture will prove to be a lemma in the proof of the infinitude of the Mersenne Primes.
I'd also be willing to wager upward of \$0.01 on (a suitable formulation of) this being false.

Last fiddled with by CRGreathouse on 2010-12-28 at 03:41

2011-01-22, 00:30   #14
davar55

May 2004
New York City

108B16 Posts

Quote:
 Originally Posted by CRGreathouse On the verge of being proven -- care to bet on this?
Interesting how my mathy remark was taken as a challenge
to be challenged back by suggesting a bet. Gambling forbid.

2011-02-20, 16:06   #15
science_man_88

"Forget I exist"
Jul 2009
Dartmouth NS

20E216 Posts

Quote:
 Originally Posted by davar55 This is a naive question: Suppose I want to generate an N-digit prime. I pick an M > N, generate a (random) M-digit number (by choosing M random digits), and then try to factor M. What is the probabilty that such a random M-digit number has an N-digit prime factor (as a function of M and N)?
here's the best code I can come up with:
Code:
randomprime(n) = until(a>10^(n-1) && isprime(a),a=random(10^(n)-1));return(a)
try it yourself.

 Similar Threads Thread Thread Starter Forum Replies Last Post danaj Programming 17 2017-09-15 16:41 jasong Lounge 46 2017-05-09 12:32 Greenk12 Factoring 1 2008-11-15 13:56 Wacky Puzzles 46 2005-06-05 22:19 wblipp Software 2 2005-01-05 13:29

All times are UTC. The time now is 02:50.

Mon Feb 6 02:50:01 UTC 2023 up 172 days, 18 mins, 1 user, load averages: 0.69, 0.75, 0.79

Copyright ©2000 - 2023, 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.

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