English
Related papers

Related papers: Periodic Sequences modulo $m$

200 papers

Let $k\ge 1,a\ge 1,b\ge 0$ and $ c\ge 1$ be integers. Let $f$ be a multiplicative function with $f(n)\ne 0$ for all positive integers $n$. We define the arithmetic function $g_{k,f}$ for any positive integer $n$ by…

Number Theory · Mathematics 2013-02-25 Guoyou Qian , Qianrong Tan , Shaofang Hong

Time-periodic form or expression is a ubiquitous natural and man-made phenomenon observable in all the scientific and engineering disciplines. In this article, we propose a theory of periodic sequence (TPS), which can be formulated as a…

Signal Processing · Electrical Eng. & Systems 2023-06-16 Ben You , Ke Wu

We study Gibonacci sequences mod $m$, giving special attention to the Lucas numbers. It is known which $m$ have the property that the Fibonacci sequence contains all residues mod $m$. When $m$ has this property, we say that the Fibonacci…

Number Theory · Mathematics 2014-02-05 Jeremiah T. Southwick

A Ducci sequence is a sequence of integer $n$-tuples obtained by iterating the map \[ D : (a_1, a_2, \ldots, a_n) \mapsto \big(|a_1-a_2|,|a_2-a_3|,\ldots,|a_n-a_1|\big). \] Such a sequence is eventually periodic and we denote by $P(n)$ the…

Number Theory · Mathematics 2020-07-08 Florian Breuer , Igor E. Shparlinski

Consider the celebrated Lyness recurrence $x_{n+2}=(a+x_{n+1})/x_{n}$ with $a\in\Q$. First we prove that there exist initial conditions and values of $a$ for which it generates periodic sequences of rational numbers with prime periods…

Dynamical Systems · Mathematics 2012-01-06 Armengol Gasull , Víctor Mañosa , Xavier Xarles

We prove that certain sequences of finite continued fractions associated with a 2-periodic continued fraction with period a,b>0 are moment sequences of discrete signed measures supported in the interval [-1,1], and we give necessary and…

Classical Analysis and ODEs · Mathematics 2009-02-10 Christian Berg , Antonio J. Durán

We prove explicit congruences modulo powers of arbitrary primes for three smallest parts functions: one for partitions, one for overpartitions, and one for partitions without repeated odd parts. The proofs depend on $\ell$-adic properties…

Number Theory · Mathematics 2013-06-10 Scott Ahlgren , Kathrin Bringmann , Jeremy Lovejoy

This survey article is the outgrowth of two talks given at the Journ\'ees X-UPS "P\'eriodes et transcendance" at \'Ecole polytechnique. Periods are complex numbers whose real and imaginary parts can be written as integrals of rational…

Algebraic Geometry · Mathematics 2022-10-10 Javier Fresán

The Boros-Moll polynomials $P_m(a)$ arise in the evaluation of a quartic integral. It has been conjectured by Boros and Moll that these polynomials are infinitely log-concave. In this paper, we show that $P_m(a)$ is 2-log-concave for any…

Combinatorics · Mathematics 2010-10-05 William Y. C. Chen , Ernest X. W. Xia

For a prime $p\ge 5$ let $q_0,q_1,\ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}\bmod 2$ and $t_n=1$ if…

Number Theory · Mathematics 2020-05-19 Arne Winterhof , Zibi Xiao

We study the set $\mathcal{L}_{F}$ of all $F$-vector spaces $L(P)$ where $P$ is monic and splits over $F$ and $L(Q)$ denotes the set of linear recurrence sequences over $F$ with characteristic polynomial $Q$. We show that $\mathcal{L}_{F}$…

Rings and Algebras · Mathematics 2024-01-25 Mohammed Mouçouf

It is shown that for any prime $p$ and any natural numbers $\ell, m,$ and $s$ such that $0<s<p$, the three following congruences \begin{align*}\sum_{i\ge \ell+1}(-1)^{m-i} {m \choose i}{m+s-1+i(p-1) \choose m+s-1+\ell(p-1)} &\equiv 0 \bmod…

Number Theory · Mathematics 2020-08-04 René Gy

For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $\varphi(q)$ reduced…

Number Theory · Mathematics 2019-08-21 David Wu

Let $a \geq 2$ be an integer. We prove that for every periodic sequence $(s_n)_{n \geq 1}$ in $\{-1, +1\}$ there exists an effectively computable rational number $C_\mathbf{s} > 0$ such that \begin{equation*} \log\operatorname{lcm}(a + s_1,…

Number Theory · Mathematics 2021-03-16 Carlo Sanna

Let $p$ be an odd prime with $2$-adic expansion $\sum_{i=0}^kp_i\cdot2^i$. For a sequence $\underline{a}=(a(t))_{t\ge 0}$ over $\mathbb{F}_{p}$, each $a(t)$ belongs to $\{0,1,\ldots, p-1\}$ and has a unique $2$-adic expansion…

Information Theory · Computer Science 2014-02-20 Yupeng Jiang , DongDai Lin

In this paper, we consider a generalization of Horadam sequence {w_n} which is defined by the recurrence w_n = aw_n-1 + cw_n-2; if n is even, w_n = bw_n-1 + cw_n-2; if n is odd with arbitrary initial conditions w_0, w_1 and nonzero real…

Number Theory · Mathematics 2019-03-04 Elif Tan , Ho-Hon Leung

For any positive integer $r$, the $r$-Fubini number with parameter $n$, denoted by $F_{n,r}$, is equal to the number of ways that the elements of a set with $n+r$ elements can be weak ordered such that the $r$ least elements are in distinct…

Number Theory · Mathematics 2017-01-26 Amir Abbas Asgari , Majid Jahangiri

In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…

Number Theory · Mathematics 2018-10-03 Min Sha

Let $b_{\ell, k}(n), b_{\ell, k, r}(n)$ count the number of $(\ell, k)$, $(\ell, k, r)$-regular partitions respectively. In this paper we shall derive infinite families of congruences for $b_{\ell, k}(n)$ modulo $2$ when $ (\ell, k) =…

Number Theory · Mathematics 2023-03-27 T Kathiravan , K Srinivas , Usha K Sangale

The quantity of event logs available is increasing rapidly, be they produced by industrial processes, computing systems, or life tracking, for instance. It is thus important to design effective ways to uncover the information they contain.…

Databases · Computer Science 2018-07-06 Esther Galbrun , Peggy Cellier , Nikolaj Tatti , Alexandre Termier , Bruno Crémilleux