Answer Happy • Let n = par where p, q, r are distinct primes. Describe an efficient algorithm that, given both n and p(n) = (p - 1)(9 -

Page 1 of 1

Let n = par where p, q, r are distinct primes. Describe an efficient algorithm that, given both n and p(n) = (p - 1)(9 -

Posted: Thu May 12, 2022 7:48 am

by answerhappygod

: Let N Par Where P Q R Are Distinct Primes Describe An Efficient Algorithm That Given Both N And P N P 1 9 1 (13.58 KiB) Viewed 24 times

Let n = par where p, q, r are distinct primes. Describe an efficient algorithm that, given both n and p(n) = (p - 1)(9 - 1)(r - 1), outputs the factors p, q,r.