ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a,c→Na,c\to\mathbb{N} and b,d∈Zb,d\in\mathbb{Z} satisfy (a,b,c,d)=1(a,b,c,d)=1, and define

S={an+bcn+d:n∈N}.S=\left\{\frac{an+b}{cn+d}:n\in\mathbb{N}\right\}.

Multiplicative recurrence conjecture. The set SS is a set of measurable multiplicative recurrence if and only if a=ca=c, and b=db=d or a∣bda\mid bd.

The necessity of these conditions follows from the paper's results; the conjecture asserts their sufficiency and would give a negative answer to Moreira et al.'s Question 7.2. The case b=db=d is trivial since then S={1}S=\{1\}; the interesting case is b≠db\ne d and a∣bda\mid bd.

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.