Question

Distribution of composite numbers with $n$ prime factors

score 88 · Answer 1 · 2020-04-30 17:37:28

88

Views

Distribution of composite numbers with $n$ prime factors

Published on 30 Apr 2020 - 17:37

score 54 · Answer 2 · 2020-05-03 06:24:29

54

Views

How to find polynomial $f\in \mathbb{Z}[x]$ with small coefficients, such that $f(m) = 0 \pmod{n})$?

Published on 03 May 2020 - 6:24

score 59 · Answer 3 · 2026-03-27 14:02:26

59

Views

Is the following an existing conjecture or a conjecture at all?

Published on 27 Mar 2026 - 14:02

score 96 · Answer 4 · 2020-05-10 15:22:31

96

Views

An Olympiad math problem about prime numbers

Published on 10 May 2020 - 15:22

score 71 · Answer 5 · 2020-05-10 21:03:41

71

Views

Why is $x^{\frac{n-1}{2}}\not \equiv 1 \mod n$

Published on 10 May 2020 - 21:03

score 31 · Answer 6 · 2020-05-11 08:25:00

31

Views

Does it follow that there are at most $n+\pi(n-1)$ distinct primes that divide $\dfrac{(x+n)!}{x!}$

Published on 11 May 2020 - 8:25

score 83 · Answer 7 · 2026-03-25 07:44:50

83

Views

Is this a novel factorization theorem? Solving $\sin^2(\pi x)+\sin^2\left(\frac{\pi p}{x}\right)=0$ for $x$ gives the integer factors of $p$.

Published on 25 Mar 2026 - 7:44

score 49 · Answer 8 · 2020-05-11 10:29:52

49

Views

RSA Number Factorization - question regarding polynomial validity

Published on 11 May 2020 - 10:29

score 44 · Answer 9 · 2020-05-11 18:30:14

44

Views

Does there always exist a prime $q\equiv3\mod 4$ that divides $p+a^2$ with $p\equiv1$ mod 4

Published on 11 May 2020 - 18:30

score 176 · Answer 10 · 2026-03-26 18:57:47

176

Views

Fermat factorization and primality proving

Published on 26 Mar 2026 - 18:57

score 55 · Answer 11 · 2020-05-12 22:10:19

55

Views

What do Mersenne Primes have to do with record sum of factors?

Published on 12 May 2020 - 22:10

score 253 · Answer 12 · 2020-05-13 14:21:54

253

Views

Marcus,problem 12, chapter 3

Published on 13 May 2020 - 14:21

score 28 · Answer 13 · 2020-05-13 14:46:44

28

Views

Does any number, p, have a number of prime factors greater than ln(p)?

Published on 13 May 2020 - 14:46

score 135 · Answer 14 · 2020-05-13 16:56:38

135

Views

Principal generators of prime ideals is $\mathbb{Q}[\sqrt{m}]$ for m=-1, -2, -3

Published on 13 May 2020 - 16:56

score 140 · Answer 15 · 2020-05-14 15:37:38

140

Views

Application of the decomposition of prime ideals as $Q_q^{e_1}Q_2^{e_2}\dots Q_R^{e_r}$

Published on 14 May 2020 - 15:37

List Question

Distribution of composite numbers with $n$ prime factors

How to find polynomial $f\in \mathbb{Z}[x]$ with small coefficients, such that $f(m) = 0 \pmod{n})$?

Is the following an existing conjecture or a conjecture at all?

An Olympiad math problem about prime numbers

Why is $x^{\frac{n-1}{2}}\not \equiv 1 \mod n$

Does it follow that there are at most $n+\pi(n-1)$ distinct primes that divide $\dfrac{(x+n)!}{x!}$

Is this a novel factorization theorem? Solving $\sin^2(\pi x)+\sin^2\left(\frac{\pi p}{x}\right)=0$ for $x$ gives the integer factors of $p$.

RSA Number Factorization - question regarding polynomial validity

Does there always exist a prime $q\equiv3\mod 4$ that divides $p+a^2$ with $p\equiv1$ mod 4

Fermat factorization and primality proving

What do Mersenne Primes have to do with record sum of factors?

Marcus,problem 12, chapter 3

Does any number, p, have a number of prime factors greater than ln(p)?

Principal generators of prime ideals is $\mathbb{Q}[\sqrt{m}]$ for m=-1, -2, -3

Application of the decomposition of prime ideals as $Q_q^{e_1}Q_2^{e_2}\dots Q_R^{e_r}$

Trending Questions

Popular # Hahtags

Popular Questions