اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدImproved Bounds on the Sizes of S.P Numbers
148
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A number which is S.P in base r is a positive integer which is equal to the sum of its base-r digits multiplied by the product of its base-r digits. These numbers have been studied extensively in The Mathematical Gazette. Recently, Shah Ali obtained the first effective bound on the sizes of S.P numbers. Modifying Shah Alis method, we obtain an improved bound on the number of digits in a base-r S.P number. Our bound is the first sharp bound found for the case r=2.
قيم البحث
اقرأ أيضاً
An $m$-general set in $AG(n,q)$ is a set of points such that any subset of size $m$ is in general position. A $3$-general set is often called a capset. In this paper, we study the maximum size of an $m$-general set in $AG(n,q)$, significantly improvi
ng previous results. When $m=4$ and $q=2$ we give a precise estimate, solving a problem raised by Bennett.
This is an English translation of the Latin original De summa seriei ex numeris primis formatae ${1/3}-{1/5}+{1/7}+{1/11}-{1/13}-{1/17}+{1/19}+{1/23}-{1/29}+{1/31}-$ etc. ubi numeri primi formae $4n-1$ habent signum positivum formae autem $4n+1$ sign
um negativum (1775). E596 in the Enestrom index. Let $chi$ be the nontrivial character modulo 4. Euler wants to know what $sum_p chi(p)/p$ is, either an exact expression or an approximation. He looks for analogies to the harmonic series and the series of reciprocals of the primes. Another reason he is interested in this is that if this series has a finite value (which is does, the best approximation Euler gets is 0.3349816 in section 27) then there are infinitely many primes congruent to 1 mod 4 and infinitely many primes congruent to 3 mod 4. In section 15 Euler gives the Euler product for the L(chi,1). As a modern mathematical appendix appendix, I have written a proof following Davenport that the series $sum_p frac{chi(p)}{p}$ converges. This involves applications of summation by parts, and uses Chebyshevs estimate for the second Chebyshev function (summing the von Mangoldt function).
Translated from the Latin original Novae demonstrationes circa resolutionem numerorum in quadrata (1774). E445 in the Enestrom index. See Chapter III, section XI of Weils Number theory: an approach through history. Also, a very clear proof of the fou
r squares theorem based on Eulers is Theorem 370 in Hardy and Wright, An introduction to the theory of numbers, fifth ed. It uses Theorem 87 in Hardy and Wright, but otherwise does not assume anything else from their book. I translated most of the paper and checked those details a few months ago, but only finished last few parts now. If anything isnt clear please email me.
This is a collection of definitions, notations and proofs for the Bernoulli numbers $B_n$ appearing in formulas for the sum of integer powers, some of which can be found scattered in the large related historical literature in French, English and Germ
an. We provide elementary proofs for the original convention with ${mathcal B}_1=1/2$ and also for the current convention with $B_1=-1/2$, using only the binomial theorem and the concise Blissard symbolic (umbral) notation.
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 functi
on 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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
