Matches in DBpedia 2016-04 for { ?s ?p "A cyclic number is a natural number n such that n and φ(n) are coprime. Here φ is Euler's totient function. An equivalent definition is that a number n is cyclic iff any group of order n is cyclic.Any prime number is clearly cyclic. All cyclic numbers are square-free.Let n = p1 p2 … pk where the pi are distinct primes, then φ(n) = (p1 − 1)(p2 − 1)...(pk – 1)."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Cyclic_number_(group_theory) comment "A cyclic number is a natural number n such that n and φ(n) are coprime. Here φ is Euler's totient function. An equivalent definition is that a number n is cyclic iff any group of order n is cyclic.Any prime number is clearly cyclic. All cyclic numbers are square-free.Let n = p1 p2 … pk where the pi are distinct primes, then φ(n) = (p1 − 1)(p2 − 1)...(pk – 1).".
- Q5198222 comment "A cyclic number is a natural number n such that n and φ(n) are coprime. Here φ is Euler's totient function. An equivalent definition is that a number n is cyclic iff any group of order n is cyclic.Any prime number is clearly cyclic. All cyclic numbers are square-free.Let n = p1 p2 … pk where the pi are distinct primes, then φ(n) = (p1 − 1)(p2 − 1)...(pk – 1).".