Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

After reading this question, I conjectured a generalization of it.

Conjecture: Fix $k\in \mathbb N$. Then, for all $n\in \mathbb N$, one of $n+1,\ldots,n+k$ is coprime to the rest.

I tried some elementary ways, but wasn't successful.

Observation: One of the consequences of this conjecture is that there are infinitely many primes!

share|cite|improve this question
I assume you meant k>1. Answer below is surprising to me. – user254665 Mar 30 at 18:29
@user254665 If k=1, $n+1$ is coprime to all members of $\varnothing$ ! – user217174 Mar 30 at 18:36
You got me on that one.:). – user254665 Mar 31 at 1:53
up vote 31 down vote accepted

Surprisingly, the statement is false once $k\ge17$, and the shortest counterexample is the sequence of length $17$ beginning with $2184$. This was the result of a line of work beginning with Pillai, and finally wrapped up by Brauer. See S.S. Pillai on Consecutive integers research paper?.

  • Pillai showed that it holds for $k<17$, but can fail for all $k$ between $17$ and $430$ - infinitely often, in fact!

  • In a sequence of results, this was improved until eventually Scott showed that there are infinitely many counterexamples for $17\le k\le 2491906561$ . . .

  • . . . and then Brauer showed that there are infinitely many counterexamples for any $k\ge 17$.

share|cite|improve this answer
Thanks, it's amazing! Because I thought this conjecture is trivially true! – user217174 Mar 30 at 16:08
2 – user217174 Mar 30 at 16:14
I posted this observation at Examples of eventual counterexamples in MO. – user217174 Mar 30 at 17:00
I would have expected a short elementary decision. Number theory is full of deceptively simple-sounding hard Q's. – user254665 Mar 30 at 18:33

Your Answer


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