Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThere are no Cube-free Descartes Numbers with Exactly Seven Distinct Prime Factors
149
0
0.0
(
0
)
Authors
Pratik Rathore
Ask ChatGPT about the research
No Arabic abstract
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 known 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.
rate research
Read More
There are two puzzles surrounding the Pleiades, or Seven Sisters. First, why are the mythological stories surrounding them, typically involving seven young girls being chased by a man associated with the constellation Orion, so similar in vastly separated cultures, such as the Australian Aboriginal cultures and Greek mythology? Second, why do most cultures call them Seven Sisters even though most people with good eyesight see only six stars? Here we show that both these puzzles may be explained by a combination of the great antiquity of the stories combined with the proper motion of the stars, and that these stories may predate the departure of most modern humans out of Africa around 100,000 BC.
Dirichlets proof of infinitely many primes in arithmetic progressions was published in 1837, introduced L-series for the first time, and it is said to have started rigorous analytic number theory. Dirichlet uses Eulers earlier work on the zeta function and the distribution of primes. He first proves a simpler case before going to full generality. The paper was translated from German by R. Stephan and given a reference section.
It is an open problem to provide a characterization of quasiconformally homogeneous Riemann surfaces. We show that given the current literature, this problem can be broken into four open cases with respect to the topology of the underlying surface. The main result is a characterization in one of the these open cases; in particular, we prove that every quasiconformally homogeneous ladder surface is quasiconformally equivalent to a regular cover of a closed surface (or, in other words, there are no exotic ladder surfaces).
We discuss $Q(n)$, the number of ways a given integer $n$ may be written as a sum of distinct primes, and study its asymptotic form $Q_{as}(n)$ valid in the limit $ntoinfty$. We obtain $Q_{as}(n)$ by Laplace inverting the fermionic partition function of primes, in number theory called the generating function of the distinct prime partitions, in the saddle-point approximation. We find that our result of $Q_{as}(n)$, which includes two higher-order corrections to the leading term in its exponent and a pre-exponential correction factor, approximates the exact $Q(n)$ far better than its simple leading-order exponential form given so far in the literature.
We show that for all large enough $x$ the interval $[x,x+x^{1/2}log^{1.39}x]$ contains numbers with a prime factor $p > x^{18/19}.$ Our work builds on the previous works of Heath-Brown and Jia (1998) and Jia and Liu (2000) concerning the same problem for the longer intervals $[x,x+x^{1/2+epsilon}].$ We also incorporate some ideas from Harmans book `Prime-detecting sieves (2007). The main new ingredient that we use is the iterative argument of Matomaki and Radziwi{l}{l}(2016) for bounding Dirichlet polynomial mean values, which is applied to obtain Type II information. This allows us to take shorter intervals than in the above-mentioned previous works. We have also had to develop ideas to avoid losing any powers of $log x$ when applying Harmans sieve method.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
