English
Related papers

Related papers: A classification of Markoff-Fibonacci m-triples

200 papers

The Fibonacci numbers are a sequence of integers in which every number after the first two, 0 and 1, is the sum of the two preceding numbers. These numbers are well known and algorithms to compute them are so easy that they are often used…

Data Structures and Algorithms · Computer Science 2018-04-16 Ali Dasdan

We prove a generalisation of Vinogradov's theorem by finding for $m\geqslant 3$ and fixed positive integers $c_1, \dots ,c_m, r_1, \dots , r_m$ the asymptotics of the number of sequences $(n_1, \dots ,n_m) \in \mathbf{N}^{m}$ such that…

Number Theory · Mathematics 2022-03-21 Paweł Lewulis

In this paper, we find all the sums of three Fibonacci numbers which are close to a power of 2. This paper continues and extends the previous work of Hasanalizade \cite{Hasanalizade}.

Number Theory · Mathematics 2022-07-27 Bibhu Prasad Tripathy , Bijan Kumar Patel

We discuss properties of diophantine solutions of the Pythagoras equation, $a^2+b^2=c^2$, where the three numbers have no common factor. Some of the highlights are: (1) All triplets for which $c$ (called the `peak') is non-prime can be…

General Mathematics · Mathematics 2023-06-23 Palash B. Pal

Given two relatively prime numbers $a$ and $b$, it is known that exactly one of the two Diophantine equations has a nonnegative integral solution $(x,y)$: $$ ax + by \ =\ \frac{(a-1)(b-1)}{2}\quad \mbox{ and }\quad 1 + ax + by \ =\…

Number Theory · Mathematics 2025-09-11 Hung Viet Chu , Rishabh Gulecha , Sicheng Guo , Nathanael Johnson , Steven J. Miller , Yeju Shin

We prove that for every positive integer $m$, there exist infinitely many simple abelian varieties over $\mathbb{F}_2$ of order $m$. The method is constructive, building on the work of Madan--Pal in the case $m=1$ to produce an explicit…

Number Theory · Mathematics 2022-08-09 Kiran S. Kedlaya

Let $\{f_n\}$ be the Fibonacci sequence. For any positive integer $n$, let $r(n)$ be the number of solutions of $n=p+f_{k_1^{2}} +f_{k_{2}^{2}}$, where $p$ is a prime and $k_1, k_2$ are nonnegative integers with $k_1\le k_2$. In this paper,…

Number Theory · Mathematics 2025-06-05 Ji-Zhen Xu , Yong-Gao Chen

As a variant of Zeckendorf's theorem, Chung and Graham proved that every positive integer can be uniquely decomposed into a sum of even-indexed Fibonacci numbers, whose coefficients are either $0, 1$, or $2$ so that between two coefficients…

General Mathematics · Mathematics 2025-01-08 Hung Viet Chu , Aney Manish Kanji , Zachary Louis Vasseur

Diophantine triples taking values in recurrence sequences have recently been studied quite a lot. In particular the question was raised whether or not there are finitely many Diophantine triples in the Tribonacci sequence. We answer this…

Number Theory · Mathematics 2016-01-21 Clemens Fuchs , Christoph Hutle , Nurettin Irmak , Florian Luca , Laszlo Szalay

A rational Diophantine $m$-tuple is a set $\{a_1,\ldots,a_m\}$ of distinct nonzero rational numbers such that $a_i a_j+1$ is a square for all $1\leq i < j\leq m$. Similarly, we may ask when $a_ia_j+1$ is a $k$-th power. Here, we study the…

Number Theory · Mathematics 2026-05-04 Alen Andrašek

We propose an equivalent condition for the Markov triples, which was mentioned by H. Rademacher essentially. As an application, we study the solvability of the Diophantine equation $a^2+b^2+c^2=abcf(a,b,c)$.

Number Theory · Mathematics 2020-08-11 Genki Shibukawa

In this paper we consider $N$, the number of solutions $(x,y,u,v)$ to the equation $ (-1)^u r a^x + (-1)^v s b^y = c$ in nonnegative integers $x, y$ and integers $u, v \in \{0,1\}$, for given integers $a>1$, $b>1$, $c>0$, $r>0$ and $s>0$.…

Number Theory · Mathematics 2011-02-24 Reese Scott , Robert Styer

Solutions to the random Fibonacci recurrence x_{n+1}=x_{n} + or - Bx_{n-1} decrease (increase) exponentially, x_{n} = exp(lambda n), for sufficiently small (large) B. In the limits B --> 0 and B --> infinity, we expand the Lyapunov exponent…

Statistical Mechanics · Physics 2009-11-07 Clément Sire , Paul L. Krapivsky

For positive integers $m$ we consider the theta functions $f_m(z):=\sum_{mk+1\text{ square }}q^k$. Due to classical identities of Jacobi, it is known that $$f_4\equiv f_6f_{12}\pmod 2.$$ Here we prove that the only triples $(a,b,c)$ for…

Number Theory · Mathematics 2021-06-03 Letong Hong , Shengtong Zhang

Let $\mathbb{N}$ be the set of all positive integers and let $a,\, b,\, c$ be nonzero integers such that $\gcd\left(a,\, b,\, c\right)=1$. In this paper, we prove the following three results: (1) the solvability of the matrix equation…

Number Theory · Mathematics 2023-01-02 Hongjian Li , Pingzhi Yuan

For $m=3,4,\ldots$, the polygonal numbers of order $m$ are given by $p_m(n)=(m-2)\binom n2+n\ (n=0,1,2,\ldots)$. For positive integers $a,b,c$ and $i,j,k\ge3$ with $\max\{i,j,k\}\ge5$, we call the triple $(ap_i,bp_j,cp_k)$ universal if for…

Number Theory · Mathematics 2015-05-15 Zhi-Wei Sun

In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that…

Number Theory · Mathematics 2015-07-20 Jeremy Alm , Taylor Herald

We establish the existence of infinitely many complete metrics with constant scalar curvature on prescribed conformal classes on certain noncompact product manifolds. These include products of closed manifolds with constant positive scalar…

Differential Geometry · Mathematics 2019-02-21 Renato G. Bettiol , Paolo Piccione

This paper contributes to the conjecture of R. Scott and R. Styer which asserts that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive…

Number Theory · Mathematics 2024-03-05 Takafumi Miyazaki , István Pink

We prove a conjecture about the minimal nonnegative solutions of algebraic Riccati equations associated with reducible singular M-matrices. The result enhances our understanding of the behaviour of doubling algorithms for finding the…

Numerical Analysis · Mathematics 2015-03-26 Di Lu , Chun-Hua Guo