Related papers: On Hunting for Taxicab Numbers
The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…
In Section 6.6 of the book {\it Number Theory, Volume I: Tools and Diophantine Equations, Graduate Texts in Mathematics, Volume 239, Springer (2007)}, Cohen investigated the solubility of the equation $n=x^4+y^4$ in the rational numbers…
For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…
Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive discriminant. In this paper, we consider the Diophantine equation $u_m + u_n = a_1 n_1! + \cdots + a_k n_k!$ and prove that there are only finitely many…
We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…
The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…
We develop new closed form representations of sums of (n + {\alpha})th shifted harmonic numbers and reciprocal binomial coefficients in terms of {\alpha}th shifted harmonic numbers. Some interesting new consequences and illustrative…
We study the singular series associated to a cubic form with integer coefficients. If the number of variables is at least $10$, we prove the absolute convergence (and hence positivity) under the assumption of Davenport's Geometric…
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…
Let $p$ be a prime integer, $\mathbb{Z}_p$ the finite field of order $p$ and $\mathbb{Z}^{*}_{p}$ is its multiplicative cyclic group. We consider the Diophantine equation $x^n + y^n = z^n$ with $1 \leq n \leq \frac{p - 1}{2}$. Our main aim…
By using the Newton interpolation formula, we generalize the recent identities on the Catalan triangle obtained by Miana and Romero as well as those of Chen and Chu. We further study divisibility properties of sums of products of binomial…
We study odd numbers through a straightforward indexing. We focus in particular on odd prime and composite numbers and their distribution. With a counting argument, we calculate the limit of two sums and compare their convergence rate.
In this paper we obtain a new parametric solution of the problem of finding two triads of biquadrates with equal sums and equal products.
Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of…
One may associate several frames to a given polytope, such as its collection of vertices, edges, or facet normal vectors. In this note, we use these frames to generate geometric inequalities for the simplex in $\mathbb{R}^d$ and polytopes…
This paper explores the intricate relationships between Lucas numbers and Diophantine equations, offering significant contributions to the field of number theory. We first establish that the equation regarding Lucas number $L_n = 3x^2$ has…
In modern usage the Bernoulli numbers and Bernoulli polynomials follow Euler's approach and are defined using generating functions. We consider the functional equation $f(x)+x^k=f(x+1)$ and show that a solution can be derived from…
We study central configurations when the set of positions is symmetric. We use a theorem from representation theory of finite groups to explore the symmetry properties of equations for central configurations. This approach simplifies…
We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…
In this article, we consider the Diophantine equation $\sigma_{2}(n)-n^2=An+B$ with $A=P^2\pm2$. For some $B$, we show that except for finitely many computable solutions in the range $n\leq(|A|+|B|)^{3}$, all the solutions are expressible…