English
Related papers

Related papers: The Fibonacci sequence modulo $p^2$ -- An investig…

200 papers

We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…

Number Theory · Mathematics 2022-11-29 Joshua M. Siktar

Let $s$ be a fixed positive integer constant, $\varepsilon$ be a fixed small positive number. Then, provided that a prime $p$ is large enough, we prove that for any set $\{{\mathcal M}\subseteq \mathbb F_p^*$ of size $|{\mathcal M}|=…

Number Theory · Mathematics 2025-09-10 Moubariz Z. Garaev , Julio C. Pardo , Igor E. Shparlinski

We calculate the group $\kappa_2$ of exotic elements in the $K(2)$-local Picard group at the prime $2$ and find it is a group of order $2^9$ isomorphic to $(\mathbb{Z}/8)^2 \times (\mathbb{Z}/2)^3$. In order to do this we must define and…

Algebraic Topology · Mathematics 2026-02-20 Agnes Beaudry , Irina Bobkova , Paul G. Goerss , Hans-Werner Henn , Viet-Cuong Pham , Vesna Stojanoska

Wall-Sun-Sun primes (shortly WSS primes) are defined as those primes $p$ such that the period of the Fibonacci recurrence is the same modulo $p$ and modulo $p^2.$ This concept has been generalized recently to certain second order…

Number Theory · Mathematics 2026-03-27 Minjia Shi , Xuan Wang , Bouazzaoui Zakariae , Jon-Lark Kim , Patrick Solé

Consider words of length $n$. The set of all periods of a word of length $n$ is a subset of $\{0,1,2,\ldots,n-1\}$. However, any subset of $\{0,1,2,\ldots,n-1\}$ is not necessarily a valid set of periods. In a seminal paper in 1981, Guibas…

Discrete Mathematics · Computer Science 2023-05-09 Eric Rivals , Michelle Sweering , Pengfei Wang

Let $p$ be any odd prime number. Let $k$ be any positive integer such that $2\leq k\leq [\frac{p+1}3]+1$. Let $S = (a_1,a_2,...,a_{2p-k})$ be any sequence in ${\Bbb Z}_p$ such that there is no subsequence of length $p$ of $S$ whose sum is…

Combinatorics · Mathematics 2007-05-23 W D Gao , A Panigrahi , R Thangadurai

Given a prime $p\geq 5$, we reduce modulo p a convolution of order p-1 of powers of two weighted Bernoulli numbers with Bernoulli numbers in terms of harmonic numbers and generalized harmonic numbers. Our proof is based on studying the…

Number Theory · Mathematics 2021-11-08 Claire I. Levaillant

We introduce and study the recursive divisor function, a recursive analog of the usual divisor function: $\kappa_x(n) = n^x + \sum_{d\lfloor n} \kappa_x(d)$, where the sum is over the proper divisors of $n$. We give a geometrical…

Number Theory · Mathematics 2023-08-08 Thomas Fink

The following magic trick is at the center of this paper. While the audience writes the first ten terms of a Fibonacci-like sequence (the sequence following the same recursion as the Fibonacci sequence), the magician calculates the sum of…

Let $\|\cdot\|$ denote the minimum distance to an integer. For $0<\gamma< 1$, $\theta>0$ and $(\alpha, \beta) \in \mathbb{R} \setminus \{0\} \times \mathbb{R}$ we study when \begin{equation*} \|\alpha p^{\gamma}+\beta \|<p^{-\theta},…

Number Theory · Mathematics 2017-12-04 Alexander Dunn

Suppose that $d \in \{ 2, 3, 4, 6 \}$ and $a \in \mathbb{Z}$ with $a\neq -1$ and $a$ is not square. Let $P_{(a,d)}$ be the number of primes $p$ not exceeding $x$ such that $p \equiv 1 \pmod{d}$ and $a^{(p-1)/d} \equiv 1 \pmod{p}$. In this…

Number Theory · Mathematics 2019-06-10 Peng Gao , Liangyi Zhao

This paper provides counterexamples to a previously conjectured upper bound on the first index $n_0$ at which a zero appears in constant term sequences of the form $A_p(n) = ct(P^n) \mod p$, where $P(t) \in \mathbb{Z}[t, t^{-1}]$. The…

Number Theory · Mathematics 2025-04-29 Justin Offutt

We obtain new bounds of multivariate exponential sums with monomials, when the variables run over rather short intervals. Furthermore, we use the same method to derive estimates on similar sums with multiplicative characters to which…

Number Theory · Mathematics 2019-02-20 Igor Shparlinski

If $N = {p^k}{m^2}$ is an odd perfect number with special prime factor $p$, then it is proved that ${p^k} < (2/3){m^2}$. Numerical results on the abundancy indices $\frac{\sigma(p^k)}{p^k}$ and $\frac{\sigma(m^2)}{m^2}$, and the ratios…

Number Theory · Mathematics 2012-06-18 Jose Arnaldo B. Dris

In this paper we prove that for any prime $p\ge 11$ holds $$ {2p-1\choose p-1}\equiv 1 -2p \sum_{k=1}^{p-1}\frac{1}{k} +4p^2\sum_{1\le i<j\le p-1}\frac{1}{ij}\pmod{p^7}. $$ This is a generalization of the famous Wolstenholme's theorem which…

Number Theory · Mathematics 2018-04-10 Romeo Mestrovic

Let $p>5$ be a fixed prime. We obtain an asymptotic formula related to small solutions of quadratic congruences of the form $x_1^2+x_2^2\equiv x_3^2\bmod{p^n}$ where $\max\{|x_1|,|x_2|,|x_3|\}\le p^{\nu n}$ with $\nu>1/2$.

Number Theory · Mathematics 2022-01-19 Stephan Baier , Anup Haldar

We compute the modular transformation formula of the characters for a certain family of (finitely or uncountably many) simple modules over the simple $\mathcal{N}=2$ vertex operator superalgebra of central charge…

Quantum Algebra · Mathematics 2018-11-01 Ryo Sato

Generalized Fibonacci-like sequences appear in finite difference approximations of the Partial Differential Equations based upon replacing partial differential equations by finite difference equations. This paper studies properties of the…

Discrete Mathematics · Computer Science 2017-05-03 Alexander V. Evako

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

New generalized cyclotomic binary sequences of period $p^2$ are proposed in this paper, where $p$ is an odd prime. The sequences are almost balanced and their linear complexity is determined. The result shows that the proposed sequences…

Discrete Mathematics · Computer Science 2018-07-10 Zibi Xiao , Xiangyong Zeng , Chunlei Li , Tor Helleseth