Estimate on radical of $2^n \pm 1$

Not sure if this belongs to MO or not. Are there any lower bound on radical of $2^n \pm 1$ (Recall that radical of integer $rad(k)$ is a product of primes which divide integer $k$)?

As an example If abc-conjecture is true in the form $max(|a|,|b|,|c|) \leq rad(abc) ^2 $ then $$rad(2^n \pm 1) \geq 2^{n/2 - 1}$$ I wonder if this estimate is proven (or perhaps conjectured) by anyone? Are there any nontrivial results here?

edited Jan 16 at 20:45

asked Jan 15 at 17:32

Ostap Chervak
222●1●4●10

The inequalities in the comment seem to be intended in the other direction. – quid Jan 15 at 18:15

$2^n + 1 = (2^n + 1) \rightarrow 2^n+1 \leq rad (1\times 2\times (2^n+1))^2 \rightarrow 2rad(2^n+1) \geq \sqrt{2^n+1} $ Thank you, quid, sorry for that – Ostap Chervak Jan 15 at 18:23

Yyou could use the Cunningham project for numerical evidence to help decide what the conjecture should be. Gerhard "Ask Me About System Design" Paseman, 2013.01.15 – Gerhard Paseman Jan 15 at 18:34

There are certainly nontrivial results, e.g., from work of Stewart and Yu towards the ABC conjecture it seems one gets $\mathrm{rad}(2^n\pm 1) \geq n^{3-o(1)}$ as $n\to\infty$. – Anonymous Jan 16 at 17:33

According to 'On the largest prime factor of the Mersenne Numbers', written by Ford, Luca, and Shparlinski, Schinzel proves in 'On primitive prime factors of $a^n - b^n$' that the largest prime factor of $2^n-1$ is at least $2n-1$ for all $n \ge 13$. – Woett Jan 17 at 0:32

Browse other questions tagged nt.number-theory prime-numbers abc-conjecture or ask your own question.

question feed