Thread: Number of positive integers less than 550 and relatively prime to 550

Is there an efficient way to do this without just multiplying all the combinations of the canonical decomposition?

Originally Posted by dwsmith

Is there an efficient way to do this without just multiplying all the combinations of the canonical decomposition?

Do you mean you want something more efficient than this?



If you're writing a program, then you can do a sieve. I don't know what else.

I knew the phi function but I couldn't remember what it did. Thanks. I feel dumb now.