Question

Prove that if $n>1$, the sum of positive integers less than $n$ and coprime to $n$ is $(1/2)na(n)$ where $a(n)$ is the number of such integers.

score 904 · Answer 1 · 2018-10-12 18:50:48

904

Views

Prove that if $n>1$, the sum of positive integers less than $n$ and coprime to $n$ is $(1/2)na(n)$ where $a(n)$ is the number of such integers.

Published on 12 Oct 2018 - 18:50

score 89 · Answer 2 · 2018-10-21 17:14:36

89

Views

Is there at least one pair from $a, b, c$ that is coprime?

Published on 21 Oct 2018 - 17:14

score 55 · Answer 3 · 2018-10-24 10:13:19

55

Views

If 1 can be a linear integer combination of 3 non zero integers then Is at least one of the three possible pairs coprime?

Published on 24 Oct 2018 - 10:13

score 141 · Answer 4 · 2018-11-02 19:10:41

141

Views

Relation between primeness and co-primeness of integers

Published on 02 Nov 2018 - 19:10

score 684 · Answer 5 · 2018-11-04 04:13:42

684

Views

Showing that two binomials are relatively prime for all positive integers (Euclidean ?)

Published on 04 Nov 2018 - 4:13

score 144 · Answer 6 · 2018-11-07 20:26:38

144

Views

Relation $ab=cd$ in $\mathbb{Z}$(UFD) with $a$ and $c$ coprime.

Published on 07 Nov 2018 - 20:26

score 55 · Answer 7 · 2018-11-10 15:25:52

55

Views

Defining a set of all possible non-congruent integer values

Published on 10 Nov 2018 - 15:25

score 68 · Answer 8 · 2018-11-17 13:35:55

68

Views

Best error term in $\sum_{(n,q)=1}\frac{1}{n}$ (harmonic series with coprimality condition)

Published on 17 Nov 2018 - 13:35

score 287 · Answer 9 · 2018-11-28 08:32:17

287

Views

Find all $n$ such that $\gcd(3n-4, n^2+1)=1$

Published on 28 Nov 2018 - 8:32

score 63 · Answer 10 · 2018-11-30 00:59:52

63

Views

Formula for product of sums of pairs of coprime divisors of $n$.

Published on 30 Nov 2018 - 0:59

score 352 · Answer 11 · 2018-12-05 17:54:57

352

Views

Cycle structure of the permutation $x \mapsto p·x\operatorname{mod}q$ for coprime $p,q$

Published on 05 Dec 2018 - 17:54

score 195 · Answer 12 · 2018-12-06 04:51:07

195

Views

How can I prove that a function $p(n)$ is multiplicative but not completely multiplicative?

Published on 06 Dec 2018 - 4:51

score 297 · Answer 13 · 2018-12-07 17:01:17

297

Views

Prove that for all $n$ $\gcd(n, x_n)=1$, given $x_{n+1}=2(x_n)^2-1$ and $x_1=2$

Published on 07 Dec 2018 - 17:01

score 1.6k · Answer 14 · 2019-01-01 09:49:36

1.6k

Views

How many positive integers $\le 1260$ are relatively prime to $1260$?

Published on 01 Jan 2019 - 9:49

score 735 · Answer 15 · 2019-01-03 22:41:13

735

Views

Proving That Consecutive Fibonacci Numbers are Relatively Prime

Published on 03 Jan 2019 - 22:41

List Question

Prove that if $n>1$, the sum of positive integers less than $n$ and coprime to $n$ is $(1/2)na(n)$ where $a(n)$ is the number of such integers.

Is there at least one pair from $a, b, c$ that is coprime?

If 1 can be a linear integer combination of 3 non zero integers then Is at least one of the three possible pairs coprime?

Relation between primeness and co-primeness of integers

Showing that two binomials are relatively prime for all positive integers (Euclidean ?)

Relation $ab=cd$ in $\mathbb{Z}$(UFD) with $a$ and $c$ coprime.

Defining a set of all possible non-congruent integer values

Best error term in $\sum_{(n,q)=1}\frac{1}{n}$ (harmonic series with coprimality condition)

Find all $n$ such that $\gcd(3n-4, n^2+1)=1$

Formula for product of sums of pairs of coprime divisors of $n$.

Cycle structure of the permutation $x \mapsto p·x\operatorname{mod}q$ for coprime $p,q$

How can I prove that a function $p(n)$ is multiplicative but not completely multiplicative?

Prove that for all $n$ $\gcd(n, x_n)=1$, given $x_{n+1}=2(x_n)^2-1$ and $x_1=2$

How many positive integers $\le 1260$ are relatively prime to $1260$?

Proving That Consecutive Fibonacci Numbers are Relatively Prime

Trending Questions

Popular # Hahtags

Popular Questions