English
Related papers

Related papers: Counting primitive integral solutions to spherical…

200 papers

Let $p>3$ be a prime. Euler numbers $E_{p-3}$ first appeared in H. S. Vandiver's work (1940) in connection with the first case of Fermat Last Theorem. Vandiver proved that $x^p+y^p=z^p$ has no solution for integers $x,y,z$ with…

Number Theory · Mathematics 2018-04-10 Romeo Mestrovic

This note proves two theorems regarding Fermat-type equation $x^r + y^r = dz^p$ where $r \geq 5$ is a prime. Our main result shows that, for infinitely many integers~$d$, the previous equation has no non-trivial primitive solutions such…

Number Theory · Mathematics 2023-06-13 Nuno Freitas , Filip Najman

An integer is said to be $y$-friable if its greatest prime factor is less than $y$. In this paper, we obtain estimates for exponential sums over $y$-friable numbers up to $x$ which are non-trivial when $y \geq \exp\{c \sqrt{\log x} \log…

Number Theory · Mathematics 2019-08-15 Sary Drappeau

Let $c$ be a square-free positive integer and $p$ a prime satisfying $p\nmid c$. Let $h(-c)$ denote the class number of the imaginary quadratic field $\mathbb{Q}(\sqrt{-c})$. In this paper, we consider the Diophantine equation…

Number Theory · Mathematics 2021-02-17 Kalyan Chakraborty , Azizul Hoque , Kotyada Srinivas

Let $f(x,y)=ax^2+bxy+cy^2$ be a binary quadratic form with integer coefficients. For a prime $p$ not dividing the discriminant of $f$, we say $f$ is completely $p$-primitive if for any non-zero integer $N$, the diophantine equation…

Number Theory · Mathematics 2017-09-08 Byeong-Kweon Oh , Hoseog Yu

We define a primitive index of an integer in a sequence to be the index of the term with the integer as a primitive divisor. For the sequences $k^u+h^u$ and $k^u-h^u$, we discern a formula to find the primitive indexes of any composite…

Number Theory · Mathematics 2018-10-30 Tejas Rao

Approximations to the integral $\int_a^b\int_c^d f(x,y)\,dy\,dx$ are obtained under the assumption that the partial derivatives of the integrand are in an $L^p$ space, for some $1\leq p\leq\infty$. We assume ${\lVert f_{xy}\rVert}_p$ is…

Numerical Analysis · Mathematics 2019-05-16 Cameron Grant , Erik Talvila

For every $n \geq 2$ we determine the asymptotic formula for the number of integer triples $(a,b,c)$ of bounded absolute value such that the generalised Fermat equation given by $ax^n+by^n+cz^n=0$ is everywhere locally soluble. We compute…

Number Theory · Mathematics 2025-01-30 Peter Koymans , Ross Paterson , Tim Santens , Alec Shute

A set of integers greater than 1 is primitive if no member in the set divides another. Erd\H{o}s proved in 1935 that the series $f(A) = \sum_{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets $A$. In 1986 he asked…

Number Theory · Mathematics 2024-12-30 Jared Duker Lichtman

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

Number Theory · Mathematics 2016-04-25 Michele Elia , Federico Pintore

For $q=3^r$ ($r>0$), denote by $\mathbb{F}_q$ the finite field of order $q$ and for a positive integer $m\geq2$, let $\mathbb{F}_{q^m}$ be its extension field of degree $m$. We establish a sufficient condition for existence of a primitive…

Number Theory · Mathematics 2020-01-22 Himangshu Hazarika , Dhiren Kumar Basnet , Stephen D Cohen

Let $x\geq 1$ be a large number, and let $1 \leq a <q $ be integers such that $\gcd(a,q)=1$ and $q=O(\log^c)$ with $c>0$ constant. This note proves that the counting function for the number of primes $p \in \{p=qn+a: n \geq1 \}$ with a…

General Mathematics · Mathematics 2025-09-30 N. A. Carella

Let $A$ be a sufficiently dense subset of a finite field $\mathbb F_q$ or a finite, cyclic ring $\mathbb Z/ N\mathbb Z$. Assuming that $q$ and $N$ have no small prime divisors, we show that generalised Fermat equations have the expected…

Number Theory · Mathematics 2026-01-05 Sam Chow , Zi Li Lim , Akshat Mudgal

In this paper, we mainly discuss a priori bounds of the following degenerate elliptic equation, {equation}\label{000} a^{ij}(x)\partial_{ij}u+b^i(x)\partial_i u +f(x,u)=0,\text{in}\Omega\subset\subset R^n, {equation} where $a^{ij}\partial_i…

Analysis of PDEs · Mathematics 2012-11-20 Genggeng Huang

We solve the Fermat-type equation \[ x^{13} + y^{13} = 3 z^7, \qquad \gcd(x,y,z) = 1 \] combining a unit sieve, the multi-Frey modular method, level raising, computations of systems of eigenvalues modulo 7 over a totally real field, and…

Number Theory · Mathematics 2025-10-16 Nicolas Billerey , Imin Chen , Lassina Dembélé , Luis Dieulefait , Nuno Freitas

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

With a simple transformation of the three exponents the generalized Fermat equation can be put into the same form as the Fermat equation. When it is rewritten into this new altered form any real solutions to the altered equation equal a…

Number Theory · Mathematics 2011-05-25 Robert J. Betts

An integral is defined on the plane that includes the Henstock--Kurzweil and Lebesgue integrals (with respect to Lebesgue measure). A space of primitives is taken as the set of continuous real-valued functions $F(x,y)$ defined on the…

Classical Analysis and ODEs · Mathematics 2020-04-30 Erik Talvila

Descent theory (a modern formulation of Fermat's classical method of infinite descent) is a powerful tool in arithmetic geometry. In this article, we reinterpret descent theory through the lens of quotient stacks and apply it in the setting…

Number Theory · Mathematics 2025-08-19 Santiago Arango-Piñeros

A set of integers is primitive if no number in the set divides another. We introduce a new method for bounding Erd\H{o}s sums of primitive sets, suggested from output of GPT-5.4 Pro, based on Markov chains with von Mangoldt weights. The…