Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is it true that :

For every $n$ there exists a number $k<3n$ such that:

$k\cdot 2^n-1$ or $k\cdot 2^n+1$ is prime,where $k,n\in \mathbf{N}$

Maple code that prints least $k$ such that $k\cdot 2^n-1$ is prime and $k<3n$ :

enter image description here

for $n=624$ we have exception,there is no prime of the form $k\cdot 2^{624}-1$ such that $k<3\cdot 624$ , but number $85\cdot 2^{624}+1$ is prime number and $85<3\cdot 624$

Any idea how to prove or disprove statement above ?

share|cite|improve this question
Such numbers are called Sierpinski and Riesel numbers, respectively:, – JavaMan Nov 9 '11 at 17:16
@JavaMan,What do you think,is there any other way to disprove this statement besides finding an counterexample ? – pedja Nov 9 '11 at 17:33
I have no intuition regarding your question. – JavaMan Nov 9 '11 at 17:42

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.