Norm form equations and linear divisibility sequences
نویسندگان
چکیده
Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units of associated coefficient ring, we can produce sequences these equations. It known that be written as tuples linear recurrence sequences. We show for certain families forms defined over quartic fields, there exist integrally equivalent making any one fixed coordinate sequence divisibility sequence.
منابع مشابه
Difference Equations and Divisibility Properties of Sequences
There are many different ways of defining a sequence in terms of solutions to difference equations. In fact, if a sequence satisfies one recurrence then it satisfies an infinite number of recurrences. Arithmetic properties of an integral sequence are often studied by direct methods based on the combinatorial or algebraic definition of the numbers or using their generating function. The rational...
متن کاملNorm Form Equations and Continued Fractions
We consider the Diophantine equation of the form x2−Dy2 = c, where c ∣∣ 2D, gcd(x, y) = 1, and provide criteria for solutions in terms of congruence conditions on the fundamental solution of the Pell Equation x2 − Dy2 = 1. The proofs are elementary, using only basic properties of simple continued fractions. The results generalize various criteria for such solutions, and expose the central norm,...
متن کاملParameterized norm form equations with arithmetic progressions
Buchmann and Pethő [5] observed that following algebraic integer 10 + 9α + 8α + 7α + 6α + 5α + 4α, with α = 3 is a unit. Since the coefficients form an arithmetic progressions they have found a solution to the Diophantine equation (1) NK/Q(x0 + αx1 + · · ·+ x6α) = ±1, such that (x0, . . . , x6) ∈ Z is an arithmetic progression. Recently Bérczes and Pethő [3] considered the Diophantine equation ...
متن کاملStrong divisibility and lcm-sequences
Let R be an integral domain in which every two nonzero elements have a greatest common divisor. Let (an)n>1 be a sequence of nonzero elements in R. We prove that gcd(an, am) = agcd(n,m) for all n,m > 1 if and only if an = ∏
متن کاملPrimes in Divisibility Sequences
We give an overview of two important families of divisibility sequences: the Lehmer–Pierce family (which generalise the Mersenne sequence) and the elliptic divisibility sequences. Recent computational work is described, as well as some of the mathematics behind these sequences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Number Theory
سال: 2021
ISSN: ['1793-7310', '1793-0421']
DOI: https://doi.org/10.1142/s1793042122500634