Question

Conjecture: if $a$, $b$ and $c$ have no common factors, dividing each of them by their sum yields at least one irreducible fraction

score 195 · Answer 1 · 2026-04-17 14:28:22

195

Views

Conjecture: if $a$, $b$ and $c$ have no common factors, dividing each of them by their sum yields at least one irreducible fraction

Published on 17 Apr 2026 - 14:28

score 195 · Answer 2 · 2026-04-21 12:02:57

195

Views

Number Theory: Prove that $\gcd(a,b) \le \sqrt{a+b}$

Published on 21 Apr 2026 - 12:02

score 250 · Answer 3 · 2026-04-28 15:24:10

250

Views

Unable to solve this exponential equation - Diffie-Hellman key exchange

Published on 28 Apr 2026 - 15:24

score 468 · Answer 4 · 2026-05-11 01:34:27

468

Views

Miller’s test for the base $b$

Published on 11 May 2026 - 1:34

score 71 · Answer 5 · 2026-04-15 21:26:37

71

Views

Let $r$ be primitive root mod $p$. When $x$ goes from $1$ to $p-1$, then $r^x$ (mod $p$) goes through all the numbers $1,\dots,p-1$ in some order

Published on 15 Apr 2026 - 21:26

score 100 · Answer 6 · 2026-04-11 23:07:09

100

Views

Integer equations

Published on 11 Apr 2026 - 23:07

score 323 · Answer 7 · 2026-04-16 20:57:53

323

Views

Find $5$ numbers where the sum of all pairs gives the results $110, 112, 113, 114, 115, 116, 117, 118, 120, 121$

Published on 16 Apr 2026 - 20:57

score 50 · Answer 8 · 2026-04-12 09:30:08

50

Views

How can I find the exponent $n$ efficiently?

Published on 12 Apr 2026 - 9:30

score 497 · Answer 9 · 2026-05-10 14:55:48

497

Views

Square roots proved irrational by denominator descent

Published on 10 May 2026 - 14:55

score 129 · Answer 10 · 2026-04-15 19:37:26

129

Views

On the number of multiplicative sub-monoids of integers mod $n$

Published on 15 Apr 2026 - 19:37

score 449 · Answer 11 · 2026-04-17 10:27:43

449

Views

Find all positive integers $a$ and $b$ such that $(1 + a)(8 + b)(a + b) = 27ab$.

Published on 17 Apr 2026 - 10:27

score 196 · Answer 12 · 2026-04-12 01:48:00

196

Views

Example of an assertion which is not true for any positive integer, yet for which the induction step holds.

Published on 12 Apr 2026 - 1:48

score 54 · Answer 13 · 2026-04-17 04:52:30

54

Views

The totient of a factor of a number divides the totient of the number.

Published on 17 Apr 2026 - 4:52

score 51 · Answer 14 · 2026-04-14 22:27:24

51

Views

Why is $5$ the remainder of $5 \over 13$?

Published on 14 Apr 2026 - 22:27

score 99 · Answer 15 · 2026-04-16 02:39:00

99

Views

Prove that $a + 2b \equiv 0 \pmod{3}$ if and only if $a \equiv b\pmod{3}$.

Published on 16 Apr 2026 - 2:39

List Question

Conjecture: if $a$, $b$ and $c$ have no common factors, dividing each of them by their sum yields at least one irreducible fraction

Number Theory: Prove that $\gcd(a,b) \le \sqrt{a+b}$

Unable to solve this exponential equation - Diffie-Hellman key exchange

Miller’s test for the base $b$

Let $r$ be primitive root mod $p$. When $x$ goes from $1$ to $p-1$, then $r^x$ (mod $p$) goes through all the numbers $1,\dots,p-1$ in some order

Integer equations

Find $5$ numbers where the sum of all pairs gives the results $110, 112, 113, 114, 115, 116, 117, 118, 120, 121$

How can I find the exponent $n$ efficiently?

Square roots proved irrational by denominator descent

On the number of multiplicative sub-monoids of integers mod $n$

Find all positive integers $a$ and $b$ such that $(1 + a)(8 + b)(a + b) = 27ab$.

Example of an assertion which is not true for any positive integer, yet for which the induction step holds.

The totient of a factor of a number divides the totient of the number.

Why is $5$ the remainder of $5 \over 13$?

Prove that $a + 2b \equiv 0 \pmod{3}$ if and only if $a \equiv b\pmod{3}$.

Trending Questions

Popular # Hahtags

Popular Questions