Question

Consider all integers between 1 and pq where p and q are two distinct primes. We...

Consider all integers between 1 and pq where p and q are two distinct primes. We choose one of them, all with equal probability.

a) What is the probability that we choose any given number?

b) What is the probability that we choose a number that is

i) relatively prime to p?

ii) relatively prime to q?

iii) relatively prime to pq?

Homework Answers

Answer #1

a)

Total numbers between 1 and pq are pq

Probability that we choose any given number = 1/pq

b)

i)

All numbers between 1 and pq will be relatively prime to p except p and pq.

Total numbers between 1 and pq that are relatively prime to p are pq - 2

Probability that we choose a number that is relatively prime to p = (pq - 2) / pq

ii)

All numbers between 1 and pq will be relatively prime to q except q and pq.

Total numbers between 1 and pq that are relatively prime to q are pq - 2

Probability that we choose a number that is relatively prime to q = (pq - 2) / pq

iii)

All numbers between 1 and pq will be relatively prime to pq except pq.

Total numbers between 1 and pq that are relatively prime to pq are pq - 1

Probability that we choose a number that is relatively prime to pq = (pq - 1) / pq

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
I want to proove Q) Any group of order pq (where p,q are primes) is solvable
I want to proove Q) Any group of order pq (where p,q are primes) is solvable
Let p,q be prime numbers, not necessarily distinct. If a group G has order pq, prove...
Let p,q be prime numbers, not necessarily distinct. If a group G has order pq, prove that any proper subgroup (meaning a subgroup not equal to G itself) must be cyclic. Hint: what are the possible sizes of the subgroups?
Suppose n = rs where r and s are distinct primes, and let p be a...
Suppose n = rs where r and s are distinct primes, and let p be a prime. Determine (with proof, of course) the number of irreducible degree n monic polynomials in Fp[x]. (Hint: look at the proof for the number of prime degree polynomials) The notation Fp means the finite field with q elements
Using nested loops, write a function called primes(a,b) that takes in two positive integers a and...
Using nested loops, write a function called primes(a,b) that takes in two positive integers a and b (where a<b). Then simply RETURNS a string containing all the prime numbers between a and b (or if there are none, the string "No Primes"). You should check that a and b are valid inputs, that is, that a and b are integers such that a<b (otherwise, the function should print “No Primes”). Three sample calls of your function (in IDLE) should produce...
Let p and q be any two distinct prime numbers and define the relation a R...
Let p and q be any two distinct prime numbers and define the relation a R b on integers a,b by: a R b iff b-a is divisible by both p and q. I need to prove that: a) R is an equivalence relation. (which I have) b) The equivalence classes of R correspond to the elements of  ℤpq. That is: [a] = [b] as equivalence classes of R if and only if [a] = [b] as elements of ℤpq I...
So far, we have defined the total variation distance to be a distance TV(P,Q) between two...
So far, we have defined the total variation distance to be a distance TV(P,Q) between two probability measures P and Q. However, we will also refer to the total variation distance between two random variables or between two pdfs or two pmfs, as in the following. Compute TV(X,X+a) for any a∈(0,1), where X∼Ber(0.5). TV(X,X+a) = ?
Consider p(x) and q(x), where x ∈ U = {1, 2}. If the following is true,...
Consider p(x) and q(x), where x ∈ U = {1, 2}. If the following is true, give a rigorous argument. If it is false, give a counterexample. (Note that “p implies q” is the same as “if p, then q” and also as “p → q.”) (i) (∀x ∈ U, p(x) → q(x)) implies [ (∀x ∈ U, p(x)) → (∀x ∈ U, q(x)) ] ? What about its converse ? (ii) (∃x ∈ U, p(x) → q(x)) implies [...
For solving the problems, you are required to use the following formalization of the RSA public-key...
For solving the problems, you are required to use the following formalization of the RSA public-key cryptosystem. In the RSA public-key cryptosystem, each participants creates his public key and secret key according to the following steps: ·       Select two very large prime number p and q. The number of bits needed to represent p and q might be 1024. ·       Compute                n = pq                           (n) = (p – 1) (q – 1). The formula for (n) is owing to...
How to solve this equation to find f(n), where f(n)=1+p*f(n+1)+q*f(n-1). p,q are constant and p+q=1. We...
How to solve this equation to find f(n), where f(n)=1+p*f(n+1)+q*f(n-1). p,q are constant and p+q=1. We already know two point f(0)=f(d)=0, d is a constant number. what is f(n) as a function with p,q,d,n?
26. Consider the following statements. (i). If we are testing for the difference between two population...
26. Consider the following statements. (i). If we are testing for the difference between two population means, it is assumed that the sample observations from one population are independent of the sample observations from the other population. (ii). If we are testing for the difference between two population means, it is assumed that the two populations are approximately normal and have equal variances. (iii). The critical value of t for a two-tail test of the difference of two means, a...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT