Skip to main content

All Questions

Filter by
Sorted by
Tagged with
21 votes
1 answer
773 views

Avoiding multiples of $p$

Let $p$ be a prime number and $P=\{1,2,...,p-1\}$ In how many ways we can sum all the elements of $P$ in such a way that we will reach a multiple of $p$ only when we sum the last summand? For ...
Konstantinos Gaitanas's user avatar
5 votes
2 answers
691 views

Representing natural numbers as sums of distinct prime powers

I am investigating whether every natural number $n > 18$ can be represented as a sum $p_1^{m_1} + \dots + p_k^{m_k}$, where $p_1, \dots, p_k$ are distinct primes, and $m_1, \dots, m_k$ are distinct ...
Marcos Cramer's user avatar
3 votes
0 answers
265 views

Prove A Skipping Prime Conjecture For Rio?

I am writing a paper to accompany a Short Communication I plan to give in Rio this August. The paper regards work on jumping primes, a project on which Jose Brox has been working with me. I was going ...
Gerhard Paseman's user avatar
2 votes
2 answers
393 views

Playing leapfrog with primes

In connection with how primes jump (How do these primes jump?), I consider the following game. Let $R$ be a finite set of positive integers. For this question, I content myself with $R$ being the $k$ ...
Gerhard Paseman's user avatar