Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units of the associated coefficient ring, we can produce sequences of solutions to these equations. It is known that these solutions can be written as tuples of linear recurrence sequences. We show that for certain families of norm forms defined over quartic fields, there exist integrally equivalent forms making any one fixed coordinate sequence a linear divisibility sequence.
Generalized Vandermonde Determinants and Characterization of Divisibility Sequences
本文给出了Van der Poorten，Bezevin和Petho在他们的论文“整除性序列的完全刻画”中给出的非退化递归序列的刻画的一个不同的证明，该序列也是可除序列.我们的证明是基于一个有趣的行列式的身份有关的脉冲序列，所产生的广义范德蒙德行列式的评价。作为这个新的证明的结果，我们可以找到一个更精确的形式，在一般情况下，非退化整除序列有极小多项式与重根的结果序列中提出的文件。
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials that divide their compositions with every positive integer power. We completely characterize such polynomials in terms of their factorizations into cyclotomic polynomials using labeled Hasse diagrams, and construct new integer divisibility sequences based on them. We also show that, unlike the Fibonacci numbers, these non-classical sequences do not have the p…
We prove that there are finitely many perfect powers in elliptic divisibility sequences generated by a non-integral point on elliptic curves of the from $y^2=x(x^2+b)$, where $b$ is any positive integer. We achieve this by using the modularity of elliptic curves over real quadratic number fields.
For a pair $(E,P)$ of an elliptic curve $E/\mathbb{Q}$ and a nontorsion point $P\in E(\mathbb{Q})$, the sequence of \emph{elliptic Fermat numbers} is defined by taking quotients of terms in the corresponding elliptic divisibility sequence $(D_{n})_{n\in\mathbb{N}}$ with index powers of two, i.e. $D_{1}$, $D_{2}/D_{1}$, $D_{4}/D_{2}$, etc. Elliptic Fermat numbers share many properties with the classical Fermat numbers, $F_{k}=2^{2^k}+1$. In the present paper, we show that for magnified elliptic Fermat sequences, only finitely many terms are prime. We also define \emph{generalized elliptic Ferma…
We study some divisibility properties related to the factors of the discriminant of the characteristic polynomial of generalized Fibonacci sequences $(G_n)_{n\ge0}$ defined by $G_0=0$, $G_1=1$ and $G_n=pG_{n-1}+qG_{n-2}$ for $n\ge2$, where $p,q$ are given integers. As corollaries, we give some divisibility properties on some well known sequences.
The purpose of this memoir is to discuss two very interesting properties of integer sequences. One is the law of apparition and the other is the law of repetition. Both have been extensively studied by mathematicians such as Ward, Lucas, Lehmer, Hall, etc. However, due to the lack of a proper survey in this area, many results have been rediscovered many decades later. This along with the necessity of the usefulness of such theory calls for a survey on this topic.
Let $U = (U_n)_{n \geq 0}$ be a Lucas sequence and, for every prime number $p$, let $ρ_U(p)$ be the rank of appearance of $p$ in $U$, that is, the smallest positive integer $k$ such that $p$ divides $U_k$, whenever it exists. Furthermore, let $d$ be an odd positive integer. Under some mild hypotheses, we prove an asymptotic formula for the number of primes $p \leq x$ such that $d$ divides $ρ_U(p)$, as $x \to +\infty$.
In this paper, we first prove that for any strong divisibility sequences $\boldsymbol{a} = \left(a_n\right)_{n\geq 1}$, we have the identity: $\mathrm{lcm} \left\lbrace \binom{n}{0}_{\bf{a}}, \binom{n}{1}_{\bf{a}},\dots, \binom{n}{n}_{\bf{a}} \right\rbrace = \frac{\mathrm{lcm} \left(a_1,\dots , a_n , a_{n+1}\right)}{a_{n+1}}$ $\left(\forall n \geq 1\right)$, generalizing the identity of Farhi (obtained in 2009 for $a_n=n$). Then, we derive from this one some other interesting identities. Finally, we apply those identities to estimate the least common multiple of the consecutive terms of some L…
A sequence of nonzero integers $f = (f_1, f_2, \dots)$ is ``binomid'' if every $f$-binomid coefficient $\left[\! \begin{array}{c} n \\ k \end{array}\! \right]_f$ is an integer. Those terms are the generalized binomial coefficients: \[ \left[\! \begin{array}{c} n \\ k \end{array}\! \right]_f \ = \ \frac{ f_nf_{n-1}\cdots f_{n-k+1} }{ f_kf_{k-1}\cdots f_1 }. \] Let $Δ(f)$ be the infinite triangle with those numbers as entries. When $I = (1, 2, 3, \dots)$ then $Δ(I)$ is Pascal's Triangle so that $I$ is binomid. Surprisingly, every row and column of Pascal's Triangle is also binomid. For any $f$, …
Let $k\geq 3$ and $n\geq 3$ be odd integers, and let $m\geq 0$ be any integer. For a prime number $\ell$, we prove that the class number of the imaginary quadratic field $\mathbb{Q}(\sqrt{\ell^{2m}-2k^n})$ is either divisible by $n$ or by a specific divisor of $n$. Applying this result, we construct an infinite family of certain tuples of imaginary quadratic fields of the form $$\left(\mathbb{Q}(\sqrt{d}), \mathbb{Q}(\sqrt{d+1}), \mathbb{Q}(\sqrt{4d+1}), \mathbb{Q}(\sqrt{2d+4}), \mathbb{Q}(\sqrt{2d+16}), \cdots, \mathbb{Q}(\sqrt{2d+4^t}) \right)$$ with $d\in \mathbb{Z}$ and $1\leq 4^t\leq 2|d|…
We prove an optimal Zsigmondy bound for elliptic divisibility sequences over function fields in case the $j$-invariant of the elliptic curve is constant. In more detail, given an elliptic curve $E$ with a point $P$ of infinite order, the sequence $D_1$, $D_2, \ldots$ of denominators of multiples $P$, $2P,\ldots$ of $P$ is a strong divisibility sequence in the sense that $\gcd(D_m, D_n) = D_{\gcd(m,n)}$. This is the genus-one analogue of the genus-zero Fibonacci, Lucas and Lehmer sequences. A number $N$ is called a Zsigmondy bound of the sequence if each term $D_{n}$ with $n>N$ presents a new p…
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider rational roots. This leads to the study of an infinite class of integer sequences which have interesting properties and satisfy linear recurrence relations.
We prove a central limit theorem for the joint distribution of $s_q(A_jn)$, $1\le j \le d$, where $s_q$ denotes the sum-of-digits function in base~$q$ and the $A_j$'s are positive integers relatively prime to $q$. We do this in fact within the framework of quasi-additive functions. As application, we show that most elements of "Catalan-like" sequences - by which we mean integer sequences defined by products/quotients of factorials - are divisible by any given positive integer.
We consider elliptic surfaces $\mathcal{E}$ over a field $k$ equipped with zero section $O$ and another section $P$ of infinite order. If $k$ has characteristic zero, we show there are only finitely many points where $O$ is tangent to a multiple of $P$. Equivalently, there is a finite list of integers such that if $n$ is not divisible by any of them, then $nP$ is not tangent to $O$. Such tangencies can be interpreted as unlikely intersections. If $k$ has characteristic zero or $p>3$ and $\mathcal{E}$ is very general, then we show there are no tangencies between $O$ and $nP$. We apply these res…
Let $F$ and $G$ be integer polynomials where $F$ has degree at least $2$. Define the sequence $(a_n)$ by $a_n=F(a_{n-1})$ for all $n\ge 1$ and $a_0=0.$ Let $\mathscr{B}_{F,\,G,\,k}$ be the set of all positive integers $n$ such that $k\mid \gcd(G(n),a_n)$ and if $p\mid \gcd(G(n),a_n)$ for some $p$, then $p\mid k.$ Let $\mathscr{A}_{F,\,G,\,k}$ be the subset of $\mathscr{B}_{F,\,G,\,k}$ such that $\mathscr{A}_{F,\,G,\,k}=\{n\ge 1 : \gcd(G(n),a_n)=k\}$. In this article, we prove that the asymptotic density of $\mathscr{A}_{F,\,G,\,k}$ and $\mathscr{B}_{F,\,G,\,k}$ exists for a class of $(F,G)$ an…
After seeing how questions on the finer distribution of prime factorization -- considered inaccessible until recently -- reduce to bounding the norm of an operator defined on a graph describing factorization, we will show how to bound that norm. In essence, the graph is a strong local expander, with all eigenvalues bounded by a constant factor times the theoretical minimum (i.e., the eigenvalue bound corresponding to Ramanujan graphs). The proof will take us on a walk from graph theory to linear algebra and the geometry of numbers, and back to graph theory, aided, along the way, by a generaliz…
