English
Related papers

Related papers: A Diophantine inequality with four prime variables

200 papers

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$…

Number Theory · Mathematics 2014-04-18 Ja Kyung Koo , Dong Hwa Shin

The title equation, where $p>3$ is a prime number $\not\equiv 7 \pmod 8$, $q$ is an odd prime number and $x,y,n$ are positive integers with $x,y$ relatively prime, is studied. When $p\equiv 3\pmod 8$, we prove (Theorem 2.3) that there are…

Number Theory · Mathematics 2021-08-27 A. Laradji , M. Mignotte , N. Tzanakis

A semiprime is a natural number which is the product of two (not necessarily distinct) prime numbers. Let $F(x_1, \ldots, x_n)$ be a degree $d$ homogeneous form with integer coefficients. We provide sufficient conditions, similar to those…

Number Theory · Mathematics 2019-11-22 Shuntaro Yamagishi

Let $(a,b,c)$ be a primitive Pythagorean triple. Set $a=m^2-n^2$,$b=2mn$, and $c=m^2+n^2$ with $m$ and $n$ positive coprime integers, $m>n $ and $ m \not \equiv n \pmod 2$. A famous conjecture of Je\'{s}manowicz asserts that the only…

Number Theory · Mathematics 2020-10-17 Amir Ghadermarzi

In 2016 Izadi and Nabardi (b) showed (4-2-4) has infinitely many integer solutions. They used a specific congruent number elliptic curve.In 2019 Janfada and Nabardi,item C, showed that a necessary condition for n to have an integral…

General Mathematics · Mathematics 2022-08-23 Seiji Tomita , Oliver Couto

In this paper, we prove that the discrete Copson inequality (E.T. Copson, \emph{Notes on a series of positive terms}, J. London Math. Soc., 2 (1927), 49-51) of one-dimension in general cases admits an improvement. In fact we study the…

Classical Analysis and ODEs · Mathematics 2025-08-04 Bikram Das , Atanu Manna

We prove that for given integers b and c, the diophantine equation x^2+bx+c=y^2, has finitely many integer solutions(i.e. pairs in ZxZ),in fact an even number of such solutions(including the zero or no solutions case).We also offer an…

General Mathematics · Mathematics 2008-03-28 Konstantine "Hermes" Zelator

For a prime p, a Diophantine m-tuple in $\mathbb{F}_p$ is a set of m nonzero elements of $\mathbb{F}_p$ with the property that the product of any two of its distinct elements is one less than a square. In this paper, we present formulas for…

Number Theory · Mathematics 2021-01-12 Andrej Dujella , Matija Kazalicki

We consider equations of the form $a_{1}x_{1}^{k}+...+a_{s}x_{s}^{k}$ and when they have solutions in the primes. We define an analogue of the Hasse principle for solubility in the primes (which we call the prime Hasse principle), and prove…

Number Theory · Mathematics 2026-05-14 Philippa Holdridge

Let $d\ge 2$ and $n\ge d$ with $(d,n)\notin \{(2,2),(3,3)\}$. We consider homogeneous Diophantine equations of degree $d$ in $n+1$ variables and whether they have solutions in the primes. In particular, we show that a certain local-global…

Number Theory · Mathematics 2026-05-14 Philippa Holdridge

In this paper one shows if the number of natural solutions of a general linear equation is limited or not. Also, it is presented a method of solving the Diophantine equation $ax-by=c$ in the set of natural numbers, and an example of solving…

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…

Number Theory · Mathematics 2021-09-27 Szabolcs Tengely , Maciej Ulas

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we generalize the result of Vaughan for ternary admissible exponent. Moreover, we use the refined admissible…

Number Theory · Mathematics 2020-03-31 Min Zhang , Jinjiang Li

This work determine the entire family of positive integer solutions of the diophantine equation. The solution is described in terms of $\frac{(m-1)(m+n-2)}{2} $ or $\frac{(m-1)(m+n-1)}{2}$ positive parameters depending on $n$ even or odd.…

Number Theory · Mathematics 2014-02-24 Zahid Raza , Hafsa Masood Malik

By finding all integral points on certain elliptic and hyperelliptic curves we completely solve the Diophantine equation $\binom{n}{k}=\binom{m}{l}+d$ for $-3\leq d\leq 3$ and $(k,l)\in\{(2,3),\; (2,4),\;(2,5),\; (2,6),\; (2,8),\; (3,4),\;…

Number Theory · Mathematics 2019-04-26 Homero R. Gallegos-Ruiz , Nikolaos Katsipis , Szabolcs Tengely , Maciej Ulas

For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.

Number Theory · Mathematics 2012-09-20 Zhi-Wei Sun

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…

General Mathematics · Mathematics 2021-01-08 Sheng-Ping Wu

In this paper we study the Diophantine equation $x^{4}-q^{4}=py^{5},$ with the following conditions: $p$ and $q$ are different prime natural numbers, $y$ is not divisible with $p$, $p\equiv3$ (mod20), $q\equiv4$ (mod5), $\overline{p}$ is a…

Number Theory · Mathematics 2009-07-06 Diana Savin

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$.

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

In this paper we find non-negative integer solutions for exponential Diophantine equations of the type $p \cdot 3^x+ p^y=z^2,$ where $p$ is a prime number. We prove that such equation has a unique solution…

Number Theory · Mathematics 2023-08-22 A. L. P. Porto , M. Buosi , G. S. Ferreira