Related papers: Finding all squared integers expressible as the su…

Suppose a positive integer $n$ is written as a sum of squares of $m$ integers. What can one say about the value $T$ of the sum of these $m$ integers itself? Which $T$ can be obtained if one considers all possible representations of $n$ as a…

We deal with the problem to find the number $P(b)$ of integer non-negative solutions of an equation $\sum_{i=1}^{n} a_i x_i=b$, where $a_1,a_2,...,a_n$ are natural numbers and $b$ is a non-negative integer. As different from the traditional…

A generalization of the well-known Fibonacci sequence is the $k$-Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,0, \ldots, 1$, and each term afterwards is the sum of the preceding $k$ terms.…

The classical Pell equation can be extended to the cubic case considering the elements of norm one in $Z[\sqrt[3]{r}]$, which satisfy $x^3 + r y^3 + r^2 z^3 - 3 r x y z = 1$. The solution of the cubic Pell equation is harder than the…

Let $d$ be a square-free integer and $\mathbb{Z}[\sqrt{d}]$ a quadratic ring of integers. For a given $n\in\mathbb{Z}[\sqrt{d}]$, a set of $m$ non-zero distinct elements in $\mathbb{Z}[\sqrt{d}]$ is called a Diophantine $D(n)$-$m$-tuple (or…

Given a prime $p\ge5$ and an integer $s\ge1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^s$, such that $f$ is not a square, if a sequence…

An important unsolved problem in Diophantine number theory is to establish a general method to effectively find all solutions to any given $S$-unit equation with at least four terms. Although there are many works contributing to this…

The purpose of this article is to give the solutions of the inverse problem for Pellian equations. For any rational number $0< a/b < 1$, the fundamental discriminants $D$ satisfying $(\lfloor \sqrt{D} \rfloor b + a)^2 - D b^2 = 4$ are given…

Necessary and sufficient conditions for the existence of an integer solution of the diophantine equation $m/n=1/x(\lambda)+1/y(\lambda)+1/z(\lambda)$ with $n=b+a\lambda$ are explicitly given for a,b coprime and a not a multiple of m . The…

In this note we study the integer solutions of Cayley's cubic equation. We find infinite families of solutions built from recurrence relations. We use these solutions to solve certain general Pell equations. We also show the similarities…

For each integer $x$, the $x$-th generalized pentagonal number is denoted by $P_5(x)=(3x^2-x)/2$. Given odd positive integers $a,b,c$ and non-negative integers $r,s$, we employ the theory of ternary quadratic forms to determine when the sum…

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

Using Pascal triangle, we give a simple generalization to the so-called STRAND Puzzle solved by Srinivasa Ramanujan. Thus we are interested in computing the median, first and third quartiles of some integer valued distributions, arising…

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…

This paper is concerned with the problem of finding $n$ distinct squares such that, on excluding any one of them, the sum of the remaining $n-1$ squares is a square. While parametric solutions are known when $n=3$ and $n=4$, when $n > 4$,…

Let $S$ be a fixed set of primes and let $(X_{l})_{l\geq 1}$ be the $X$-coordinates of the positive integer solutions $(X, Y)$ of the Pell equation $X^2-dY^2 = 1$ corresponding to a non-square integer $d>1$. We show that there are only a…

We show that for each n-tuple of positive rational integers (a_1,..,a_n) there are sets of primes S of arbitrarily large cardinality s such that the solutions of the equation a_1x_1+...+a_nx_n=1 with the x_i all S-units are not contained in…

We consider the equality of the values of the $n$th and $k$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. For $k < n$, we prove that this equation always has a solution, but only finitely many…

An analysis of the Markov tree is presented. Markov triplets, {x,R,z}, are the positive integer solutions to the Diophantine equation x2 + R2 + z2 = 3xRz. Inspired by patterns of the Fibonacci and Pell triplets in Region 1 and Region 2 of…

Equivalence classes of solutions of the Diophantine equation $a^2+mb^2=c^2$ form an infinitely generated abelian group $G_m$, where $m$ is a fixed square-free positive integer. Solutions of Pell's equation $x^2-my^2=1$ generate a subgroup…