Question

Conjecture on $\pi(n)$ and other arithmetic functions

score 166 · Answer 1 · 2026-03-27 09:37:38

166

Views

Conjecture on $\pi(n)$ and other arithmetic functions

Published on 27 Mar 2026 - 9:37

score 114 · Answer 2 · 2026-03-27 12:16:55

114

Views

Conjecture on the sum of prime factors

Published on 27 Mar 2026 - 12:16

score 640 · Answer 3 · 2020-06-15 18:53:06

640

Views

For every natural number $n$, $f(n) =$ the smallest prime factor of $n.$ For example, $f(12) = 2, f(105) = 3$

Published on 15 Jun 2020 - 18:53

score 155 · Answer 4 · 2020-06-16 11:00:19

155

Views

Computing (quickly) the multiplicity of a (prime) divisor

Published on 16 Jun 2020 - 11:00

score 51 · Answer 5 · 2020-06-16 16:47:53

51

Views

I want to figure out my mistake in a prime factorization problem.

Published on 16 Jun 2020 - 16:47

score 126 · Answer 6 · 2020-06-21 07:01:05

126

Views

Proving that $k|(n^k-n)$ for prime $k$

Published on 21 Jun 2020 - 7:01

score 313 · Answer 7 · 2020-06-23 13:11:21

313

Views

Can all composite numbers be factored into a finite set of prime numbers?

Published on 23 Jun 2020 - 13:11

score 99 · Answer 8 · 2020-06-28 12:16:53

99

Views

Can we conclude $n=p-1$?

Published on 28 Jun 2020 - 12:16

score 45 · Answer 9 · 2020-06-29 15:14:01

45

Views

number of divisors of an ideal $I$ of $\mathbb{Z}[\sqrt[3]{2}]$

Published on 29 Jun 2020 - 15:14

score 44 · Answer 10 · 2020-06-30 03:25:24

44

Views

Question about prime numbers $p$ and $q$ and the sum $= p+q$

Published on 30 Jun 2020 - 3:25

score 396 · Answer 11 · 2020-06-30 11:16:37

396

Views

Find the number of positive integers that are divisors of at least one of $10^{10}, 12^{12}$ or $15^{15}$.

Published on 30 Jun 2020 - 11:16

score 289 · Answer 12 · 2020-07-02 03:39:35

289

Views

Infinitely many common prime divisors

Published on 02 Jul 2020 - 3:39

score 68 · Answer 13 · 2020-07-03 14:53:14

68

Views

Why is multiplication and division easy, yet addition and subtraction horrible when it comes to Prime Factorisations?

Published on 03 Jul 2020 - 14:53

score 41 · Answer 14 · 2020-07-04 13:25:59

41

Views

How many numbers between 1 and 1,000 (both inclusive) are divisible by at least one of the prime between 1 to 50? How can I find this?

Published on 04 Jul 2020 - 13:25

score 246 · Answer 15 · 2020-07-07 14:23:08

246

Views

Consider the following Diophantine equation: $x^2 + xy + y^2 = n$

Published on 07 Jul 2020 - 14:23

List Question

Conjecture on $\pi(n)$ and other arithmetic functions

Conjecture on the sum of prime factors

For every natural number $n$, $f(n) =$ the smallest prime factor of $n.$ For example, $f(12) = 2, f(105) = 3$

Computing (quickly) the multiplicity of a (prime) divisor

I want to figure out my mistake in a prime factorization problem.

Proving that $k|(n^k-n)$ for prime $k$

Can all composite numbers be factored into a finite set of prime numbers?

Can we conclude $n=p-1$?

number of divisors of an ideal $I$ of $\mathbb{Z}[\sqrt[3]{2}]$

Question about prime numbers $p$ and $q$ and the sum $= p+q$

Find the number of positive integers that are divisors of at least one of $10^{10}, 12^{12}$ or $15^{15}$.

Infinitely many common prime divisors

Why is multiplication and division easy, yet addition and subtraction horrible when it comes to Prime Factorisations?

How many numbers between 1 and 1,000 (both inclusive) are divisible by at least one of the prime between 1 to 50? How can I find this?

Consider the following Diophantine equation: $x^2 + xy + y^2 = n$

Trending Questions

Popular # Hahtags

Popular Questions