Question

Calculate Euler's totient function for perfect squares

score 1.7k · Answer 1 · 2026-04-12 15:12:33

1.7k

Views

Calculate Euler's totient function for perfect squares

Published on 12 Apr 2026 - 15:12

score 961 · Answer 2 · 2026-04-15 01:48:52

961

Views

Given $\varphi (n)$ and $n$ for large values, can we know prime factors of $n$

Published on 15 Apr 2026 - 1:48

score 219 · Answer 3 · 2026-04-15 00:20:34

219

Views

Evaluating $\sum_{n=1}^{\infty} \frac{\phi(n)}{7^n + 1}$, where $\phi(n)$ is Euler's totient function

Published on 15 Apr 2026 - 0:20

score 250 · Answer 4 · 2026-05-10 19:02:23

250

Views

Euler's totient function applied to higher power triples

Published on 10 May 2026 - 19:02

score 529 · Answer 5 · 2026-04-17 13:59:19

529

Views

For any $a$, can we find $b$ and $c$ such that $\phi(a^2)+\phi(b^2)=\phi(c^2)$? ($\phi$ is Euler's totient function.)

Published on 17 Apr 2026 - 13:59

score 727 · Answer 6 · 2026-05-10 18:23:06

727

Views

Application of Euler's totient function to find last digits

Published on 10 May 2026 - 18:23

score 330 · Answer 7 · 2026-04-16 22:38:49

330

Views

Proof of : $x^{n}\equiv x^{\varphi(m)+[n \bmod \varphi(m)]} \mod m$

Published on 16 Apr 2026 - 22:38

score 443 · Answer 8 · 2026-04-12 19:23:40

443

Views

Invertible elements $\mathbb{Z} / p^2 \mathbb{Z}$

Published on 12 Apr 2026 - 19:23

score 50 · Answer 9 · 2026-04-13 04:49:55

50

Views

How to prove $a^{k\times \phi(n)+1} \equiv a\ (mod\ n$)?

Published on 13 Apr 2026 - 4:49

score 352 · Answer 10 · 2026-04-13 06:19:09

352

Views

Proof if $x$ is order $\phi(n)$ in $\mathbb{Z}/n \mathbb{Z}$ all inverses are powers of $x$.

Published on 13 Apr 2026 - 6:19

score 1k · Answer 11 · 2026-04-15 14:00:57

1k

Views

using euler's theorem (phi/totient function) to compute order of group elements

Published on 15 Apr 2026 - 14:00

score 2.5k · Answer 12 · 2026-04-16 19:09:10

2.5k

Views

Show that if $ p\mid n$ then $\phi(np)=p\phi(n)$

Published on 16 Apr 2026 - 19:09

score 133 · Answer 13 · 2026-04-15 20:18:40

133

Views

Prove that a finite cyclic group of order $n>2$ has an even number of distinct generators. What can you deduce about $\phi(n)$ when $n>2$?

Published on 15 Apr 2026 - 20:18

score 196 · Answer 14 · 2026-04-15 11:49:09

196

Views

Proving Euler-Fermat's Theorem

Published on 15 Apr 2026 - 11:49

score 3.1k · Answer 15 · 2026-04-16 09:54:36

3.1k

Views

Find all numbers $n$ such that $\phi (n) = 20$

Published on 16 Apr 2026 - 9:54

List Question

Calculate Euler's totient function for perfect squares

Given $\varphi (n)$ and $n$ for large values, can we know prime factors of $n$

Evaluating $\sum_{n=1}^{\infty} \frac{\phi(n)}{7^n + 1}$, where $\phi(n)$ is Euler's totient function

Euler's totient function applied to higher power triples

For any $a$, can we find $b$ and $c$ such that $\phi(a^2)+\phi(b^2)=\phi(c^2)$? ($\phi$ is Euler's totient function.)

Application of Euler's totient function to find last digits

Proof of : $x^{n}\equiv x^{\varphi(m)+[n \bmod \varphi(m)]} \mod m$

Invertible elements $\mathbb{Z} / p^2 \mathbb{Z}$

How to prove $a^{k\times \phi(n)+1} \equiv a\ (mod\ n$)?

Proof if $x$ is order $\phi(n)$ in $\mathbb{Z}/n \mathbb{Z}$ all inverses are powers of $x$.

using euler's theorem (phi/totient function) to compute order of group elements

Show that if $ p\mid n$ then $\phi(np)=p\phi(n)$

Prove that a finite cyclic group of order $n>2$ has an even number of distinct generators. What can you deduce about $\phi(n)$ when $n>2$?

Proving Euler-Fermat's Theorem

Find all numbers $n$ such that $\phi (n) = 20$

Trending Questions

Popular # Hahtags

Popular Questions