Ailon–Rudnick conjecture on coprime values of exponential recurrences

From papers

Let a,ba,b be two multiplicatively independent non-zero integers satisfying

gcd(a1,b1)=1.\gcd(a-1,b-1)=1.

Define the linear recurrences F(n)=an1F(n)=a^n-1 and G(n)=bn1G(n)=b^n-1, and let

AF,G:={nN:gcd(F(n),G(n))=1}.\mathcal{A}_{F,G}:=\{n\in\mathbb{N}:\gcd(F(n),G(n))=1\}.

Ailon–Rudnick conjecture. The set AF,G\mathcal{A}_{F,G} is infinite.

This conjecture concerns the existence of infinitely many indices at which the values of two multiplicatively independent exponential recurrences are coprime. It is presented as an open problem; more general questions about the infinitude of sets defined by prescribed gcds of arbitrary integral linear recurrences are currently beyond the cited methods.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Daniele Mastrostefano and Carlo Sanna, “On numbers n with polynomial image coprime with the nth term of a linear recurrence”, arXiv:1805.05114 (2018).

Solutions 0

No solutions have been posted yet.