--%>

Problem on Prime theory

Suppose that p and q are different primes and n = pq.

(i) Express p + q in terms of Ø(n) and n.

(ii) Express p - q in terms of p + q and n.

(iii) Explain how to find p and q from n and Ø(n).

(iv) If n = 14647 and Ø(n) = 14400 find p and q.

(v) What is the impact of this on RSA?

   Related Questions in Mathematics

  • Q : What is the definition of a group Group

    Group: Let G be a set. When we say that o is a binary operation on G, we mean that o is a function from GxG into G. Informally, o takes pairs of elements of G as input and produces single elements of G as output. Examples are the operations + and x of

  • Q : Formal logic2 It's a problem set, they

    It's a problem set, they are attached. it's related to Sider's book which is "Logic to philosophy" I attached the book too. I need it on feb22 but feb23 still work

  • Q : Row-echelon matrix Determine into which

    Determine into which of the following 3 kinds (A), (B) and (C) the matrices (a) to (e) beneath can be categorized:       Type (A): The matrix is in both reduced row-echelon form and row-echelon form. Type (B): The matrix

  • Q : Elementary Logic Set & Model of a

    Prove that Elementary Logic Set is a Model of a Boolean Algebra The three Boolean operations of Logic are the three logical operations of  OR ( V ), AN

  • Q : Who independently developed

    Who independently developed a model for simply pricing risky assets?

  • Q : Formal logic It's a problem set, they

    It's a problem set, they are attached. it's related to Sider's book which is "Logic to philosophy" I attached the book too. I need it on feb22 but feb23 still work

  • Q : Who developed a rigorous theory for

    Who developed a rigorous theory for Brownian motion?

  • Q : Problem on budgeted cash collections

    XYZ Company collects 20% of a month's sales in the month of sale, 70% in the month following sale, and 5% in the second month following sale. The remainder is not collectible. Budgeted sales for the subsequent four months are:     

  • Q : Formal logic It's a problem set, they

    It's a problem set, they are attached. it's related to Sider's book which is "Logic to philosophy" I attached the book too. I need it on feb22 but feb23 still work

  • Q : State Fermat algorithm The basic Fermat

    The basic Fermat algorithm is as follows: Assume that n is an odd positive integer. Set c = [√n] (`ceiling of √n '). Then we consider in turn the numbers c2 - n; (c+1)2 - n; (c+2)2 - n..... until a perfect square is found. If th