Q. 4.11

Question

(a) An integer N is to be selected at random from 1,2,,(10)3 in the sense that each integer has the same probability of being selected. What is the probability that N will be divisible by 3 ? by 5 ? by 7 ? by 15 ? by 105 ? How would your answer change if (10)3 is replaced by (10)k as k became larger and larger?

(b) An important function in number theory-one whose properties can be shown to be related to what is probably the most important unsolved problem of mathematics, the Riemann hypothesis - is the Möbius function μ(n), defined for all positive integral values n as follows: Factor n into its prime factors. If there is a repeated prime factor, as in 12=2·2·3 or 49=7·7, then μ(n) is defined to equal 0 . Now let N be chosen at random from 1,2,(10)k, where k is large. Determine P{μ(N)=0} as k. Hint: To compute P{μ(N)0}, use the identity

i=1Pi2-1Pi2=348924254849=6π2

where Pi is the i th-smallest prime. (The number 1 is not a prime.)

Step-by-Step Solution

Verified
Answer
  1. The ratio of divisible numbers i gets closer and closer on the limit    gets closer and closer P(N%i=0)1i
  2. The third equality is in fact an approximation since we have that N is a very large number, so we can consider all primes, not only that are less or equal to N.
1Step 1: Given information Part (a)

Each integer has the same probability of being selected.

We have to consider numbers 1,2,,103. Every third number out of them is divisible by 3 , so there exist 333 numbers that are divisible by three. Hence

P(N%3=0)=3331000

2Step 2: Calculation Part (a)

Using the similar argument, we have

P(N%5=0)=2001000

P(N%7=0)=1421000

P(N%15=0)=661000

P(N%105=0)=91000


3Step 3: Final answer Part (a)

If we apply a limit to these probabilities as k gets better and bigger, we could have

P(N%i=0)1i

since the ratio of divisible numbers  i gets closer and closer on the limit gets closer and closer 1 / i.

4Step 4: Given information Part (b)

i=1Pi2-1Pi2=348924254849=6π2

5Step 5: Calculation Part (b)

Observe that number N has not double primes in its factorization if and only if it is not divisible by any square of prime number. Hence

P(μ(N)=0)=PN%pi20, for all p-i less or equal to N

=piNPN%pi20

=pi1-PN%pi2=0

=pi1-1pi2

=pipi2-1pi2=6π2

where the third equality is in fact an approximation since we have that N is very large number, so we can consider all primes, not only that are less or equal to N.

6Step 6: Final Answer Part (b)

The third equality is in fact an approximation since we have that N is a very large number, so we can consider all primes, not only that are less or equal to N.N