Question

What's the relation between Euler's generalisation of the little theorem of Fermat and RSA-encryption?

score 383 · Answer 1 · 2017-11-27 02:02:50

383

Views

What's the relation between Euler's generalisation of the little theorem of Fermat and RSA-encryption?

Published on 27 Nov 2017 - 2:02

score 179 · Answer 2 · 2026-03-30 15:15:57

179

Views

On Rassias' conjecture and $\varphi(x)(1+\varphi(y))=\sigma(z)$, with $\varphi(n)$ the Euler's totient function and $\sigma(n)$ the sum of divisors

Published on 30 Mar 2026 - 15:15

score 507 · Answer 3 · 2026-02-23 08:56:24

507

Views

Intuition Behind Necklace Formula

Published on 23 Feb 2026 - 8:56

score 2.2k · Answer 4 · 2017-12-04 11:52:56

2.2k

Views

Iterated Euler's totient function

Published on 04 Dec 2017 - 11:52

score 57 · Answer 5 · 2017-12-04 17:11:04

57

Views

Given a number $k$(for large $k$) find $f(k)$ such that for all $x \geq f(k)$, $\phi(x) > k$

Published on 04 Dec 2017 - 17:11

score 45 · Answer 6 · 2017-12-05 14:18:49

45

Views

Proving the $\gcd$ is divided by $p-1$

Published on 05 Dec 2017 - 14:18

score 35 · Answer 7 · 2026-03-25 23:37:42

35

Views

Issue with the linear congruence of 56x \equiv 70 modulo 455

Published on 25 Mar 2026 - 23:37

score 195 · Answer 8 · 2017-12-09 11:17:10

195

Views

Connection between minimal polynomial of $\cos(2\pi/k)$ and Euler's totient function

Published on 09 Dec 2017 - 11:17

score 123 · Answer 9 · 2026-03-27 23:37:56

123

Views

Elements of order 12 in $\mathbb{Z}_3 \times \mathbb{Z}_4 \times U(9)$.

Published on 27 Mar 2026 - 23:37

score 181 · Answer 10 · 2017-12-14 20:10:52

181

Views

What's the closed form of this :$\sum_{n=1}^{+\infty}\frac{(-1)^n\phi(n)}{n}$

Published on 14 Dec 2017 - 20:10

score 131 · Answer 11 · 2017-12-14 21:09:00

131

Views

proving that $x \rightarrow x^e \pmod m$ is not one to one

Published on 14 Dec 2017 - 21:09

score 6.4k · Answer 12 · 2017-12-30 19:34:53

6.4k

Views

Alternative proof of : $n = \sum_{d|n} \phi(d)$ which is the sum of Euler Phi Function over Divisors

Published on 30 Dec 2017 - 19:34

score 700 · Answer 13 · 2017-12-31 12:17:01

700

Views

If $a\mid b$ then $\phi(a)\mid \phi(b)$ for $a,b\in\mathbb{N}$

Published on 31 Dec 2017 - 12:17

score 36 · Answer 14 · 2018-01-03 20:43:19

36

Views

Verifying generators of sub-group

Published on 03 Jan 2018 - 20:43

score 51 · Answer 15 · 2018-01-08 09:39:54

51

Views

Problems on integers from the Bernoulli inequality I: totatives

Published on 08 Jan 2018 - 9:39

List Question

What's the relation between Euler's generalisation of the little theorem of Fermat and RSA-encryption?

On Rassias' conjecture and $\varphi(x)(1+\varphi(y))=\sigma(z)$, with $\varphi(n)$ the Euler's totient function and $\sigma(n)$ the sum of divisors

Intuition Behind Necklace Formula

Iterated Euler's totient function

Given a number $k$(for large $k$) find $f(k)$ such that for all $x \geq f(k)$, $\phi(x) > k$

Proving the $\gcd$ is divided by $p-1$

Issue with the linear congruence of 56x \equiv 70 modulo 455

Connection between minimal polynomial of $\cos(2\pi/k)$ and Euler's totient function

Elements of order 12 in $\mathbb{Z}_3 \times \mathbb{Z}_4 \times U(9)$.

What's the closed form of this :$\sum_{n=1}^{+\infty}\frac{(-1)^n\phi(n)}{n}$

proving that $x \rightarrow x^e \pmod m$ is not one to one

Alternative proof of : $n = \sum_{d|n} \phi(d)$ which is the sum of Euler Phi Function over Divisors

If $a\mid b$ then $\phi(a)\mid \phi(b)$ for $a,b\in\mathbb{N}$

Verifying generators of sub-group

Problems on integers from the Bernoulli inequality I: totatives

Trending Questions

Popular # Hahtags

Popular Questions