Related papers: On sums of Fibonacci numbers with few binary digit…

Different authors have done analysis regarding sums of powers References number 1,2 and 3, but systematic approach for solving Diophantine equations having sums of many biquadratics equal to a quartic has not been done before. In this paper…

In this paper we consider the Diophantine equation $x^2+q^{2m}=2y^p$ where $m,p,q,x,y$ are integer unknowns with $m>0,$ $p$ and $q$ are odd primes and $\gcd(x,y)=1.$ We prove that there are only finitely many solutions $(m,p,q,x,y)$ for…

In this paper, we find all integers $c$ having at least two representations as a difference between linear recurrent sequences. This problem is a pillai problem involving Padovan and Fibonacci sequence. The proof of our main theorem uses…

For an integer $k\geq 2$, let $(L_{n}^{(k)})_{n}$ be the $k-$generalized Lucas sequence which starts with $0,\ldots,0,2,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we find all the integers…

Let $A,B,C,D$ be rational numbers such that $ABC \neq 0$, and let $n_1>n_2>n_3>0$ be positive integers. We solve the equation $$ Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = f(g(x)),$$ in $f,g \in \mathbb{Q}[x]$. In sequel we use Bilu-Tichy method to…

The sufficient conditions for solvability of a linear Diophantine equation $\sum_{i=1}^{n}a_ix_i=b$ (with $a_1,a_2,...,a_n\in \mathbb{N}$) in non-negative integers $x_1,x_2,...,x_n$ are given. The explicit formulas are given for Frobenius…

Let $ (G_n)_{n=0}^{\infty} $ be a polynomial power sum, i.e. a simple linear recurrence sequence of complex polynomials with power sum representation $ G_n = f_1\alpha_1^n + \cdots + f_k\alpha_k^n $ and polynomial characteristic roots $…

Let $(G_k)_{k\in\mathbb Z}$ be any sequence obeying the recurrence relation of the Fibonacci numbers. We derive formulas for $\sum_{j=1}^n{G_{j + t}^6}$ and $\sum_{j=1}^n{(-1)^{j - 1}G_{j + t}^5(G_{j + t - 1} + G_{j + t + 1})}$, thereby…

We study the Diophantine equation $\displaystyle{\tfrac{a+1}{b} + \tfrac{b+1}{a} \ = \ k}$, where $k$ is an integer. Using Vieta jumping, we completely classify all positive integer pairs $(a, \, b)$. We prove that the associated integer…

We obtain closed-form expressions for all sums of the form \mbox{$\sum_{k = 1}^n {F_{mk}{}^4 }$} and \mbox{$\sum_{k = 1}^n {L_{mk}{}^4 }$} and their alternating versions, where $F_i$ and $L_i$ denote Fibonacci and Lucas numbers…

We present new expressions for the $k$-generalized Fibonacci numbers, say $F_k(n)$. They satisfy the recurrence $F_k(n) = F_k(n-1) +\dots+F_k(n-k)$. Explicit expressions for the roots of the auxiliary (or characteristic) polynomial are…

We are motivated by a result of Alzer and Luca who presented all the integer solutions to the relations $(k!)^n-k^n=(n!)^k-n^k$ and $(k!)^n+k^n=(n!)^k+n^k$. We modify the equations by considering the double factorial instead and present all…

This paper is a continuation of [1], in which I studied Harvey Friedman's problem of whether the function f(x,y) = x^2 + y^3 satisfies any identities; however, no knowledge of [1] is necessary to understand this paper. We will break the…

Let $F_n(k)$ be the generalized Fibonacci number defined by (with $F_i(k)$ abbreviated to $F_i$): $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$, for $n \geq k$, and the initial values $(F_0,F_1,...,F_{k-1})$. Let $B_n(k,j)$ be $F_n(k)$ with…

Let $k\ge 2$ and $\{F_n^{(k)}\}_{n\geq 2-k}$ be the sequence of $k$--generalized Fibonacci numbers whose first $k$ terms are $0,\ldots,0,0,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we determine all…

We offer several new summation identities involving harmonic numbers, odd harmonic numbers, and Fibonacci numbers. Our results are derived using three different approaches: partial summation, polynomial identities and binomial…

Let $c$ be a square-free positive integer and $p$ a prime satisfying $p\nmid c$. Let $h(-c)$ denote the class number of the imaginary quadratic field $\mathbb{Q}(\sqrt{-c})$. In this paper, we consider the Diophantine equation…

In this paper we present a new method of solving the classical diophantine equation $A^4+B^4=C^4+D^4$. Two methods of solving this equation, given by Euler, yield parametric solutions given by polynomials of degrees 7 and 13. Several other…

Let $S := \{p_1,\ldots ,p_{\ell}\}$ be a finite set of primes and denote by $\mathcal{U}_S$ the set of all rational integers whose prime factors are all in $S$. Let $(U_n)_{n\geq 0}$ be a non-degenerate linear recurrence sequence with order…

We notice that one of the Diophantine equations, $knm=2kn+2km+2nm$, arising in the universality originated Diophantine classification of simple Lie algebras, has interesting interpretations for two different sets of signs of variables. In…