English
Related papers

Related papers: Sylvester's Problem and Mock Heegner Points

200 papers

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

In this note I give simple proofs of classical results of Euler, Legendre and Sylvester showing that for certain integers M there are no (or only a few) solutions of $x^3 + y^3 = M$, with $x$ and $y$ in $\mathbb{Q}$. The proofs all use a…

History and Overview · Mathematics 2023-09-04 Paul Monsky

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

Number Theory · Mathematics 2007-05-23 I. E. Shparlinski , J. F. Voloch

We consider small solutions of quadratic congruences of the form $x_1^2+\alpha_2x_2^2+\alpha_3x_3^2\equiv 0 \bmod{q}$, where $q=p^m$ is an odd prime power. Here, $\alpha_2$ is arbitrary but fixed and $\alpha_3$ is variable, and we assume…

Number Theory · Mathematics 2025-04-24 Stephan Baier , Aishik Chattopadhyay

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

Nagell proved that for each prime $p\equiv 1\pmod{3}$, $p > 7$, there is a prime $q<2p^{1/2}$ that is a cubic residue modulo $p$. Here we show that for each fixed $\epsilon > 0$, and each prime $p\equiv 1\pmod{3}$ with $p > p_0(\epsilon)$,…

Number Theory · Mathematics 2017-11-07 Kübra Benli , Paul Pollack

We show that the existence of a non-trivial solution of $x^n+y^n=p^n$, with $p$ a prime number, is equivalent to the existence of a solution of a certain (over-determined) system of $(n-1)$-recursion relations ("zipper" equations) in…

General Mathematics · Mathematics 2017-08-11 Yochay Jerby

We prove that the Fermat-type equation $x^3 + y^3 = z^p$ has no solutions $(a,b,c)$ satisfying $abc \ne 0$ and $\gcd(a,b,c)=1$ when $-3$ is not a square mod~$p$. This improves to approximately $0.844$ the Dirichlet density of the set of…

Number Theory · Mathematics 2016-01-26 Nuno Freitas

Let $p$ be an odd prime number. We show that the modular isomorphism problem has a positive answer for finite $p$-groups whose center has index $p^3$, which is a strong contrast to the analogous situation for $p = 2$.

Representation Theory · Mathematics 2023-11-14 Sofia Brenner , Diego García-Lucas

In this work, we consider the rational points on elliptic curves over finite fields F_{p}. We give results concerning the number of points on the elliptic curve y^2{\equiv}x^3+a^3(mod p)where p is a prime congruent to 1 modulo 6. Also some…

Number Theory · Mathematics 2011-06-28 Musa Demirci , Gokhan Soydan , Ismail Naci Cangul

Let $p\equiv 2,5\mod 9$ be an odd prime. In this paper, we prove that at least one of $3p$ and $3p^2$ is a cube sum by constructing certain nontrivial Heegner points. We also establish the explicit Gross-Zagier formulae for these Heegner…

Number Theory · Mathematics 2018-04-11 Jie Shu , Xu Song , Hongbo Yin

Let $\{A'_n\}$ be the Ap\'ery numbers given by $A'_n=\sum_{k=0}^n\binom nk^2\binom{n+k}k.$ For any prime $p\equiv 3\pmod 4$ we show that $A'_{\frac{p-1}2}\equiv \frac{p^2}3\binom{\frac{p-3}2}{\frac{p-3}4}^{-2}\pmod {p^3}$. Let $\{t_n\}$ be…

Number Theory · Mathematics 2024-10-16 Zhi-Hong Sun

In this work, we prove the following result(Theorem 1): Suppose that n is a positive integer, p an odd prime, and such that either n is congruent to 0 modulo4 and p congruent to 3 modulo8; or alternatively, n is congruent to 2 modulo4 and p…

Number Theory · Mathematics 2009-05-21 Konstantine Zelator

In this paper we prove that equations of the form $x^{13} + y^{13} = Cz^{p}$ have no non-trivial primitive solutions (a,b,c) such that $13 \nmid c$ if $p > 4992539$ for an infinite family of values for $C$. Our method consists in relating a…

Number Theory · Mathematics 2012-01-31 Luis Dieulefait , Nuno Freitas

Let $p_{k,3}(n)$ enumerate the number of 2-color partition triples of $n$ where one of the colors appears only in parts that are multiples of $k$. In this paper, we prove several infinite families of congruences modulo powers of 3 for…

Combinatorics · Mathematics 2018-05-24 Dazhao Tang

A recent article of Berndt and Yee found congruences modulo 3^k for certain ratios of Eisenstein series. For all but one of these, we show there are no simple congruences a(pn+c) = 0 modulo p when p>= 13 is prime. This follows from a more…

Number Theory · Mathematics 2009-10-02 Michael Dewar

We show that for $5/6$-th of all primes $p$, Hilbert's 10-th Problem is unsolvable for $\mathbb{Q}(\zeta_3, \sqrt[3]{p})$. We also show that there is an infinite set $S$ of square free integers such tha Hilbert's 10-th Problem is unsolvable…

Number Theory · Mathematics 2025-02-20 Somnath Jha , Debanjana Kundu , Dipramit Majumdar

Let f in Z[x,y] be a reducible homoegeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

Number Theory · Mathematics 2007-05-23 H. A. Helfgott

Let $p$ be an odd prime and let $d\in\{2,3,7\}$. When $(\frac{-d}p)=1$ we can write $p=x^2+dy^2$ with $x,y\in\mathbb Z$; in this paper we aim at determining $x$ or $y$ modulo $p^2$. For example, when $p=x^2+3y^2$, we show that if $p\equiv…

Number Theory · Mathematics 2015-06-09 Zhi-Wei Sun

In the paper, we establish a new estimate for Kloosterman sum over primes with respect to an arbitrary modulus $q$. This estimate together with some recent results of the second author are applied to the problem of solvability of the…

Number Theory · Mathematics 2019-12-09 M. E. Changa , M. A. Korolev