English
Related papers

Related papers: Markoff $m$-triples with $k$-Fibonacci components

200 papers

This note concerns the non-existence of three consecutive powerful numbers. We use Pell equations, elliptic curves, and second-order recurrences to show that there are no such triplets with the middle term a perfect cube and each of the…

Number Theory · Mathematics 2025-03-28 Tsz Ho Chan

Markov's equation x^2 + y^2 + z^2 = 3xyz is a widely studied topic in number theory, and the structure of its solutions has profound connections with mathematical fields such as combinatorics, hyperbolic geometry, approximation theory, and…

Combinatorics · Mathematics 2025-10-14 Tianyi Tao , Bohan Yang

Two well-studied Diophantine equations are those of Pythagorean triples and elliptic curves; for the first, we have a parametrization through rational points on the unit circle, and for the second we have a structure theorem for the group…

Number Theory · Mathematics 2021-12-08 Thomas Jaklitsch , Thomas C. Martinez , Steven J. Miller , Sagnik Mukherjee

Let $a$ and $m>0$ be integers. We show that for any integer $b$ relatively prime to $m$, the set $\{a^n+bn:\ n=1,\ldots,m^2\}$ contains a complete system of residues modulo $m$. We also pose several conjectures for further research; for…

Number Theory · Mathematics 2014-02-28 Zhi-Wei Sun

Within the scope of elementary number theory, we prove that, as the main result, if $1 \leq x < y < z$ are integers such that at least one of $y, z, x+y$ is prime then $x^{n}+y^{n} \neq z^{n}$ for every odd integer $n \geq 3$. This result…

General Mathematics · Mathematics 2020-03-23 Yu-Lin Chou

In this work we develop exact formulas to the number of solutions of $ax+by+cz=n$ in some special cases. In 2020, Binner gave a formula for the number of non negative integer solutions, $N(a,b,c;n)$ in non-negative integer pairs $(x,y,z),$…

Number Theory · Mathematics 2026-04-14 Pooja Teotia

We study the extended Frobenius problem for sequences of the form $\{f_a+f_n\}_{n\in\mathbb{N}}$, where $\{f_n\}_{n\in\mathbb{N}}$ is the Fibonacci sequence and $f_a$ is a Fibonacci number. As a consequence, we show that the family of…

Number Theory · Mathematics 2023-05-29 Aureliano M. Robles-Pérez , José Carlos Rosales

The $m$-bonacci word is a generalization of the Fibonacci word to the $m$-letter alphabet $\mathcal{A} = {0,...,m-1}$. It is the unique fixed point of the Pisot--type substitution $ \varphi_m: 0\to 01, 1\to 02, ..., (m-2)\to0(m-1), and…

Combinatorics · Mathematics 2014-05-27 Karel Břinda , Edita Pelantová , Ondřej Turek

Let K be a hyperbolic (-2,3,n) pretzel knot and M = S^3 K its complement. For these knots, we verify a conjecture of Reid and Walsh: there are at most three knot complements in the commensurability class of M. Indeed, if n \neq 7, we show…

Geometric Topology · Mathematics 2014-10-01 Melissa L. Macasieb , Thomas W. Mattman

We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…

Combinatorics · Mathematics 2010-12-17 Milan Janjic

By finding all integral points on certain elliptic and hyperelliptic curves we completely solve the Diophantine equation $\binom{n}{k}=\binom{m}{l}+d$ for $-3\leq d\leq 3$ and $(k,l)\in\{(2,3),\; (2,4),\;(2,5),\; (2,6),\; (2,8),\; (3,4),\;…

Number Theory · Mathematics 2019-04-26 Homero R. Gallegos-Ruiz , Nikolaos Katsipis , Szabolcs Tengely , Maciej Ulas

It is conjectured 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 integers $x,y$ and $z$, except for specific cases. We develop…

Number Theory · Mathematics 2025-04-15 Takafumi Miyazaki , István Pink

Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…

Number Theory · Mathematics 2023-10-05 Tong Lin , Qiang Wang

For a subset $A$ of $\{1,2,\ldots,N\}^2$ of size $\alpha N^2$ we show existence of $(m,n)\neq(0,0)$ such that the set $A$ contains at least $(\alpha^3 - o(1))N^2$ triples of points of the form $(a,b)$, $(a+m,b+n)$, $(a-n,b+m)$. This answers…

Combinatorics · Mathematics 2021-12-06 Vjekoslav Kovač

Prempreesuk, Noppakaew, and Pongsriiam determined the Zeckendorf representation of the multiplicative inverse of $2$ modulo $F_n$, for every positive integer $n$ not divisible by $3$, where $F_n$ denotes the $n$th Fibonacci number. We…

Number Theory · Mathematics 2022-03-14 Gessica Alecci , Nadir Murru , Carlo Sanna

We give an explicit formula for the $p$-Frobenius number of triples associated with Diophantine equations $x^2+y^2=z^r$, that is, the largest positive integer that can only be represented in $p$ ways by combining the three integers of the…

Number Theory · Mathematics 2024-03-13 Takao Komatsu , Neha Gupta , Manoj Upreti

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

If L, respectively R are matrices with entries binom{i-1,j-1}, respectively binom{i-1,n-j}, it is known that L^2 = I (mod 2), respectively R^3 = I (mod 2), where I is the identity matrix of dimension n > 1 (see P10735-May 1999 issue of the…

Combinatorics · Mathematics 2007-05-23 Rhodes Peele , Pantelimon Stanica

In this paper, using a generating function approach, we derive several new convolution sum identities involving Fibonacci m-step numbers. As special instances of the results derived herein, we will get many new and known results involving…

General Mathematics · Mathematics 2024-04-01 Robert Frontczak , Karol Gryszka

Let p be a prime and let a be a positive integer. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=1}^{p-1}\binom{2k}{k+d}/(km^{k-1})$ modulo $p$ for all d=0,...,p^a, where m is any integer not divisible by p.…

Number Theory · Mathematics 2010-04-02 Zhi-Wei Sun , Roberto Tauraso