Results 21 to 30 of about 166,083,503 (302)
Some Density Results on Sets of Primes for Hecke Eigenvalues
Journal of Mathematics, 2021 Let f and g be two distinct holomorphic cusp forms for SL2ℤ, and we writeλfn and λgn for their corresponding Hecke eigenvalues. Firstly, we study the behavior of the signs of the sequences λfpλfpj for any even positive integer j.
Aiyue Zou, Huixue Lao, Shu Luo
doaj +1 more source
, 2021 In this paper, the estimation formula of the number of primes in a given interval is obtained by using the prime distribution property. For any prime pairs $p>5$ and $ q>5 $, construct a disjoint infinite set sequence $A_1, A_2, \ldots, A_i. \ldots $, such that the number of prime pairs ($p_i$ and $q_i $, $p_i-q_i = p-q $) in $A_i $ increases ...
Zhao, Yong, Zhou, Jianqin
openaire +2 more sources
A problem related to twin primes [PDF]
, 2008 Using the elementary methods to study a problem related to twin ...
Li, Jianghua
core +1 more source
The Distribution of Prime Numbers
, 2022 In this paper, we discovered a new sequence of all prime numbers which end with a 1 or 9, the sequence defined by 𝑎(𝑛) = (𝑛^2 − 𝑛 − 1)/gcd (𝑏(𝑛), 𝑛^2 − 𝑛 − 1), with 𝑏(𝑛) satisfying the recurcive formula 𝑏(𝑛)=(𝑛 − 1). 𝑏(𝑛 − 1) − 𝑛. 𝑏(𝑛 − 2) and 𝑏(1) = 𝑏(2) = −1, the sequence 𝑎(𝑛) takes only 1’s and primes.
openaire +1 more source
About twin primes and distribution of primes [PDF]
, 2010 This paper give us a demonstration of twin primes conjecture using approximation of function (iupsilon) that we introduce in section 6. Section 1-5 give us introduction to terminology and a clarification on (iupsilon) terms.
Di Pietro, Gabriele
core +1 more source
Flat primes and thin primes [PDF]
, 2010 A number is called upper (lower) flat if its shift by +1 ( −1) is a power of 2 times a squarefree number. If the squarefree number is 1 or a single odd prime then the original number is called upper (lower) thin. Upper flat numbers which are primes arise
Broughan, Kevin A., Zhou, Qizhi
core +1 more source
Isolated elliptic curves and the MOV attack
Journal of Mathematical Cryptology, 2017 We present a variation on the CM method that produces elliptic curves over prime fields with nearly prime order that do not admit many efficiently computable isogenies. Assuming the Bateman–Horn conjecture, we prove that elliptic curves produced this way
Scholl Travis
doaj +1 more source
Ratio Mathematica, 2019 Within the conceptual framework of number theory, we consider prime numbers and the classic still unsolved problem to find a complete law of their distribution.
Gianfranco Minati
doaj +1 more source
On the distribution of Hawkins’ random “primes” [PDF]
Journal de théorie des nombres de Bordeaux, 2009 Hawkins introduced a probabilistic version of Erathosthenes’ sieve and studied the associated sequence of random “primes” ( p k
openaire +3 more sources
Algebraic divisibility sequences over function fields [PDF]
, 2011 In this note we study the existence of primes and of primitive divisors in function field analogues of classical divisibility sequences. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields ...
Mahe, Valery +14 more
core +2 more sources