Question

How to use the totient function in the context of clocks?

score 32 · Answer 1 · 2020-02-24 14:55:12

32

Views

How to use the totient function in the context of clocks?

Published on 24 Feb 2020 - 14:55

score 23 · Answer 2 · 2020-02-25 11:02:57

23

Views

Existence of numbers coprime within a certain limit

Published on 25 Feb 2020 - 11:02

score 81 · Answer 3 · 2020-02-28 21:46:07

81

Views

How to completely factor $x^{\varphi(a)} - 1$ when $\gcd(a,x)=1$?

Published on 28 Feb 2020 - 21:46

score 69 · Answer 4 · 2026-03-25 11:08:33

69

Views

Goldbach's conjecture and Euler's Totient function

Published on 25 Mar 2026 - 11:08

score 352 · Answer 5 · 2020-03-06 23:27:31

352

Views

Need to understand Lagrange's theorem and how it's applied in RSA

Published on 06 Mar 2020 - 23:27

score 541 · Answer 6 · 2020-03-07 11:37:17

541

Views

What's the REASON behind the mathematics of RSA?

Published on 07 Mar 2020 - 11:37

score 180 · Answer 7 · 2020-03-10 05:30:27

180

Views

Solution to $a^k \equiv b \pmod c$

Published on 10 Mar 2020 - 5:30

score 36 · Answer 8 · 2020-03-11 13:36:15

36

Views

Bounding subsets of Euler's totient function

Published on 11 Mar 2020 - 13:36

score 166 · Answer 9 · 2026-03-26 00:54:02

166

Views

From the equation $\sigma(x^{\varphi(y)})=\frac{1}{\varphi(x)}(x^y-1)$ involving arithmetic functions to a characterization of Sophie Germain primes

Published on 26 Mar 2026 - 0:54

score 152 · Answer 10 · 2020-03-13 13:58:02

152

Views

How to characterize pairs $(a,b) \in \mathbb N^2$ which satisfy this curious equation $\text{lcm}(a,b)-\text{gcd}(a,b)=\varphi(a \cdot b)$?

Published on 13 Mar 2020 - 13:58

score 821 · Answer 11 · 2020-03-15 17:02:32

821

Views

What's the greatest common divisor of $\phi(n)$ and $n$, where $\phi(n)$ is the Euler Totient Function?

Published on 15 Mar 2020 - 17:02

score 128 · Answer 12 · 2026-03-26 01:07:45

128

Views

On an inequality involving the Euler's totient function and the Lambert $W$ function

Published on 26 Mar 2026 - 1:07

score 273 · Answer 13 · 2026-03-27 00:57:08

273

Views

Complexity of repeatedly applying Euler's totient

Published on 27 Mar 2026 - 0:57

score 143 · Answer 14 · 2026-03-26 00:54:02

143

Views

From the equation $\sigma(x^{\sigma(y)-1})=\frac{1}{\varphi(x)}(x^{y+1}-1)$ involving arithmetic functions to a characterization of Mersenne exponents

Published on 26 Mar 2026 - 0:54

score 234 · Answer 15 · 2026-02-23 02:59:30

234

Views

On characterizations for near-square primes and Fermat primes in terms of equations involving arithmetic functions

Published on 23 Feb 2026 - 2:59

List Question

How to use the totient function in the context of clocks?

Existence of numbers coprime within a certain limit

How to completely factor $x^{\varphi(a)} - 1$ when $\gcd(a,x)=1$?

Goldbach's conjecture and Euler's Totient function

Need to understand Lagrange's theorem and how it's applied in RSA

What's the REASON behind the mathematics of RSA?

Solution to $a^k \equiv b \pmod c$

Bounding subsets of Euler's totient function

From the equation $\sigma(x^{\varphi(y)})=\frac{1}{\varphi(x)}(x^y-1)$ involving arithmetic functions to a characterization of Sophie Germain primes

How to characterize pairs $(a,b) \in \mathbb N^2$ which satisfy this curious equation $\text{lcm}(a,b)-\text{gcd}(a,b)=\varphi(a \cdot b)$?

What's the greatest common divisor of $\phi(n)$ and $n$, where $\phi(n)$ is the Euler Totient Function?

On an inequality involving the Euler's totient function and the Lambert $W$ function

Complexity of repeatedly applying Euler's totient

From the equation $\sigma(x^{\sigma(y)-1})=\frac{1}{\varphi(x)}(x^{y+1}-1)$ involving arithmetic functions to a characterization of Mersenne exponents

On characterizations for near-square primes and Fermat primes in terms of equations involving arithmetic functions

Trending Questions

Popular # Hahtags

Popular Questions