Question

For what values $m \in \mathbb{N}$, $\phi(m) | m$, where $\phi(m)$ is the Euler function.

score 354 · Answer 1 · 2015-09-15 18:19:19

354

Views

For what values $m \in \mathbb{N}$, $\phi(m) | m$, where $\phi(m)$ is the Euler function.

Published on 15 Sep 2015 - 18:19

score 250 · Answer 2 · 2015-09-17 00:16:06

250

Views

Showing that $k | 12$ given $k$ is the order of $2$ mod $13$.

Published on 17 Sep 2015 - 0:16

score 42 · Answer 3 · 2015-09-17 18:00:42

42

Views

Greatest common divisors and modular arithmetic.

Published on 17 Sep 2015 - 18:00

score 3.3k · Answer 4 · 2015-09-18 13:12:52

3.3k

Views

Euler's $\phi$ function: Find all $n$ such that $\phi(n)=n/3$

Published on 18 Sep 2015 - 13:12

score 589 · Answer 5 · 2015-10-04 20:52:07

589

Views

Prove that $\phi(mn) = m \phi(n) \Rightarrow m \mid n$

Published on 04 Oct 2015 - 20:52

score 731 · Answer 6 · 2015-10-06 10:03:44

731

Views

Improvement on $\phi(n)\sigma(n)/n^2$ bounds?

Published on 06 Oct 2015 - 10:03

score 190 · Answer 7 · 2015-10-08 03:15:28

190

Views

Find all $n \in \mathbb{Z}$, such that $\phi(2n)=\phi(3n)$?

Published on 08 Oct 2015 - 3:15

score 98 · Answer 8 · 2015-10-10 14:21:44

98

Views

Given $k$, what is the largest number $n$, such that $\phi(n) \le k$

Published on 10 Oct 2015 - 14:21

score 7.8k · Answer 9 · 2026-03-18 23:55:31

7.8k

Views

Use Euler's Theorem to Find a Number $x$ between $0$ and $28$ such that $x^{85} \equiv 6 \pmod{35}$

Published on 18 Mar 2026 - 23:55

score 230 · Answer 10 · 2026-02-28 11:30:57

230

Views

How many integers $m$ such that Euler Totient Function $\varphi(m)$ = a given integer?

Published on 28 Feb 2026 - 11:30

score 226 · Answer 11 · 2015-10-19 14:29:28

226

Views

Find all values of N that satisfy ϕ(N) = x for any given x value

Published on 19 Oct 2015 - 14:29

score 23 · Answer 12 · 2015-10-20 11:02:24

23

Views

A limit involving $\phi$

Published on 20 Oct 2015 - 11:02

score 163 · Answer 13 · 2026-03-26 08:16:44

163

Views

Finding the Final Digits in a Stacked Exponents Problem

Published on 26 Mar 2026 - 8:16

score 1.7k · Answer 14 · 2015-10-22 17:15:44

1.7k

Views

Proving the Converse of Euler's Totient Theorem

Published on 22 Oct 2015 - 17:15

score 340 · Answer 15 · 2026-03-26 21:11:25

340

Views

Mobius function vanishes over sum of totient numbers

Published on 26 Mar 2026 - 21:11

List Question

For what values $m \in \mathbb{N}$, $\phi(m) | m$, where $\phi(m)$ is the Euler function.

Showing that $k | 12$ given $k$ is the order of $2$ mod $13$.

Greatest common divisors and modular arithmetic.

Euler's $\phi$ function: Find all $n$ such that $\phi(n)=n/3$

Prove that $\phi(mn) = m \phi(n) \Rightarrow m \mid n$

Improvement on $\phi(n)\sigma(n)/n^2$ bounds?

Find all $n \in \mathbb{Z}$, such that $\phi(2n)=\phi(3n)$?

Given $k$, what is the largest number $n$, such that $\phi(n) \le k$

Use Euler's Theorem to Find a Number $x$ between $0$ and $28$ such that $x^{85} \equiv 6 \pmod{35}$

How many integers $m$ such that Euler Totient Function $\varphi(m)$ = a given integer?

Find all values of N that satisfy ϕ(N) = x for any given x value

A limit involving $\phi$

Finding the Final Digits in a Stacked Exponents Problem

Proving the Converse of Euler's Totient Theorem

Mobius function vanishes over sum of totient numbers

Trending Questions

Popular # Hahtags

Popular Questions