English
Related papers

Related papers: On some arithmetic conditions of recurrent sequenc…

200 papers

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

Number Theory · Mathematics 2007-12-17 Trueman MacHenry , Kieh Wong

Let $K$ be a number field defined by a monic irreducible polynomial $F(X) \in \mathbb{Z}[X]$, $p$ a fixed rational prime, and $\nu_p$ the discrete valuation associated to $p$. Assume that $\overline{F}(X)$ factors modulo $p$ into the…

Number Theory · Mathematics 2018-02-20 Abdulaziz Deajim , Lhoussain El Fadil

Kemnitz Conjecture [9] states that if we take a sequence of elements in $Z_{p}^{2}$ of length $4p-3$, $p$ is a prime number, then it has a subsequence of length $p$, whose sum is $0$ modulo $p$. It is known that in $Z_{p}^{3}$ to get a…

Number Theory · Mathematics 2014-09-10 Satwik Mukherjee

Let $ \{F_n\}_{n\ge 0} $ be the sequence of Fibonacci numbers and let $p$ be a prime. For an integer $c$ we write $m_{F,p}(c)$ for the number of distinct representations of $c$ as $F_k-p^\ell$ with $k\ge 2$ and $\ell\ge 0$. We prove that…

Number Theory · Mathematics 2022-07-27 Herbert Batte , Mahadi Ddamulira , Juma Kasozi , Florian Luca

Let $P(m)$ denote the largest prime factor of an integer $m\geq 2$, and put $P(0)=P(1)=1$. For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n\geq 2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,...,0,1$ ($k$ terms) and…

Number Theory · Mathematics 2012-10-16 Jhon J. Bravo , Florian Luca

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

Number Theory · Mathematics 2019-04-01 Lucile Devin

This paper investigates randomness properties of sequences derived from Fibonacci and Gopala-Hemachandra sequences modulo m for use in key distribution applications. We show that for sequences modulo a prime a binary random sequence B(n) is…

Cryptography and Security · Computer Science 2015-03-13 Krishnamurthy Kirthi , Subhash Kak

Many famous integer sequences including the Catalan numbers and the Motzkin numbers can be expressed in the form $ConstantTermOf\left[P(x)^nQ(x)\right]$ for Laurent polynomials $Q$, and symmetric Laurent trinomials $P$. In this paper we…

Combinatorics · Mathematics 2024-03-04 Nadav Kohen

Double Fibonacci sequences are introduced and they are related to operations with Fibonacci modules. Generalizations and examples are also discussed.

Commutative Algebra · Mathematics 2008-10-23 Abdul Rauf Nizami

We investigate perturbed monomial dynamical system over $\mathbb{F}_p$ given by iterations of $x\mapsto x^n+c\bmod{p}$, where $c\in \mathbb{F}_p$. Instead of study the systems one at a time we study all of them at the same time. The complex…

Dynamical Systems · Mathematics 2013-04-17 Marcus Nilsson

Irreducible crystalline representations of dimension 2 of Gal(Qpbar/Qp) depend up to twist on two parameters, the weight k and the trace of frobenius a_p. We show that the reduction modulo p of such a representation is a locally constant…

Number Theory · Mathematics 2014-02-26 Laurent Berger

Let $p$ be a prime. In this paper, we present a detailed $p$-adic analysis to factorials and double factorials and their congruences. We give good bounds for the $p$-adic sizes of the coefficients of the divided universal Bernoulli number…

Number Theory · Mathematics 2013-08-23 Shaofang Hong , Jianrong Zhao , Wei Zhao

Let r : G_Q -> GL_n Q_l be a motivic l-adic Galois representation. For fixed m > 1 we initiate an investigation of the density of the set of primes p such that the trace of the image of an arithmetic Frobenius at p under r is an m^th power…

Number Theory · Mathematics 2007-05-23 Tom Weston

We study how well Fekete polynomials $$ F_p(X) = \sum_{n=0}^{p-1} \left(\frac{n}{p}\right) X^n \in {\mathbb Z}[X] $$ with the coefficients given by Legendre symbols modulo a prime $p$, can be approximated by power series representing…

Number Theory · Mathematics 2016-11-22 Jason Bell , Igor E. Shparlinski

In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

Let $f(x) \in \mathbb{F}_p[x]$, and define the orbit of $x\in \mathbb{F}_p$ under the iteration of $f$ to be the set \[ \mathcal{O}(x):=\{x,f(x),(f\circ f)(x),(f\circ f\circ f)(x),\dots\}. \] An orbit is a $k$-cycle if it is periodic of…

Number Theory · Mathematics 2024-10-02 Jonathan Root

For primes $p$, we investigate an $\mathbb{F}_p$-version of simplicial volume and compare these invariants with their siblings over other coefficient rings. We will also consider the associated gradient invariants, obtained by stabilisation…

Geometric Topology · Mathematics 2019-06-26 Clara Loeh

A classical problem in analytic number theory is to study the distribution of fractional part $\alpha p+\beta$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes…

Number Theory · Mathematics 2024-04-05 T. Todorova

Let K be a number field, and let a be a non-zero element of K. Fix some prime number l. We compute the density of the following set: the primes p of K such that the multiplicative order of the reduction of a modulo p is coprime to l (or,…

Number Theory · Mathematics 2014-05-20 Antonella Perucca

Let p be a prime, and let n>0 and r be integers. In 1913 Fleck showed that $$F_p(n,r)=(-p)^{-[(n-1)/(p-1)]}\sum_{k=r(mod p)}\binom{n}{k}(-1)^k\in\Z.$$ Nowadays this result plays important roles in many aspects. Recently Sun and Wan…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun