ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a(n)a(n) be the sequence defined by the recurrence in the paper, and let n1≥1n_1\geq 1 satisfy a(n1)≥1a(n_1)\geq 1. Transience conjecture. There exists an NN such that a(n)−a(n−1)a(n)-a(n-1) is 11 or prime for every n>Nn>N. The conjecture asserts that the states for which the local lemma does not apply are transient. It is motivated by computations showing non-prime values of the recurrence's gcd can occur initially, but suggesting that eventually every increment is 11 or prime.

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.