English
Related papers

Related papers: Small Prime Powers in the Fibonacci Sequence

200 papers

In this paper we show that for any prime number $p$ not equal to $11$ or $19$, the Tribonacci number $T_{p-1}$ is divisible by $p$ if and only if $p$ is of the form $x^2+11y^2$. We first use class field theory on the Galois closure of the…

Number Theory · Mathematics 2019-06-14 Tim Evink , Paul Alexander Helminck

We establish mean convergence for multiple ergodic averages with iterates given by distinct fractional powers of primes and related multiple recurrence results. A consequence of our main result is that every set of integers with positive…

Dynamical Systems · Mathematics 2022-05-19 Nikos Frantzikinakis

The prime numbers look like a randomly chosen sequence of natural numbers, but there is still no strict theory to determine 'Randomness'. In these years, cryptography has developed a battery of statistical tests for randomness. In this…

Number Theory · Mathematics 2011-02-19 Wang Liang , Huang Yan

We present a variation of the broken stick problem in which $n$ stick lengths are sampled uniformly at random. We prove that the probability that no three sticks can form a triangle is the reciprocal of the product of the first $n$…

Probability · Mathematics 2026-01-27 Aidan Sudbury , Arthur Sun , David Treeby , Edward Wang

Morphic sequences form a natural class of infinite sequences, typically defined as the coding of a fixed point of a morphism. Different morphisms and codings may yield the same morphic sequence. This paper investigates how to prove that two…

Symbolic Computation · Computer Science 2024-07-29 Hans Zantema

We study $B(n;k)$, the number of ways of writing $n$ as a sum or difference of the first $k$ Fibonacci numbers. We show that $B(0;k)$ satisfies the Tribonacci-like recurrence $B(0;k+1)=B(0;k)+B(0;k-1)+B(0;k-2)$ and that $B(n;k)$ satisfies a…

Number Theory · Mathematics 2026-04-20 Katie Anders , Madeline L. Dawsey , Joseph Vandehey

We establish several recurrence relations and an explicit formula for V(n), the number of factorizations of the length-n prefix of the Fibonacci word into a (not necessarily strictly) decreasing sequence of standard Fibonacci words. In…

Combinatorics · Mathematics 2019-01-08 Pierre Bonardo , Anna E. Frid , Jeffrey Shallit

Fibonacci chains are special diatomic, harmonic chains with uniform nearest neighbour interaction and two kinds of atoms (mass-ratio $r$) arranged according to the self-similar binary Fibonacci sequence $ABAABABA...$, which is obtained by…

Condensed Matter · Physics 2007-05-23 Wolfdieter Lang

Let $p$ be a prime. In this paper, we give a complete classification of self-reciprocal polynomials arising from Fibonacci polynomials over $\mathbb{Z}$ and $\mathbb{Z}_p$, where $p=2$ and $p>5$. We also present some partial results when…

Number Theory · Mathematics 2019-01-01 Neranga Fernando , Mohammad Rashid

This paper presents an innovative approach to the study of recurrent sequences by introducing the concept of arithmetic pseudo-operators. Unlike conventional operators, these pseudo-operators are pure complex numbers with specific…

General Mathematics · Mathematics 2025-04-14 Victor Enrique Vizcarra Ruiz

Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…

Combinatorics · Mathematics 2026-04-28 Zixian Yang , Jianchao Bai

Fibonacci numbers and the golden ratio can be found in nearly all domains of Science, appearing when self-organization processes are at play and/or expressing minimum energy configurations. Several non-exhaustive examples are given in…

Popular Physics · Physics 2018-01-08 Vladimir Pletser

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

We show that universal elliptic Carmichael numbers do not exist, answering a question of Silverman. Moreover, we show that the probability that an integer $n$, which is not a prime power, is an elliptic Carmichael number for a random curve…

Number Theory · Mathematics 2019-12-03 Jan-Christoph Schlage-Puchta

In this paper, we investigate exceptional sets in the Waring-Goldbach problem for unlike powers. For example, estimates are obtained for sufficiently large integers below a parameter subject to the necessary local conditions that do not…

Number Theory · Mathematics 2019-07-30 Zhenzhen Feng , Jing Ma

We give a simple recursive formula to obtain the general sum of the first $N$ natural numbers to the $r$th power. Our method allows one to obtain the general formula for the $(r+1)$th power once one knows the general formula for the $r$th…

General Mathematics · Mathematics 2022-03-29 Alessandro Mariani

There exists a particular subset of algebraic power series over a finite field which, for different reasons, can be compared to the subset of quadratic real numbers. The continued fraction expansion for these elements, called…

Number Theory · Mathematics 2015-05-13 Alain Lasjaunias

In this paper, we suggest a lower and an upper bound for the Generalized Fibonacci-p-Sequence, for different values of p. The Fibonacci-p-Sequence is a generalization of the Classical Fibonacci Sequence. We first show that the ratio of two…

Cryptography and Security · Computer Science 2016-11-25 Sandipan Dey , Hameed Al-Qaheri , Suneeta Sane , Sugata Sanyal

We define a family of meta-Fibonacci sequences where the order of the of recursion at stage n is a variable r(n), and the n^{th} term of a sequence is the sum of the previous r(n) terms. For the terms of any such sequence, we give upper and…

Combinatorics · Mathematics 2007-05-23 Nathaniel D. Emerson

A Barker sequence is a binary sequence for which all nontrivial aperiodic autocorrelations are either 0, 1 or -1. The only known Barker sequences have length 2, 3, 4, 5, 7, 11 or 13. It is an old conjecture that no longer Barker sequences…

Combinatorics · Mathematics 2021-04-02 Jürgen Willms
‹ Prev 1 4 5 6 7 8 10 Next ›