Square-freeness conjecture for the factors of a divisibility sequence
Statement
Let be a divisibility sequence with factorization . An integer is square-free if it is not divisible by the square of any prime.
Square-freeness conjecture. If is square-free, then 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.