ترغب بنشر مسار تعليمي؟ اضغط هنا

Exceptional characters and prime numbers in sparse sets

111   0   0.0 ( 0 )
 نشر من قبل Jori Merikoski
 تاريخ النشر 2021
  مجال البحث
والبحث باللغة English
 تأليف Jori Merikoski




اسأل ChatGPT حول البحث

We develop a lower bound sieve for primes under the (unlikely) assumption of infinitely many exceptional characters. Compared with the illusory sieve due to Friedlander and Iwaniec which produces asymptotic formulas, we show that less arithmetic information is required to prove non-trivial lower bounds. As an application of our method, assuming the existence of infinitely many exceptional characters we show that there are infinitely many primes of the form $a^2+b^8$.



قيم البحث

اقرأ أيضاً

118 - Yubin He , Ying Xiong 2021
For a nonincreasing function $psi$, let $textrm{Exact}(psi)$ be the set of complex numbers that are approximable by complex rational numbers to order $psi$ but to no better order. In this paper, we obtain the Hausdorff dimension and packing dimension of $textrm{Exact}(psi)$ when $psi(x)=o(x^{-2})$. We also prove that the lower bound of the Hausdorff dimension is greater than $2-tau/(1-2tau)$ when $tau=limsup_{xtoinfty}psi(x)x^2$ small enough.
148 - Pratik Rathore 2018
We call an odd positive integer $n$ a $textit{Descartes number}$ if there exist positive integers $k,m$ such that $n = km$ and begin{equation} sigma(k)(m+1) = 2km end{equation} Currently, $mathcal{D} = 3^{2}7^{2}11^{2}13^{2}22021$ is the only kno wn Descartes number. In $2008$, Banks et al. proved that $mathcal{D}$ is the only cube-free Descartes number with fewer than seven distinct prime factors. In the present paper, we extend the methods of Banks et al. to show that there is no cube-free Descartes number with seven distinct prime factors.
In this paper, we consider how to express an Iwahori--Whittaker function through Demazure characters. Under some interesting combinatorial conditions, we obtain an explicit formula and thereby a generalization of the Casselman--Shalika formula. Under the same conditions, we compute the transition matrix between two natural bases for the space of Iwahori fixed vectors of an induced representation of a p-adic group; this generalizes a result of Bump--Nakasuji.
134 - Matthias Schmitt 2014
We prove an isomorphism between the finite domain from 1 up to the product of the first n primes and the new defined set of prime modular numbers. This definition provides some insights about relative prime numbers. We provide an inverse function fro m the prime modular numbers into this finite domain. With this function we can calculate all numbers from 1 up to the product of the first n primes that are not divisible by the first n primes. This function provides a non sequential way for the calculation of prime numbers.
Generalizing the concept of a perfect number is a Zumkeller or integer perfect number that was introduced by Zumkeller in 2003. The positive integer $n$ is a Zumkeller number if its divisors can be partitioned into two sets with the same sum, which w ill be $sigma(n)/2$. Generalizing even further, we call $n$ a $k$-layered number if its divisors can be partitioned into $k$ sets with equal sum. In this paper, we completely characterize Zumkeller numbers with two distinct prime factors and give some bounds for prime factorization in case of Zumkeller numbers with more than two distinct prime factors. We also characterize $k$-layered numbers with two distinct prime factors and even $k$-layered numbers with more than two distinct odd prime factors. Some other results concerning these numbers and their relationship with practical numbers and Harmonic mean numbers are also discussed.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا