List questions from totient-function

Published on 24 Mar 2026 - 9:39

334

Views

Proof any arithmetic progression coprime count same as toting function of n

Published on 30 Dec 2015 - 19:09

138

Views

Finding a summation involving gcd

Published on 03 Jan 2016 - 14:09

787

Views

Sum and product of coprimes?

Published on 09 Jan 2016 - 14:34

390

Views

Euler`s Theorem and Diophantine Equations

Published on 10 Jan 2016 - 1:23

494

Views

Let $m$ be the smallest positive integer such that $a^m \equiv 1 \pmod n$

Published on 10 Jan 2016 - 15:54

1.5k

Views

Let $d=(m,n)$. Prove: $φ (mn) = φ (m) φ (n)\frac{d}{φ (d)}$

Published on 10 Jan 2016 - 16:40

120

Views

Is $a_n=\frac{1}{n}\sum_{k=1}^n\frac{\varphi(k)}{k}$ convergent?

Published on 12 Jan 2016 - 22:27

7.6k

Views

Calculate $\phi(36)$, where $\phi$ is the Euler Totient function. Use this to calculate $13788 \pmod {36}$.

Published on 13 Jan 2016 - 18:11

121

Views

Solve the following equations for $x, (x ∈ N^+) (a)\ 2φ(x) = x; (b)\ 3φ(x) = x; (c)\ 4φ(x) = x.$

Published on 14 Jan 2016 - 14:13

157

Views

Solve the equation $2φ(x)=x $ for $x\in\mathbb N^+.$

Published on 15 Jan 2016 - 19:29

167

Views

Find all $x \in \mathbb{N}$ that satisfy $pφ(x)=x$, where $p$ is a prime.

Published on 16 Jan 2016 - 0:45

66

Views

$Φ_n$ is Euler group, $n> 2$ is an integer, and $m$ the number of solutions of the equation $x^2 = 1$ in the ring $Z_n$.

Published on 27 Mar 2026 - 17:06

68

Views

Product of the Euler phi function

Published on 19 Jan 2016 - 11:37

281

Views

Cracking any linear congruential generator

Published on 27 Jan 2016 - 22:25

List Question

About phi function

Proof any arithmetic progression coprime count same as toting function of n

Finding a summation involving gcd

Sum and product of coprimes?

Euler`s Theorem and Diophantine Equations

Let $m$ be the smallest positive integer such that $a^m \equiv 1 \pmod n$

Let $d=(m,n)$. Prove: $φ (mn) = φ (m) φ (n)\frac{d}{φ (d)}$

Is $a_n=\frac{1}{n}\sum_{k=1}^n\frac{\varphi(k)}{k}$ convergent?

Calculate $\phi(36)$, where $\phi$ is the Euler Totient function. Use this to calculate $13788 \pmod {36}$.

Solve the following equations for $x, (x ∈ N^+) (a)\ 2φ(x) = x; (b)\ 3φ(x) = x; (c)\ 4φ(x) = x.$

Solve the equation $2φ(x)=x $ for $x\in\mathbb N^+.$

Find all $x \in \mathbb{N}$ that satisfy $pφ(x)=x$, where $p$ is a prime.

$Φ_n$ is Euler group, $n> 2$ is an integer, and $m$ the number of solutions of the equation $x^2 = 1$ in the ring $Z_n$.

Product of the Euler phi function

Cracking any linear congruential generator

Trending Questions

Popular # Hahtags

Popular Questions