Related papers: Bounded Representations by $x^2+y^2-z^2$

Let $x$ denote a sufficiently large integer. We show that the recent result of Grimmelt and Merikoski actually yields the largest prime factor of $n^2 +1$ is greater than $x^{1.317}$ infinitely often. As an application, we give a new upper…

We develop a variety of new techniques to treat Diophantine equations of the shape $x^2+D =y^n$, based upon bounds for linear forms in $p$-adic and complex logarithms, the modularity of Galois representations attached to Frey-Hellegouarch…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that, for $12\leqslant b\leqslant 35$ and for every sufficiently large odd integer $N$, the equation…

A classical result of Honsberger states that the number of incongruent triangles with integer sides and perimeter $n$ is the nearest integer to $\frac{n^2}{48}$ ($n$ even) or $\frac{(n+3)^2}{48}$ ($n$ odd). We solve the analogous problem…

This article reports the occurrence of binary quadratic forms in primitive Pythagorean triangles and their geometric interpretation. In addition to the well-known fact that the hypotenuse, z, of a right triangle, with sides of integral…

We prove that every sufficiently large odd integer can be expressed as a sum of one square and fourteen fifth powers, all of primes. In addition, we establish that every sufficiently large even integer can be written as a sum of one square,…

We find all positive integer solutions in $x, y$ and $n$ of $x^2+19^{2k+1}=4y^{n}$ for any non-negative integer $k$.

Let $f(m)$ be the largest integer such that for every set $A = \{a_1 < \cdots < a_m\}$ of $m$ positive integers and every open interval $I$ of length $2a_m$, there exist at least $f(m)$ disjoint pairs $(a, b)$ with $a \in A$ dividing $b \in…

We prove a local-global principle for primitive representations of binary quadratic forms by quaternary quadratic forms. Our method is a variant of Linnik's ergodic method showing density for certain homogenous toral sets. The central…

Let $s(n)$ denote the sum of digits in the binary expansion of the integer $n$. Hare, Laishram and Stoll (2011) studied the number of odd integers such that $s(n)=s(n^2)=k$, for a given integer $k\geq 1$. The remaining cases that could not…

We show that the denominator formula for the strange series of affine superalgebras, conjectured by Kac and Wakimoto and proved by Zagier, follows from a classical determinant evaluation of Frobenius. As a limit case, we obtain exact…

Let $b\ge 2$ be a given integer. In this paper, we show that there only finitely many positive integers $d$ which are not squares, such that the Pell equation $X^2-dY^2=1$ has two positive integer solutions $(X,Y)$ with the property that…

In this paper, we build infinitely many non-radial sign-changing solutions to the critical problem: \begin{equation*} \left\{\begin{array}{rlll} -\Delta u&=|u|^{\frac{4}{N-2}}u, &\hbox{ in }\Omega,\\ u&=0, &\hbox{ on }\partial\Omega.…

Let $X$ be a sufficiently large positive integer. We prove that one may choose a subset $S$ of primes with cardinality $O(\log X)$, such that a positive proportion of integers less than $X$ can be represented by $x^2 + p y^2$ for at least…

An integral quadratic form is called strictly $n$-regular if it primitively represents all quadratic forms in $n$ variables that are primitively represented by its genus. For any $n \geq 2$, it will be shown that there are only finitely…

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…

In this paper we show that, for any fixed $1<c<967/805$, every sufficiently large positive number $N$ and a small constant $\varepsilon>0$, the diophantine inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\varepsilon \end{equation*}…

In the present paper we prove that under the assumption of the GRH (Generalized Riemann Hypothesis) each sufficiently large odd integer can be expressed as the sum of a prime and two isolated primes.

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

In [FI09], Friedlander and Iwaniec studied the so-called Hyperbolic Prime Number Theorem, which asks for an infinitude of elements gamma in SL(2,Z) such that the norm squared |gamma|^2 = a^2 + b^2 + c^2 + d^2 = p, a prime. Under the…