Question

Modified Euler's Totient function for counting constellations in reduced residue systems

score 1.9k · Answer 1 · 2026-03-26 11:16:50

1.9k

Views

Modified Euler's Totient function for counting constellations in reduced residue systems

Published on 26 Mar 2026 - 11:16

score 10.7k · Answer 2 · 2013-02-27 23:40:10

10.7k

Views

How to calculate these totient summation sums efficiently?

Published on 27 Feb 2013 - 23:40

score 208 · Answer 3 · 2013-03-06 15:38:33

208

Views

Totient function and Euler's Theorem

Published on 06 Mar 2013 - 15:38

score 699 · Answer 4 · 2013-03-07 01:48:43

699

Views

Euler's Phi Function Worst Case

Published on 07 Mar 2013 - 1:48

score 336 · Answer 5 · 2013-03-17 23:30:44

336

Views

Asymptotic Growth of Unitary Totient

Published on 17 Mar 2013 - 23:30

score 129 · Answer 6 · 2026-03-28 10:41:43

129

Views

Prove: $\sum_{k<n, (k,n)=1} k= \frac{1}{2}n \varphi (n)$

Published on 28 Mar 2026 - 10:41

score 114 · Answer 7 · 2013-03-22 08:26:34

114

Views

Why is this fact about the totient function true?

Published on 22 Mar 2013 - 8:26

score 185 · Answer 8 · 2026-03-26 05:54:22

185

Views

How to find: $g(n)= \sum_{d|n}\frac{\phi(d)}d=?$

Published on 26 Mar 2026 - 5:54

score 1.2k · Answer 9 · 2013-03-28 06:06:07

1.2k

Views

Finding All Integers in such that $\phi(n)=80$

Published on 28 Mar 2013 - 6:06

score 276 · Answer 10 · 2020-08-13 19:04:46

276

Views

Let $S$ be the set of all integers $k$, $1\leq k\leq n$, such that $\gcd(k,n)=1$. What is the arithmetic mean of the integers in $S$?

Published on 13 Aug 2020 - 19:04

score 179 · Answer 11 · 2020-08-17 04:23:38

179

Views

Euler $\phi$ function satisfies $\phi(rs) = \phi(r) \phi(s)$

Published on 17 Aug 2020 - 4:23

score 5.1k · Answer 12 · 2020-08-23 00:17:15

5.1k

Views

Calculating $\phi(100)$ where $\phi$ is the totient function

Published on 23 Aug 2020 - 0:17

score 178 · Answer 13 · 2020-08-25 18:21:26

178

Views

question relating to the Euler's totient function

Published on 25 Aug 2020 - 18:21

score 548 · Answer 14 · 2020-08-27 15:48:38

548

Views

Divisibility of Euler's totient function: if $m|n$ then $\phi(m)|\phi(n)$

Published on 27 Aug 2020 - 15:48

score 362 · Answer 15 · 2026-03-30 03:22:01

362

Views

If r is a primitive root, then the residue of $r^t$ is also a primitive root if $\gcd(t,\phi(m))=1$ where $\phi$ is Euler's totient

Published on 30 Mar 2026 - 3:22

List Question

Modified Euler's Totient function for counting constellations in reduced residue systems

How to calculate these totient summation sums efficiently?

Totient function and Euler's Theorem

Euler's Phi Function Worst Case

Asymptotic Growth of Unitary Totient

Prove: $\sum_{k<n, (k,n)=1} k= \frac{1}{2}n \varphi (n)$

Why is this fact about the totient function true?

How to find: $g(n)= \sum_{d|n}\frac{\phi(d)}d=?$

Finding All Integers in such that $\phi(n)=80$

Let $S$ be the set of all integers $k$, $1\leq k\leq n$, such that $\gcd(k,n)=1$. What is the arithmetic mean of the integers in $S$?

Euler $\phi$ function satisfies $\phi(rs) = \phi(r) \phi(s)$

Calculating $\phi(100)$ where $\phi$ is the totient function

question relating to the Euler's totient function

Divisibility of Euler's totient function: if $m|n$ then $\phi(m)|\phi(n)$

If r is a primitive root, then the residue of $r^t$ is also a primitive root if $\gcd(t,\phi(m))=1$ where $\phi$ is Euler's totient

Trending Questions

Popular # Hahtags

Popular Questions