A Family of Cubic Diophantine Equations and 4-Chains

Abstract

In a simple integer chain, if ui-1, ui, and ui+1 are three consecutive terms of the chain, and the pair (ui-1, ui) has a certain property, then the next pair (ui, ui+1) also has the same property. We extend the idea of a simple chain to an n-chain in which n is a positive integer and if a pair (ui-1, ui) has a certain property, then the nth next pair (u n+i-1, u n+i) also has the same property. In this case, we call (ui-1, ui, ui+1) and (u n+i-1, u n+i, u n+i+1) matching triples. We use 4-chains to study a family of cubic Diophantine equations including x3 + y3 + x +y +1 = xyz and three others. We show that a pair of integers (x, y) satisfies one of those four equations if and only if x and y are consecutive terms of a 4-chain. Our main result is that if triple (u, t, vw) is an ordered list of three consecutive terms of one 4-chain, where |t| is a prime, t does not divide (u-v), and triple (v, t, uw) is that of a second 4-chain and it matches the first triple, then triple (-w, t, -uv) is that of a third 4-chain and it matches the other two triples.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…