All Questions
Tagged with integer-partitions prime-numbers
21
questions
18
votes
6
answers
9k
views
Prime Partition
A prime partition of a number is a set of primes that sum to the number. For instance, {2 3 7} is a prime partition of $12$ because $2 + 3 + 7 = 12$. In fact, there ...
- 587
7
votes
1
answer
191
views
Finding $z=x+y$ such that $x^2 + y^2$ is prime
For which integers $z$ can one write $z=x+y$ such that $x^2+y^2$ is prime?
It feels like it should be possible for all odd $z>1$, and I have tried to adapt Euler's proof of Girard/Fermat's ...
- 71
7
votes
1
answer
575
views
A surprising property of partitions into primes
I was studying some properties of partitions into primes and came across a surprising property. But before I talk about them, I am giving a definition.
Definition. A $k$-tuple $\lambda=(\lambda_1,\...
user840532
6
votes
2
answers
241
views
$p\equiv 1\pmod 4\Rightarrow p=a^2+b^2$ and $p\equiv 1\pmod 8\Rightarrow p=a^2+2b^2$, what about for $p\equiv 1\pmod {2^n}$ in general
Primes $p$ with $p\equiv 1\pmod 4$ can be written as $p=a^2+b^2$ for some integers $a,b$. For $p\equiv 1\pmod 8$ we have $p=a^2+2b^2$. Can primes that satisfy $p\equiv 1\pmod{2^n}$ for $n>3$ be ...
- 1,950
6
votes
0
answers
181
views
Almost a prime number recurrence relation
For the number of partitions of n into prime parts $a(n)$ it holds
$$a(n)=\frac{1}{n}\sum_{k=1}^n q(k)a(n-k)\tag 1$$
where $q(n)$ the sum of all different prime factors of $n$.
Due to https://oeis....
- 13.9k
5
votes
1
answer
416
views
Existence of a prime partition
I'm interested in finding out whether there exists a prime partition of a given positive integer $N>1$ such that the partition has specific number of parts.
For instance, as given in another ...
- 51
4
votes
0
answers
218
views
Relationship between Riemann Zeta function and Prime zeta function
In his paper, Daniel Grunberg shows a relationship between the Stirling Numbers of the first kind and the Harmonic numbers via series of partitions (see Equation 3.1 on Page 5 in the link above). If ...
- 3,557
2
votes
1
answer
120
views
Does the partition function $p(n)$ generate infinite number of primes
Wikipedia says
As of June 2022, the largest known prime number among the values of $p(n)$ is $p(1289844341)$, with $40,000$ decimal digits
citing [1].
Is it known whether the partition function ...
- 3,341
2
votes
1
answer
74
views
Sum of Prime Factorizations and Primes
If I partition an integer and get the prime factorization of each partition, is there a way to tell if my original integer was a prime? For example, given the factorization of my partitions
$$71 = (56)...
- 157
2
votes
1
answer
92
views
MacMahon partition function and prime detection (ref arXiv:2405.06451)
In the recent paper arXiv:2405.06451 the authors provide infinitely many characterizations of the primes using MacMahon partition functions: for $a>0$ the functions $M_a(n):=\sum\limits_{0<s_1&...
- 747
2
votes
0
answers
45
views
Express number of partitions into prime numbers using partitions into natural numbers.
Let $P(n)$ is number of partitions of $n$ into natural numbers.
$R(n)$ is number of partitions of $n$ into prime numbers.
Is there any expression that relates $P(n)$ , and $R(n)$? I look for ...
- 1,382
2
votes
0
answers
937
views
Is every integer $\geq5$ the sum of two primes and a power of a prime?
Is every integer $\geq5$ the sum of two primes and a power of a prime (where $1$ is included in the prime powers)?
I don't really expect someone to prove this here, but I wonder if the question has ...
- 810
1
vote
1
answer
49
views
Generating function of partitions of $n$ in $k$ prime parts.
I have been looking for the function that generates the partitions of $n$ into $k$ parts of prime numbers (let's call it $Pi_k(n)$). For example: $Pi_3(9)=2$, since $9=5+2+2$ and $9=3+3+3$.
I know ...
1
vote
1
answer
241
views
Elementary proof of: Any integer is a sum of distinct numbers in {1,2,3,5,7,11,13,17,...}
Let $\mathbb P^1=\{1\}\cup\mathbb P$, the set of positive non composites. I have reason to believe that it is proved that all numbers greater than $6$ is a sum of distinct primes, and hence all $n\in\...
- 13.9k
1
vote
1
answer
57
views
show that there is some element x∈X whose stabilizer Gx is all of G where G is a group of order p^k, where p is prime and k is a positive integer
I'm having trouble with this problem:
Suppose that G is a group of order p^k, where p is prime and k is a positive integer.
- 73