Prime numbers of the form p = m²+n²+1 in short intervals
Kaisa Matomäki (2007)
Acta Arithmetica
Similarity:
Kaisa Matomäki (2007)
Acta Arithmetica
Similarity:
Glyn Harman (1982)
Mathematische Zeitschrift
Similarity:
S. M. Gonek, G. S. Krishnaswami, V. L. Sondhi (2002)
Acta Arithmetica
Similarity:
Jean-Marie De Koninck, Jason Pierre Sweeney (2001)
Colloquium Mathematicae
Similarity:
The main objective of this paper is to analyze the unimodal character of the frequency function of the largest prime factor. To do that, let P(n) stand for the largest prime factor of n. Then define f(x,p): = #{n ≤ x | P(n) = p}. If f(x,p) is considered as a function of p, for 2 ≤ p ≤ x, the primes in the interval [2,x] belong to three intervals I₁(x) = [2,v(x)], I₂(x) = ]v(x),w(x)[ and I₃(x) = [w(x),x], with v(x) < w(x), such that f(x,p) increases for p ∈ I₁(x), reaches its maximum...
Yong-Gao Chen (2012)
Acta Arithmetica
Similarity:
Christian Elsholtz (2003)
Acta Arithmetica
Similarity:
Yuan Wang (1978-1979)
Séminaire Delange-Pisot-Poitou. Théorie des nombres
Similarity:
Douglas Hensley, Ian Richards (1974)
Acta Arithmetica
Similarity:
Yingchun Cai (2002)
Acta Arithmetica
Similarity:
D.R. Heath-Brown (1988)
Journal für die reine und angewandte Mathematik
Similarity:
Chaumont, Alain, Müller, Tom (2006)
Journal of Integer Sequences [electronic only]
Similarity:
Jerzy Browkin, Hui-Qin Cao (2014)
Colloquium Mathematicae
Similarity:
We discuss some cancellation algorithms such that the first non-cancelled number is a prime number p or a number of some specific type. We investigate which numbers in the interval (p,2p) are non-cancelled.
Müller, Tom (2006)
Experimental Mathematics
Similarity:
Carl Pomerance, Paul Erdös (1978)
Aequationes mathematicae
Similarity:
Nyman, Bertil, Nicely, Thomas R. (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Florian Luca, Paul Pollack (2012)
Acta Arithmetica
Similarity:
Jörg Brüdern, Koichi Kawada (2011)
Colloquium Mathematicae
Similarity:
A new method for counting primes in a Beatty sequence is proposed, and it is shown that an asymptotic formula can be obtained for the number of such primes in a short interval.