Assuming that the function RP( ) is the Totient function, the method shown doesn't seem to work:Hi,
One method to find relative prime numbers for a given N is:
RP(55) = RP(5-1) * RP(11-1)
= 4 * 10
40.
Is the above a correct method, somebody please guide me.
Zulfi.
I'm not following how this is a counter example since 15 is not prime, and so you haveAssuming that the function RP( ) is the Totient function, the method shown doesn't seem to work:
View attachment 193613
RP(55) = RP(5-1) * RP(11-1) needs to be RP(55) = (5-1) * (11-1)
------------------------------------------------------
Furthermore, not all numbers of the class described by WBahn: a "number that is a product of prime numbers, none of which are repeated. "
work with the method the TS describes:
View attachment 193614
The TS showed a number (55) factored into two factors. He didn't say that the factors had to be individual prime factors of the starting number. I factored my example number (165) into two factors, one of which could be factored further, but nothing in post #1 said that the method being illustrated required it. It appeared that a procedure applied to the two factors would give the desired result. The method was not completely specified.I'm not following how this is a counter example since 15 is not prime, and so you have
EulerPhi[165] = Euler[15]*EulerPhi[11] = EulerPhi[3]*EulerPhi[5]*EulerPhi[11] = (3-1)(5-1)(11-1) = 2·4·10 = 80
Both 7 & 3 are prime.phi(21) is not a prime= phi (7) * phi(3) : Not both 7 & 3 are prime = 6 * 2 = 12
by Luke James
by Steve Arar