ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (an)(a_n) be a divisibility sequence with factorization an=∏d∣nbda_n=\prod_{d\mid n}b_d. An integer is square-free if it is not divisible by the square of any prime.

Square-freeness conjecture. If nn is square-free, then bnb_n is square-free.

The paper presents this as a stronger version of the open question of whether the relevant Fibonacci-type terms are square-free. The supplied status is unknown, so the conjecture is recorded as open.

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.