The finite-or-periodic conjecture for the p-adic Jacobi–Perron algorithm
Statement
Let , and let be -adic numbers that are linearly dependent over . The finite-or-periodic conjecture. The -adic Jacobi–Perron algorithm on input is either finite or periodic. This conjecture concerns the unresolved behavior of the algorithm on -linearly dependent inputs: the source reports no observed infinite, nonperiodic example and explicitly describes the conjecture as still 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.