3
$\begingroup$

This question was asked at MSE but recieved no attention at all. Here it is:

Are there finitely many $(n,k) \in \mathbb{N}^2$ with $2^n-1=p_1p_2\cdots p_k$ ?

$p_1=3,p_2=5 , ...,p_k$ are consecutive odd primes in ascending order.
An example is when $n=4, k=2$:
$2^4-1=3\cdot 5=p_1p_2$
Are there finitely many $n$?
I tried to use Zsigmondy's theorem without success.
Thanks in advance!

Improve this question
$\endgroup$
3

1 Answer 1

Reset to default
7
$\begingroup$

$\let\dvds\mid$Yes. By Zsigmondy's theorem, $2^{12}-1$ has some prime divisor $p_s$ not dividing $2^i-1$ for $i<12$ (in fact, $p_s=13$). Now, if $2^n-1=p_1p_2\dots p_k$ with $k\geq s$, then $p_s\dvds 2^n-1$, so $12\dvds n$ and hence $3^2\dvds 2^n-1$, which is impossible. Thus only the cases with $k<s$ are left.

Improve this answer
$\endgroup$
2
  • $\begingroup$ I see, thanks. One minor remark - one hardly needs any theorems nowadays to check that $13$ does not divide $2^i-1$ for $i<12$ :) $\endgroup$
    – მამუკა ჯიბლაძე
    Commented Oct 10, 2015 at 11:12
  • 2
    $\begingroup$ Surely. I just wanted to emphasize that we do not need to determine this prime explicitly. $\endgroup$
    – Ilya Bogdanov
    Commented Oct 10, 2015 at 11:13

Not the answer you're looking for? Browse other questions tagged .