Related papers: On products of disjoint blocks of arithmetic progr…
In this note, we look at the diophantine equation $$ \prod_{i=1}^ta_i!=\prod_{j=1}^sn_i!, \quad n_1\geq \cdots \geq n_s\geq 2 \quad \textnormal{and}\quad n_1>a_1\geq a_2\geq\cdots \geq a_t\geq2. $$ \noindent Let $s<t$. Under the (explicit)…
In this paper we obtain a new parametric solution of the problem of finding two triads of biquadrates with equal sums and equal products.
In this paper, we determine the Hausdorff dimension of the set of points with divergent trajectories on the product of certain homogeneous spaces. The flow is allowed to be weighted with respect to the factors in the product space. The…
We deal with various Diophantine equations involving the Euler totient function and various sequences of numbers, including factorials, powers, and Fibonacci sequences.
An open problem about finite geometric progressions in syndetic sets leads to a family of diophantine equations related to the commutativity of translation and multiplication by squares.
We wish to discuss positive integer solutions to the Diophantine equation $$\prod_{k=1}^n(k^2+1)=b^2.$$ Some methods in analytic number theory will be used to tackle this problem.
The metrical theory of the product of consecutive partial quotients is associated with the uniform Diophantine approximation, specifically to the improvements to Dirichlet's theorem. Achieving some variant forms of metrical theory in…
From a known result of diophantine equations of the first degree with 2 unknowns we simply find the results of the distribution function of the sequences of positive integers generated by the functions at the origin of the 3x+1 and 5x+1…
We reduce the principal problem of Additive Number Theory of whether an infinite sequence of integers constitutes a finite basis for the integers to a Diophantine problem involving the difference set of the sequence, by proving a formula…
Two Diophantine equation generator function for integer residuals produced by integer division over closed intervals are presented. One each for the closed intervals [1,Floor(n^0.5)] and [Ceiling(n^0.5),n], respectively.
This paper is devoted to the study of a problem of Cassels in multiplicative Diophantine approximation which involves minimising values of a product of affine linear forms computed at integral points. It was previously known that values of…
We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…
In this paper we give solutions of certain diophantine equations related to triangular and tetrahedral numbers and propose several problems connected with these numbers. The material of this paper was presented in part at the 11th…
The theory of uniform Diophantine approximation concerns the study of Dirichlet improvable numbers and the metrical aspect of this theory leads to the study of the product of consecutive partial quotients in continued fractions. It is known…
Diophantine approximation is the problem of approximating a real number by rational numbers. We propose a version of this in which the numerators are approximately related to the denominators by a Laurent polynomial. Our definition is…
Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as…
Markov numbers are integers that appear in the solution triples of the Diophantine equation, $x^2+y^2+z^2=3xyz$, called the Markov equation. A classical topic in number theory, these numbers are related to many areas of mathematics such as…
We collect a number of open questions concerning Diophantine equations, Diophantine Approximation and transcendental numbers. Revised version: corrected typos and added references.
We prove new results, related to the Littlewood and Mixed Littlewood conjectures in Diophantine approximation.
Myasnikov, Ushakov, and Won introduced power circuits in 2012 to construct a polynomial-time algorithm for the word problem in the Baumslag group, which has a non-elementary Dehn function. Power circuits are computational structures that…