MHB Problem of Calculating Probabilities

  • Thread starter Thread starter PeterJ1
  • Start date Start date
  • Tags Tags
    Probabilities
PeterJ1
Messages
17
Reaction score
0
I hope this question is in the right place.

I'm trying to calculate probabilities and struggling. Hopefully someone can help.

Suppose I want to calculate the probability of N being a product of a prime below sqrt N.

N will have a 1:2 chance of being a product of 2.

If N is not a product of 2 then it will have a 1:6 chance of being a product of 3.

If N is not a product of 2,3 then it will have a 1:15 chance of being a product of 5.

And so on...

How would I arrive at combined probability for the primes up to sqrt N?

It could be a different calc. I could sieve out the products of each primes at each step and then calculate the probabilities for only the numbers that remain. So, for the divisor 2 the odds are 1:2. For 3 the odds are 1/3 but half the numbers have already been eliminated so really it is 1/6. Then I could use 1/3p as a simple estimate for each successive potential divisor, but would have no idea how to sum them.

Either way I cannot see an easy way to do it.

(I know the the PNT gives the probability of a number being prime, by the way, but this is not where I'm going.)

Thanks for any help with this. No doubt the solution looks easy for you guys.

Another way to do it seems to be use a table for the sum of the reciprocals of primes up to sqrt N, but I want to be able to deduct from this primes that are irrelevant. So, if I multiply 2,3,5, 7 and deduct 1 to give N, then I know these primes can be ignored. If I deduct the odds of these four primes being divisors then I can deduct this from the sum of the reciprocals up to N and get some sort of result. But if there are 100 possible divisors to deduct then I'm back where I started, trying to work out the sum of probabilities for these 100 possible divisors.

If I've asked a **** fool question then my apologies.
 
Last edited:
Mathematics news on Phys.org
Re: Problem of Calculating Probabilitiers

PeterJ said:
I hope this question is in the right place.

I'm trying to calculate probabilities and struggling. Hopefully someone can help.

Suppose I want to calculate the probability of N being a product of a prime below sqrt N.
Do you mean "having a prime factor below sqrt(N)"?

N will have a 1:2 chance of being a product of 2.
Do you mean "being a product of two primes" or do you mean "having 2 as prime factor"? In either case, how do you arrive at "a 1:2 chance"?

If N is not a product of 2 then it will have a 1:6 chance of being a product of 3.

If N is not a product of 2,3 then it will have a 1:15 chance of being a product of 5.

And so on...

How would I arrive at combined probability for the primes up to sqrt N?

It could be a different calc. I could sieve out the products of each primes at each step and then calculate the probabilities for only the numbers that remain. So, for the divisor 2 the odds are 1:2. For 3 the odds are 1/3 but half the numbers have already been eliminated so really it is 1/6. Then I could use 1/3p as a simple estimate for each successive potential divisor, but would have no idea how to sum them.

Either way I cannot see an easy way to do it.

(I know the the PNT gives the probability of a number being prime, by the way, but this is not where I'm going.)

Thanks for any help with this. No doubt the solution looks easy for you guys.

Another way to do it seems to be use a table for the sum of the reciprocals of primes up to sqrt N, but I want to be able to deduct from this primes that are irrelevant. So, if I multiply 2,3,5, 7 and deduct 1 to give N, then I know these primes can be ignored. If I deduct the odds of these four primes being divisors then I can deduct this from the sum of the reciprocals up to N and get some sort of result. But if there are 100 possible divisors to deduct then I'm back where I started, trying to work out the sum of probabilities for these 100 possible divisors.

If I've asked a **** fool question then my apologies.
 
Re: Problem of Calculating Probabilitiers

HallsofIvy said:
Do you mean "having a prime factor below sqrt(N)"?

Yep.

Do you mean "being a product of two primes" or do you mean "having 2 as prime factor"?

Having 2 as a factor.

In either case, how do you arrive at "a 1:2 chance"?

Er, one in every two numbers is divisible by 2.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top