mersenneforum.org  

Go Back   mersenneforum.org > New To GIMPS? Start Here! > Information & Answers

Reply
 
Thread Tools
Old 2010-05-25, 19:45   #1
Unregistered
 

23×3×13×17 Posts
Default Sieve depth vs. prime probability

A 300,000 digit number has no factors below 1 billion (10^9). What's the probability that this number is prime?
  Reply With Quote
Old 2010-05-25, 20:23   #2
R.D. Silverman
 
R.D. Silverman's Avatar
 
"Bob Silverman"
Nov 2003
North of Boston

2·3·31·41 Posts
Default

Quote:
Originally Posted by Unregistered View Post
A 300,000 digit number has no factors below 1 billion (10^9). What's the probability that this number is prime?
I get approx 5.3 x 10^-5.. It is simple conditional probability: P(A|B) =
P(A)/P(B). User Mertens' Thm.
R.D. Silverman is offline   Reply With Quote
Old 2010-05-25, 20:51   #3
TimSorbet
Account Deleted
 
TimSorbet's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

11×389 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
I get approx 5.3 x 10^-5.. It is simple conditional probability: P(A|B) =
P(A)/P(B). User Mertens' Thm.
Yep, that's it. I get:
5.3430028E-05 (out of 1), which is
1 in 18,716.07
TimSorbet is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Probability that N is prime given each divisor of N has the form 2*k*p+1 carpetpool Miscellaneous Math 6 2017-09-01 13:59
Probability that n is a prime power carpetpool Miscellaneous Math 6 2017-01-30 02:54
Probability that n is a semi-prime or prime carpetpool Miscellaneous Math 27 2017-01-19 21:00
probability a number is prime with a weighted k. Trilo Homework Help 12 2014-06-06 19:17
probability of finding a Mersenne prime optim Math 2 2003-12-06 19:03

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


Sun Sep 24 20:37:11 UTC 2023 up 11 days, 18:19, 0 users, load averages: 1.04, 0.99, 0.97

Powered by vBulletin® Version 3.8.11
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.

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