Related papers: A note on balancing binomial coefficients

We revisit old conjectures of Fermat and Euler regarding representation of integers by binary quadratic form x^2+5y^2. Making use of Ramanujan's_1\psi_1 summation formula we establish a new Lambert series identity for…

In this short note we study the existence and number of solutions in the set of integers ($Z$) and in the set of natural numbers ($N$) of Diopahntine Equations of second degree with two variables of the general form $ax^2-by^2=c$.

Let $F_n$ denote the $n^{th}$ term of the Fibonacci sequence. In this paper, we investigate the Diophantine equation $F_1^p+2F_2^p+\cdots+kF_{k}^p=F_{n}^q$ in the positive integers $k$ and $n$, where $p$ and $q$ are given positive integers.…

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 have determined all the powers of 2 which are sums of five Fibonacci numbers with few exceptions that…

To give a parametrization of the Diophantine equation $A^{3}+B^{3}=C^{3}+D^{3}$ in terms of integral binary quadratic forms in a constructive way.

An open conjecture of Erdos and Moser is that the only solution of the Diophantine equation in the title is the trivial solution 1+2=3. Reducing the equation modulo k and k^2, we give necessary and sufficient conditions on solutions to the…

In this paper we extend a result of Hirata-Kohno, Laishram, Shorey and Tijdeman on the Diophantine equation $n(n+d)...(n+(k-1)d)=by^2,$ where $n,d,k\geq 2$ and $y$ are positive integers such that $\gcd(n,d)=1.$

The main idea of this article is simply calculating integer functions in module. The algebraic in the integer modules is studied in completely new style. By a careful construction, a result is proven that two finite numbers is with unequal…

Let $u_n$ be a fixed non-degenerate binary recurrence sequence with positive discriminant, $w$ a fixed non-zero integer and $p_1,p_2,\dots,p_s$ fixed, distinct prime numbers. In this paper we consider the Diophantine equation $u_n+u_m=w…

There is a growing literature on sums of reciprocals of polynomial functions of recurrence relations with constant coefficients and fixed depth, such as Fibonacci and Tribonacci numbers, products of such numbers, and balancing numbers…

In this paper, we consider the exponential Diophantine equation $a^{x}+b^{y}=c^{z},$ where $a, b, c$ be relatively prime positive integers such that $a^{2}+b^{2}=c^{r}, r\in Z^{+}, 2\mid r$ with $b$ even. That is $$a=\mid…

These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…

We deeply investigate the Diophantine equation $cx^2+d^{2m+1}=2y^n$ in integers $x, y\geq 1, m\geq 0$ and $n\geq 3$, where $c$ and $d$ are given coprime positive integers such that $cd\not\equiv 3 \pmod 4$. We first solve this equation for…

In this paper we obtain four new parametric ideal solutions of the Tarry-Escott problem of degree 7, that is, of the simultaneous diophantine equations, $\sum_{i=1}^8x_i^r=\sum_{i=1}^8y_i^r,\;r=1,\,2,\,\dots,\,7$. While all the known…

This paper is concerned with the diophantine equation $\sum_{i=1}^na_ix_i^4= \sum_{i=1}^na_iy_i^4$ where $n \geq 3$ and $a_i,\,i=1,\,2,\,\ldots,\,n$, are arbitrary integers. While a method of obtaining numerical solutions of such an…

Let $k,\ell\geq2$ be fixed integers and $C$ be an effectively computable constant depending only on $k$ and $\ell$. In this paper, we prove that all solutions of the equation $(x+1)^{k}+(x+2)^{k}+...+(\ell x)^{k}=y^{n}$ in integers $x,y,n$…

We investigate the number of integer solutions to a multiplicative Diophantine approximation problem and show that the associated counting function converges in distribution to a normal law. Our approach relies on the analysis of…

For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…

We prove a generalization of W.M. Schmidt's theorem related to the Diophantine approximations for a linear form of the type $\alpha_1x_1+\alpha_2x_2 +y$ with {\it positive} integers $x_1,x_2$.

We find all solutions of Diophantine equation x^{2}+11^{2k} = y^{n} where x>=1, y>=1, n>=3 and k is natural number. We give p-adic interpretation of this equation.