English
Related papers

Related papers: On a variant of Pillai's problem

200 papers

We show that every positive integer different from $3$ and $5$ can be realized as the $m$-invariant of a field.

Number Theory · Mathematics 2025-07-24 Connor Cassady

In this paper, we introduce the h-analogue of Fibonacci numbers for non-commutative h-plane. For h h'= 1 and h = 0, these are just the usual Fibonacci numbers as it should be. We also derive a collection of identities for these numbers.…

Mathematical Physics · Physics 2009-10-02 H. B. Benaoum

Let c > 0.55. Every large n can be written in the form p +ab, where p is prime, a and b are significantly smaller than x^1/2 and ab is less than n^c. This strengthens a result of Heath-Brown, which has the requirement c>3/4. We introduce…

Number Theory · Mathematics 2020-11-24 Roger Baker , Glyn Harman

By applying Ricceri's variational principle, we demonstrate the existence of solutions for the following Robin problem \begin{equation*}\left\{ \begin{array}{cc}-\func{div}\left( \omega _{1}(x)\left\vert \nabla u\right\vert^{p(x)-2}\nabla…

Analysis of PDEs · Mathematics 2020-12-15 Ismail Aydin , Cihan Unal

We investigate integer numbers which possess at the same time the properties to be triangulars and squares, that are, numbers $a$ for which do exist integers $m$ and $n$ such that $ a = n^2 = \frac{m \cdot (m+1)}{2} $. In particular, we are…

Number Theory · Mathematics 2017-03-21 Fabio Roman

In this paper, harkening back to ideas of Hardy and Ramanujan, Mahler and de Bruijn, with the addition of more recent results on the Fibonacci Dirichlet series, we determine the asymptotic number of ways $p_F(n)$ to write an integer as the…

Number Theory · Mathematics 2025-03-12 Michael Coons , Simon Kristensen , Mathias L. Laursen

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 derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

General Mathematics · Mathematics 2019-01-09 Kunle Adegoke , Tokunbo Omiyinka

We investigate here the representability of integers as sums of triangular numbers, where the $n$-th triangular number is given by $T_n = n(n + 1)/2$. In particular, we show that $f(x_1,x_2,..., x_k) = b_1 T_{x_1} +...+ b_k T_{x_k}$, for…

Number Theory · Mathematics 2019-08-07 Wieb Bosma , Ben Kane

It is known that the greatest common divisor of two Fibonacci numbers is again a Fibonacci number. It is called the strong divisibility property. However, this property does not hold for every second order sequence. In this paper we study…

Number Theory · Mathematics 2019-03-26 Rigoberto Flórez , Robinson A. Higuita , Antara Mukherjee

There are many papers written on the Two Envelopes Problem that usually study some of its variations. In this paper we will study and compare the most significant variations of the problem. We will see the correct decisions for each player…

History and Overview · Mathematics 2014-11-12 Panagiotis Tsikogiannopoulos

In this paper, we bring a complete solution to the Ovals problem, as formulated in [3] and [24].

Functional Analysis · Mathematics 2025-04-22 Yacine Chitour , Jochen Denzler , Frédéric Jean , Emmanuel Trélat

In this paper, we show that if $p\equiv 1\pmod 4$ is prime, then $4F_p$ admits a representation of the form $u^2-pv^2$ for some integers $u$ and $v$, where $F_n$ is the $n$th Fibonacci number. We prove a similar result when $p\equiv -1\pmod…

Number Theory · Mathematics 2015-02-17 Pedro Berrizbeitia , Florian Luca , Alberto Mendoza

In this paper we state some conjectures about q-Fibonacci polynomials which for q=1 reduce to well-known results about Fibonacci numbers and Fibonacci polynomials.

Combinatorics · Mathematics 2008-05-06 Johann Cigler

Given positive integers $a_1,...,a_n$ with $\gcd(a_1,...,a_n) = 1$, we call an integer t representable if there exist nonnegative integers $m_1,...,m_n$ such that $t = m_1 a_1 + ... + m_n a_n$. In this paper, we discuss the linear…

Number Theory · Mathematics 2007-05-23 Matthias Beck , Sinai Robins

At a conference in Debrecen in October 2010 Nathanson announced some results concerning the arithmetic diameters of certain sets. He proposed some related results on the representation of integers by sums or differences of powers of 2 and…

Number Theory · Mathematics 2011-08-19 Lajos Hajdu , Rob Tijdeman

We consist of first presenting Zeckendorf Theorem with these two versions Fibonacci and Luca. In this document we obtain results on the generalized of the Zeckendorf theorem for Fibonacci numbers (multibonacci). Such results find…

Number Theory · Mathematics 2024-03-27 Rachid Chergui

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_0 = 0, F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for $n \geq 0$. In this paper, we solve all powers of two which are sums of four Fibonacci numbers with a few exceptions that we…

Number Theory · Mathematics 2022-02-22 Pagdame Tiebekabe , Ismaïla Diouf

Let $a, b\in \mathbb{N}$ be relatively prime. We consider $(a-1)(b-1)/2$, which arises in the study of the $pq$-th cyclotomic polynomial, where $p,q$ are distinct primes. We prove two possible representations of $(a-1)(b-1)/2$ as…

Number Theory · Mathematics 2020-01-23 Hung Viet Chu

We give alternative proof of Melham's and Howard's identities on generalised Fibonacci numbers

Number Theory · Mathematics 2013-05-09 Cheng Lien Lang , Mong Lung Lang