Question

Find at least $5$ integers $n$ such that $\varphi(n)=16$

score 690 · Answer 1 · 2019-02-17 10:56:40

690

Views

Find at least $5$ integers $n$ such that $\varphi(n)=16$

Published on 17 Feb 2019 - 10:56

score 53 · Answer 2 · 2019-02-18 16:53:24

53

Views

Show $\frac{\sum_{n=1}^{\infty}\frac{1}{\phi(n)^s}}{\zeta(s)}=\prod_{p}(1-1/p^s+1/(p-1)^s)$.

Published on 18 Feb 2019 - 16:53

score 99 · Answer 3 · 2026-03-25 13:33:27

99

Views

Is this a valid proof of Euler's product formula for the totient function?

Published on 25 Mar 2026 - 13:33

score 1.6k · Answer 4 · 2019-02-27 20:05:15

1.6k

Views

Show that $n^{13} - n$ is divisible by 2, 3, 5, 7, 13

Published on 27 Feb 2019 - 20:05

score 230 · Answer 5 · 2019-03-02 12:59:55

230

Views

Factorization of large (60-digit) number

Published on 02 Mar 2019 - 12:59

score 187 · Answer 6 · 2019-03-03 10:40:00

187

Views

Euler's totient function?

Published on 03 Mar 2019 - 10:40

score 181 · Answer 7 · 2026-03-22 16:22:52

181

Views

Fermat's Little Theorem & Euler's Theorem

Published on 22 Mar 2026 - 16:22

score 128 · Answer 8 · 2019-03-06 21:21:12

128

Views

Can the smallest solution of $\varphi(k)=n$ be an even positive integer?

Published on 06 Mar 2019 - 21:21

score 224 · Answer 9 · 2026-03-25 04:43:02

224

Views

. Suppose gcd(a, m) = d and that m > 1. Consider the congruence ax ≡ b (mod m). Should there be a solution for every choice of b?

Published on 25 Mar 2026 - 4:43

score 1.3k · Answer 10 · 2019-03-08 18:43:45

1.3k

Views

Euler's totient $\phi$ function as a product of primes

Published on 08 Mar 2019 - 18:43

score 483 · Answer 11 · 2019-03-09 21:35:41

483

Views

Use Euler's Theorem to reduce the power factor $P$ to a value $R$ less than $\phi(m).$

Published on 09 Mar 2019 - 21:35

score 65 · Answer 12 · 2019-03-10 16:15:57

65

Views

How do I prove that $\mathbb{Z}_n^*$ is a group?

Published on 10 Mar 2019 - 16:15

score 57 · Answer 13 · 2026-02-23 02:59:20

57

Views

What happens to $n^{\phi(p)} \equiv 1$ when $n$ and $p$ are not co-prime?

Published on 23 Feb 2026 - 2:59

score 73 · Answer 14 · 2019-03-11 10:10:31

73

Views

Show that for $n_1,n_2,...,n_p$ natural numbers, there is a natural number $n$ such that $\varphi(n)=n_1!n_2!...n_p!$

Published on 11 Mar 2019 - 10:10

score 166 · Answer 15 · 2019-03-13 05:15:48

166

Views

Find the remainder when $(34! + {75}^{37})^{39}$ is divided by $37$

Published on 13 Mar 2019 - 5:15

List Question

Find at least $5$ integers $n$ such that $\varphi(n)=16$

Show $\frac{\sum_{n=1}^{\infty}\frac{1}{\phi(n)^s}}{\zeta(s)}=\prod_{p}(1-1/p^s+1/(p-1)^s)$.

Is this a valid proof of Euler's product formula for the totient function?

Show that $n^{13} - n$ is divisible by 2, 3, 5, 7, 13

Factorization of large (60-digit) number

Euler's totient function?

Fermat's Little Theorem & Euler's Theorem

Can the smallest solution of $\varphi(k)=n$ be an even positive integer?

. Suppose gcd(a, m) = d and that m > 1. Consider the congruence ax ≡ b (mod m). Should there be a solution for every choice of b?

Euler's totient $\phi$ function as a product of primes

Use Euler's Theorem to reduce the power factor $P$ to a value $R$ less than $\phi(m).$

How do I prove that $\mathbb{Z}_n^*$ is a group?

What happens to $n^{\phi(p)} \equiv 1$ when $n$ and $p$ are not co-prime?

Show that for $n_1,n_2,...,n_p$ natural numbers, there is a natural number $n$ such that $\varphi(n)=n_1!n_2!...n_p!$

Find the remainder when $(34! + {75}^{37})^{39}$ is divided by $37$

Trending Questions

Popular # Hahtags

Popular Questions