Question

How fact, that $n^p-(n-1)^p\equiv0\pmod{pk+1}$, using in prime numbers computing?

score 46 · Answer 1 · 2017-12-19 03:41:52

46

Views

How fact, that $n^p-(n-1)^p\equiv0\pmod{pk+1}$, using in prime numbers computing?

Published on 19 Dec 2017 - 3:41

score 183 · Answer 2 · 2026-03-25 17:21:29

183

Views

find unique numbers to write on the faces of two dice so the sum is always a prime.

Published on 25 Mar 2026 - 17:21

score 75 · Answer 3 · 2017-12-20 03:34:53

75

Views

Is there a term for this number theoretic object?

Published on 20 Dec 2017 - 3:34

score 282 · Answer 4 · 2017-12-20 05:33:08

282

Views

Relatively prime factors of $24500$

Published on 20 Dec 2017 - 5:33

score 136 · Answer 5 · 2017-12-20 23:38:53

136

Views

is this simple proof by contradiction of uniqueness of prime factorization correct?

Published on 20 Dec 2017 - 23:38

score 47 · Answer 6 · 2017-12-21 04:12:43

47

Views

How to find the prime factorization of a very large number.

Published on 21 Dec 2017 - 4:12

score 79 · Answer 7 · 2017-12-22 14:42:24

79

Views

A recurrence involving the radical of an integer

Published on 22 Dec 2017 - 14:42

score 120 · Answer 8 · 2026-03-25 23:38:27

120

Views

An equivalent form of the Goldbach conjecture using the radical of an integer and the Euler's totient function, and a related problem

Published on 25 Mar 2026 - 23:38

score 65 · Answer 9 · 2017-12-28 06:29:21

65

Views

Why is the fractional part of the X and Y intercepts of a line equal when the line intersects the sqrt() of a semiprime AND its prime factors?

Published on 28 Dec 2017 - 6:29

score 42 · Answer 10 · 2026-03-26 09:41:54

42

Views

A simple representation that satisfies every even perfect number: products over the squarefree parts of its divisors

Published on 26 Mar 2026 - 9:41

score 451 · Answer 11 · 2026-04-02 07:01:12

451

Views

Sum of exactly n perfect square divisors

Published on 02 Apr 2026 - 7:01

score 383 · Answer 12 · 2017-12-30 13:13:25

383

Views

SOOO close to a really clean solution to Question 6 from the 1988 Math Olympiad

Published on 30 Dec 2017 - 13:13

score 701 · Answer 13 · 2026-03-31 06:43:29

701

Views

If $a\mid b$ then $\phi(a)\mid \phi(b)$ for $a,b\in\mathbb{N}$

Published on 31 Mar 2026 - 6:43

score 1.4k · Answer 14 · 2018-01-02 18:36:55

How can numbers that have more than 2 prime factors (ie. 12) be the product of primes? Isn’t 12 the product of one prime and one composite?

score 634 · Answer 15 · 2026-03-28 13:05:04

634

Views

For a primitive pythagorean triple $(a, b, c)$, prove $(c+b), (c-b)$ are both squares.

Published on 28 Mar 2026 - 13:05

List Question

How fact, that $n^p-(n-1)^p\equiv0\pmod{pk+1}$, using in prime numbers computing?

find unique numbers to write on the faces of two dice so the sum is always a prime.

Is there a term for this number theoretic object?

Relatively prime factors of $24500$

is this simple proof by contradiction of uniqueness of prime factorization correct?

How to find the prime factorization of a very large number.

A recurrence involving the radical of an integer

An equivalent form of the Goldbach conjecture using the radical of an integer and the Euler's totient function, and a related problem

Why is the fractional part of the X and Y intercepts of a line equal when the line intersects the sqrt() of a semiprime AND its prime factors?

A simple representation that satisfies every even perfect number: products over the squarefree parts of its divisors

Sum of exactly n perfect square divisors

SOOO close to a really clean solution to Question 6 from the 1988 Math Olympiad

If $a\mid b$ then $\phi(a)\mid \phi(b)$ for $a,b\in\mathbb{N}$

How can numbers that have more than 2 prime factors (ie. 12) be the product of primes? Isn’t 12 the product of one prime and one composite?

For a primitive pythagorean triple $(a, b, c)$, prove $(c+b), (c-b)$ are both squares.

Trending Questions

Popular # Hahtags

Popular Questions