List questions from totient-function

Published on 06 Dec 2019 - 20:50

1.3k

Views

What is a good way to introduce Euler's totient function?

Published on 25 Mar 2026 - 9:48

515

Views

How can I find the inverse of number using Fermat's Little Theorem or Euler's Theorem?

Published on 23 Feb 2026 - 2:59

140

Views

Finding possible values of $n$, for $\varphi(n) = 16$

Published on 11 Dec 2019 - 7:20

117

Views

Repetitive 1-9 pow last digit

Published on 11 Dec 2019 - 15:25

59

Views

Algorithms for encryptor in RSA

Published on 16 Dec 2019 - 0:50

132

Views

If $\gcd(a,1729) \neq 1$, show that $a^{37 }\equiv a \pmod {1729}$

Published on 18 Dec 2019 - 8:32

88

Views

Last digit of high numbered power up

Published on 19 Dec 2019 - 16:12

1.3k

Views

Show that there are infinitely many integers, n for which ϕ(n) is a perfect square.

Published on 22 Dec 2019 - 15:56

114

Views

Let $L(n)$ denote the number of positive divisors of a number $n$. Prove that $\sum_{n=1}^N L(n)=\lfloor{\sqrt N}\rfloor\pmod 2$.

Published on 26 Dec 2019 - 20:49

236

Views

Proof of infinitude of primes using ratio of n to its totient

Published on 25 Mar 2026 - 7:46

103

Views

Determine order of generator in GF(p)

Published on 31 Dec 2019 - 15:08

215

Views

Euler's function and primorial

Published on 25 Mar 2026 - 7:38

148

Views

Is there a valid explicit formula for $f(x)=\sum\limits_{n=1}^x \frac{1}{n}\sum\limits_{d|n} \mu(d)\,d$?

Published on 25 Mar 2026 - 10:57

333

Views

Prove that if $\gcd(, ()) = 1$ and $a^m\equiv 1\pmod{n}$ then $a\equiv 1\pmod{n}$

Published on 12 Jan 2020 - 14:29

List Question

show that $ n | \phi (a ^ n-1) $

What is a good way to introduce Euler's totient function?

How can I find the inverse of number using Fermat's Little Theorem or Euler's Theorem?

Finding possible values of $n$, for $\varphi(n) = 16$

Repetitive 1-9 pow last digit

Algorithms for encryptor in RSA

If $\gcd(a,1729) \neq 1$, show that $a^{37 }\equiv a \pmod {1729}$

Last digit of high numbered power up

Show that there are infinitely many integers, n for which ϕ(n) is a perfect square.

Let $L(n)$ denote the number of positive divisors of a number $n$. Prove that $\sum_{n=1}^N L(n)=\lfloor{\sqrt N}\rfloor\pmod 2$.

Proof of infinitude of primes using ratio of n to its totient

Determine order of generator in GF(p)

Euler's function and primorial

Is there a valid explicit formula for $f(x)=\sum\limits_{n=1}^x \frac{1}{n}\sum\limits_{d|n} \mu(d)\,d$?

Prove that if $\gcd(, ()) = 1$ and $a^m\equiv 1\pmod{n}$ then $a\equiv 1\pmod{n}$

Trending Questions

Popular # Hahtags

Popular Questions