Question

Is the zero considered a leading zero?

score 215 · Answer 1 · 2026-04-11 12:55:34

215

Views

Is the zero considered a leading zero?

Published on 11 Apr 2026 - 12:55

score 1.2k · Answer 2 · 2026-04-13 03:17:54

1.2k

Views

Use the fact that $2$ is a primitive root modulo $101$ to find all solutions to $x^7\equiv-2\pmod{101}$

Published on 13 Apr 2026 - 3:17

score 1.7k · Answer 3 · 2026-04-12 21:04:27

1.7k

Views

Prove that $a$ and $b$ are relatively prime if and only if $a^2$ and $b^2$ are relatively prime.

Published on 12 Apr 2026 - 21:04

score 62 · Answer 4 · 2026-04-12 12:42:25

62

Views

which way should i follow to solve the problem regearding Fermat's little theorem?

Published on 12 Apr 2026 - 12:42

score 749 · Answer 5 · 2026-04-07 02:47:51

749

Views

Determine if a number is a primitive root

Published on 07 Apr 2026 - 2:47

score 67 · Answer 6 · 2026-03-25 06:29:20

67

Views

If $a|b$, then why the gcd of $a$ and $b$ is $a$?

Published on 25 Mar 2026 - 6:29

score 40 · Answer 7 · 2026-04-12 21:50:24

40

Views

Definining the "$a \text{ mod } b$" operation to return b instead of 0.

Published on 12 Apr 2026 - 21:50

score 1.3k · Answer 8 · 2026-03-25 09:37:18

1.3k

Views

Proving that if $a=bq+r$ then $(a,b)=(b,r)$

Published on 25 Mar 2026 - 9:37

score 651 · Answer 9 · 2026-03-25 09:39:58

651

Views

Property of addition, multiplication of $\gcd$ for co-prime $(a,b)=1$.

Published on 25 Mar 2026 - 9:39

score 452 · Answer 10 · 2018-03-07 16:22:36

452

Views

Prove for $\gcd$ of two integers $a,b$, that $(a^n,b^n) = (a,b)^n$

Published on 07 Mar 2018 - 16:22

score 60 · Answer 11 · 2018-03-07 17:23:44

60

Views

A twenty-one handed clock

Published on 07 Mar 2018 - 17:23

score 1.2k · Answer 12 · 2026-03-26 05:56:01

1.2k

Views

Prove that $3^{2n-1} + 2^{n+1}$ is always a multiple of $7$.

Published on 26 Mar 2026 - 5:56

score 93 · Answer 13 · 2026-03-25 04:43:27

93

Views

If both sides of $2^{31}\equiv (-1)^{31}\equiv 2\mod 3$ is multiplied by $2$ then will it be $2^{32}\equiv4\mod 3$ or $2^{32}\equiv4\mod 6$?

Published on 25 Mar 2026 - 4:43

score 197 · Answer 14 · 2026-04-06 20:58:33

197

Views

Solutions of $\varphi\left(n^n\sigma(n)\right)=\varphi(n^{n+1})$, where $\sigma(n)$ is the sum of divisors and $\varphi(n)$ the Euler's totient

Published on 06 Apr 2026 - 20:58

score 40 · Answer 15 · 2018-03-08 01:15:38

40

Views

Prove 7 is not a factor of any $113_n$ where the base $n>3$

Published on 08 Mar 2018 - 1:15

List Question

Is the zero considered a leading zero?

Use the fact that $2$ is a primitive root modulo $101$ to find all solutions to $x^7\equiv-2\pmod{101}$

Prove that $a$ and $b$ are relatively prime if and only if $a^2$ and $b^2$ are relatively prime.

which way should i follow to solve the problem regearding Fermat's little theorem?

Determine if a number is a primitive root

If $a|b$, then why the gcd of $a$ and $b$ is $a$?

Definining the "$a \text{ mod } b$" operation to return b instead of 0.

Proving that if $a=bq+r$ then $(a,b)=(b,r)$

Property of addition, multiplication of $\gcd$ for co-prime $(a,b)=1$.

Prove for $\gcd$ of two integers $a,b$, that $(a^n,b^n) = (a,b)^n$

A twenty-one handed clock

Prove that $3^{2n-1} + 2^{n+1}$ is always a multiple of $7$.

If both sides of $2^{31}\equiv (-1)^{31}\equiv 2\mod 3$ is multiplied by $2$ then will it be $2^{32}\equiv4\mod 3$ or $2^{32}\equiv4\mod 6$?

Solutions of $\varphi\left(n^n\sigma(n)\right)=\varphi(n^{n+1})$, where $\sigma(n)$ is the sum of divisors and $\varphi(n)$ the Euler's totient

Prove 7 is not a factor of any $113_n$ where the base $n>3$

Trending Questions

Popular # Hahtags

Popular Questions