Related papers: Random Diophantine Equations in the Primes II

In this paper we solve the ternary Piatetski-Shapiro inequality with prime numbers of a special form. More precisely we show that, for any fixed $1<c<\frac{427}{400}$, every sufficiently large positive number $N$ and a small constant…

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

Diophantine equations are multivariate equations, usually polynomial, in which only integer solutions are admitted. A brute force method for finding solutions would be to systematically substitute possible integer solutions and check for…

Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…

In this paper, we summarize the work on ternary Diophantine equation of the form $Ax^n+By^n=cz^m$, where $m \in \{2,3,n\} $, $n\geqslant 7 $ is a prime. Moreover, we completely solve some particular cases ($A=5^{\alpha}, ~B=64,~ c=3, ~m=2;…

We consider a variety of Euler's conjecture, i.e., whether the Diophantine system \[\begin{cases} n=a_{1}+a_{2}+\cdots+a_{s-1}, a_{1}a_{2}\cdots a_{s-1}(a_{1}+a_{2}+\cdots+a_{s-1})=b^{s} \end{cases}\] has solutions…

Locally variational systems of differential equations on smooth manifolds, having certain de Rham cohomology group trivial, automatically possess a global Lagrangian. This important result due to Takens is, how-ever, of sheaf-theoretic…

Let $k\ge 2$ and $a_1, a_2, \cdots, a_k$ be positive integers with \[ \gcd(a_1, a_2, \cdots, a_k)=1. \] It is proved that there exists a positive integer $G_{a_1, a_2, \cdots, a_k}$ such that every integer $n$ strictly greater than it can…

We investigate a family of Diophantine polynomial equations which involve continuant functions. In particular, given a polynomial $P(x)\in \mathbb{Z}[x]$ and $n\in \mathbb{N}$, we consider the equation $P(K_n(x_1,\ldots, x_n)) =…

By applying Schmidt's lattice method, we prove results on simultaneous Diophantine approximation modulo 1 for systems of polynomials in a single prime variable provided that certain local conditions are met.

In a series of articles published in the C.R. Paris more than a century ago, T. P\'epin announced a list of ``theorems'' concerning the solvability of diophantine equations of the type $ax^4 + by^4 = z^2$. In this article, we show how to…

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.

We present a classification of all global solutions for generalized 2D dilaton gravity models (with Lorentzian signature). While for some of the popular choices of potential-like terms in the Lagrangian, describing, e.g., string inspired…

In this paper, we consider the Diophantine equation $\lambda_1U_{n_1}+\ldots+\lambda_kU_{n_k}=wp_1^{z_1} \cdots p_s^{z_s},$ where $\{U_n\}_{n\geq 0}$ is a fixed non-degenerate linear recurrence sequence of order greater than or equal to 2;…

Let $d$ and $n$ be natural numbers greater or equal to $2$. Let $\langle \boldsymbol{a}, \nu_{d,n}(\boldsymbol{x})\rangle\in \mathbb{Z}[\boldsymbol{x}]$ be a homogeneous polynomial in $n$ variables of degree $d$ with integer coefficients…

We show how to determine the $k$-th bit of Chaitin's algorithmically random real number $\Omega$ by solving $k$ instances of the halting problem. From this we then reduce the problem of determining the $k$-th bit of $\Omega$ to determining…

In this paper, we give all the solutions of the Diophantine equation x^2+7^{alpha}.11^{beta}=y^n, in nonnegative integers x, y, n>=3 with x and y coprime, except for the case when alpha.x is odd and beta is even.

In the fall 2011 issue of the Journal'Mathematics and Computer Education', author Unal Hasan, in the one page article "Proof without Words", gives a purely geometric proof of the equality, arctan(1/3)+ arctan(1/7) = arctan(1/2) (1) (See…

This paper presents a linear prioritized local algorithm that computes large independent sets on a random $d$-regular graph with small and fixed degree $d$. We studied experimentally the independence ratio obtained by the algorithm when $ d…

Let $n$ be a positive integer. We discuss pairs of distinct odd primes $p$ and $q$ not dividing $n$ for which the Diophantine equations $pq=x^2+ny^2$ have integer solutions in $x$ and $y$. As its examples we classify all such pairs of $p$…