Quick question. I know that the number of units + number of zero divisors + 1 = n for Z mod n. When n is the product of three distinct primes, how can I make the coding so Sage will return the number of zero divisors. I'm at a standstill and would appreciate any help. Thanks :]
Revision history [back]
 | 1 | initial version |
