All Questions
5
questions
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
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
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
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
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