ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let u=(un)n∈Z\boldsymbol{u}=(u_n)_{n\in\mathbb{Z}} be a simple rational LRBS, meaning a simple rational linear recurrence binary sequence, taking values in Z[1/b]\mathbb{Z}[1/b] for some integer bb. An integer zero is an index n∈Zn\in\mathbb{Z} such that un=0u_n=0, and gcd⁡(b,m)=1\gcd(b,m)=1 means that bb and mm are coprime. The Skolem conjecture. The sequence u\boldsymbol{u} has no integer zero if and only if there exists an integer m≥2m\geq 2 with gcd⁡(b,m)=1\gcd(b,m)=1 such that

un≢0(modm)u_n\not\equiv 0\pmod m

for every n∈Zn\in\mathbb{Z}. This is also called the Exponential Local-Global Principle and gives a modular certificate for the absence of integer zeros. The supplied source does not provide evidence resolving the conjecture.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.