Skip to main content

Questions tagged [prime-factorization]

For questions about factoring elements of rings into primes, or about the specific case of factoring natural numbers into primes.

504 questions with no upvoted or accepted answers
6 votes
0 answers
181 views

Curiosity: $\text{antiprime} = \text{prime} + 1$

The following is just a mathematical curiosity that popped into my head that I thought was interesting. I haven't been able to find anything about it online, although maybe I just am unaware of the ...
stowo's user avatar
  • 555
6 votes
2 answers
123 views

Proving that there is an infinite number of pairs of prime numbers for which $F(n)F(n+1) =pq $ for no $n>1 \in \mathbb{N}$, $F(n)$ is the GPF function

Proving that there is an infinite number of pairs of prime numbers for which $F(n)F(n+1) = pq $ does not hold for any $n>1 \in \mathbb{N}$, $F(n)$ is the GPF function I have been trying to solve ...
gicilil's user avatar
  • 151
6 votes
0 answers
200 views

A conjecture regarding the sum of a number and its prime factorization

I am not sure if this a known problem, but I have a conjecture regarding the prime numbers. Since I don't know much analytic number theory, I thought maybe someone here could prove/disprove it. Let $n\...
BR Pahari's user avatar
  • 2,694
6 votes
0 answers
383 views

What is the most frequent largest prime factor of the numbers between two primes?

Let $p_n$ be the $n$-th prime and $l_n, n \ge 2$ be the largest of all the prime factors of the composite numbers between $p_n$ and $p_{n+1}$. Since there are infinitely many prime gaps, each of these ...
Nilotpal Sinha's user avatar
6 votes
0 answers
100 views

Can we conclude $n=p-1$?

Let $\ n\ $ be a positive integer and $\ p\ $ a prime number such that $$\ p^2\mid (2n)! + n! + 1$$ The only pairs $\ (n,p)\ $ I found so far are $(1,2)$ , $(2,3)$ , $(10,11)$ , $(106,107)$ , $(4930,...
Peter's user avatar
  • 85.1k
6 votes
0 answers
149 views

Density of Numbers with Exactly One Prime Factor of Multiplicity 1

Let $S$ be the set of positive integers $n$ with the property that exactly one prime factor of $n$ has multiplicity $1$ and every other prime factor has multiplicity greater than $1$ (to be clear, $S$ ...
Ashvin Swaminathan's user avatar
6 votes
0 answers
152 views

Estimation of the number of solutions for the equation $\sigma(\varphi(n))=\sigma(\operatorname{rad}(n))$

For integers $n\geq 1$ in this post we denote the square-free kernel as $$\operatorname{rad}(n)=\prod_{\substack{p\mid n\\p\text{ prime}}}p,$$ that is the product of distinct primes dividing an ...
user avatar
6 votes
0 answers
175 views

Prime number theorem for knots?

Is there an analog to the prime-number theorem describing the distribution of the prime numbers among the integers: A theorem that describes the distribution of the prime knots, perhaps with respect ...
Joseph O'Rourke's user avatar
6 votes
1 answer
236 views

Is my proof that there are infinite primes actually valid?

I was trying to think of another way of showing that there are an infinite number of primes. I came up with the following argument, but I am not sure if it is valid. I don't know how to make it more ...
Chris Michael Sullens's user avatar
6 votes
0 answers
289 views

The number of distinct least prime factors in a sequence of consecutive integers

I was thinking about the number of distinct least prime factors in a sequence of consecutive integers and I noticed: That every $4$ integers, there are $3$ distinct least prime factors. Every $6$ ...
Larry Freeman's user avatar
6 votes
0 answers
2k views

Is there a pattern for the distribution of prime factor count for numbers under n?

In the below picture I have charted the distribution of numbers below n by factor count. The bottom line is for all numbers under 100,000 then 200,000 ... all the way to 1,000,000. They seem to tend ...
Joe's user avatar
  • 534
6 votes
0 answers
62 views

Regularities in a prime-exponent graph

Let $\Omega(n)$ be the number of prime factors of $n$ with multiplicity, i.e., if $n=p_1^{e_1} p_2^{e_2} \cdots p_k^{e_k}$, $\Omega(n) = e_1 + e_2 + \cdots + e_k$ (OEIS). For example, for $n=9000 = 2^...
Joseph O'Rourke's user avatar
5 votes
0 answers
208 views

Conjecture on the prime factorisation of the $\operatorname{lcm}(1,\dots,k) \pm 1$, $k \geq 2$

For $k \in \mathbb{N},\, k \geq 2$, define $S(k) := \operatorname{lcm}(2,\dots,k)$. $S$ stands for "superprimorial", as it is a name I've seen come up once before and that I kinda like: it ...
Bruno B's user avatar
  • 5,849
5 votes
0 answers
116 views

Expected number of digits of the smallest prime factor of $77^{77}-18$

Let $X$ be the number of digits of the smallest prime factor of $$77^{77}-18$$ which is a composite $146$-digit number. ECM indicates that the smallest factor has more than $30$ digits. Assuming ...
Peter's user avatar
  • 85.1k
5 votes
1 answer
137 views

Is the conjecture about prime numbers true?

Let $p_n$ be the $n$-th prime number. Is it true that if $n$ is sufficiently large then will $$p_1×p_2×p_3×...×p_n+1$$ always be a composite number?
user569084's user avatar

15 30 50 per page
1
2
3 4 5
34