Question

Show that if $p_1$ and $p_2$ are primes such that $p_2 = p_1 + 2$ and $p_1> 3$, then $p_1 + p_2 \equiv 0$ mod $12$

score 44 · Answer 1 · 2026-03-25 03:22:15

44

Views

Show that if $p_1$ and $p_2$ are primes such that $p_2 = p_1 + 2$ and $p_1> 3$, then $p_1 + p_2 \equiv 0$ mod $12$

Published on 25 Mar 2026 - 3:22

score 361 · Answer 2 · 2026-03-25 07:48:19

361

Views

Is $k^{2018}+2018$ prime for some positive integer $k$ ? If yes, which $k$ is the smallest?

Published on 25 Mar 2026 - 7:48

score 75 · Answer 3 · 2026-04-09 03:18:07

75

Views

Diophantine equation with "extra" conditions

Published on 09 Apr 2026 - 3:18

score 304 · Answer 4 · 2026-03-24 00:03:48

304

Views

A fly flying to $300$ points, but each time it increases its flying distance by $1.$

Published on 24 Mar 2026 - 0:03

score 1.9k · Answer 5 · 2026-03-25 06:05:03

1.9k

Views

Created a function with roots at primes and only primes, are there useful applications?

Published on 25 Mar 2026 - 6:05

score 1k · Answer 6 · 2026-03-25 07:43:14

1k

Views

Proof: There is no other prime triple then 3,5,7

Published on 25 Mar 2026 - 7:43

score 137 · Answer 7 · 2026-03-25 11:54:07

137

Views

Find all possible values of $ d_{17}$ knowing that $ (d_7)^2 + (d_{15})^2= (d_{16})^2$

Published on 25 Mar 2026 - 11:54

score 807 · Answer 8 · 2026-03-23 16:49:09

807

Views

Find the smallest integer $n$ with $\tau(n)=a$

Published on 23 Mar 2026 - 16:49

score 1.5k · Answer 9 · 2026-04-01 02:03:17

1.5k

Views

Factor of a Mersenne number

Published on 01 Apr 2026 - 2:03

score 60 · Answer 10 · 2026-03-23 20:28:40

60

Views

Solving an equation with gcd

Published on 23 Mar 2026 - 20:28

score 101 · Answer 11 · 2026-03-24 06:02:29

101

Views

How to use pigeonhole principle to prove result about odd primes

Published on 24 Mar 2026 - 6:02

score 74 · Answer 12 · 2026-03-25 01:27:03

74

Views

What does it meant :$4$ and $2(1+\sqrt{5}))$ without Great commone divisor?

Published on 25 Mar 2026 - 1:27

score 193 · Answer 13 · 2026-04-08 23:09:42

193

Views

Chinese Remainder Theorem/Simultaneous congruences

Published on 08 Apr 2026 - 23:09

score 177 · Answer 14 · 2026-04-10 17:40:52

177

Views

Proof problem: If $x-1$ is divisible by $4$ then $x^2 - 1$ is divisible by 4

Published on 10 Apr 2026 - 17:40

score 48 · Answer 15 · 2026-04-01 04:10:18

48

Views

Modular congruence, divisibility

Published on 01 Apr 2026 - 4:10

List Question

Show that if $p_1$ and $p_2$ are primes such that $p_2 = p_1 + 2$ and $p_1> 3$, then $p_1 + p_2 \equiv 0$ mod $12$

Is $k^{2018}+2018$ prime for some positive integer $k$ ? If yes, which $k$ is the smallest?

Diophantine equation with "extra" conditions

A fly flying to $300$ points, but each time it increases its flying distance by $1.$

Created a function with roots at primes and only primes, are there useful applications?

Proof: There is no other prime triple then 3,5,7

Find all possible values of $ d_{17}$ knowing that $ (d_7)^2 + (d_{15})^2= (d_{16})^2$

Find the smallest integer $n$ with $\tau(n)=a$

Factor of a Mersenne number

Solving an equation with gcd

How to use pigeonhole principle to prove result about odd primes

What does it meant :$4$ and $2(1+\sqrt{5}))$ without Great commone divisor?

Chinese Remainder Theorem/Simultaneous congruences

Proof problem: If $x-1$ is divisible by $4$ then $x^2 - 1$ is divisible by 4

Modular congruence, divisibility

Trending Questions

Popular # Hahtags

Popular Questions