DOCSLIB.ORG

Higher Order Bernoulli and Euler Numbers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

David Vella, Skidmore College [email protected] Generating Functions and Exponential Generating Functions • Given a sequence {푎푛} we can associate to it two functions determined by power series: • Its (ordinary) generating function is ∞ 풏 푓 풙 = 풂풏풙 풏=ퟏ • Its exponential generating function is ∞ 풂 품 풙 = 풏 풙풏 풏! 풏=ퟏ Examples • The o.g.f and the e.g.f of {1,1,1,1,...} are: 1 • f(x) = 1 + 푥 + 푥2 + 푥3 + ⋯ = , and 1−푥 푥 푥2 푥3 • g(x) = 1 + + + + ⋯ = 푒푥, respectively. 1! 2! 3! The second one explains the name... Operations on the functions correspond to manipulations on the sequence. For example, adding two sequences corresponds to adding the ogf’s, while to shift the index of a sequence, we multiply the ogf by x, or differentiate the egf. Thus, the functions provide a convenient way of studying the sequences. Here are a few more famous examples: Bernoulli & Euler Numbers • The Bernoulli Numbers Bn are defined by the following egf: x Bn n x x e 1 n1 n! • The Euler Numbers En are defined by the following egf: x 2e En n Sech(x) 2x x e 1 n0 n! Catalan and Bell Numbers • The Catalan Numbers Cn are known to have the ogf: ∞ 푛 1 − 1 − 4푥 2 퐶 푥 = 퐶푛푥 = = 2푥 1 + 1 − 4푥 푛=1 • Let Sn denote the number of different ways of partitioning a set with n elements into nonempty subsets. It is called a Bell number. It is known to have the egf: ∞ 푆 푥 푛 푥푛 = 푒 푒 −1 푛! 푛=1 Higher Order Bernoulli and Euler Numbers th w • The n Bernoulli Number of order w, B n is defined for positive integer w by: w x B w n xn x e 1 n1 n! th w • The n Euler Number of order w, E n is similarly defined for positive integer w as: 푤 ∞ 2푒푥 퐸푤 = 푛 푥푛 푒2푥 + 1 푛! 푛=1 Reversing the Process • If you start with a function and ask what sequence generates it (as an ogf), the answer is given by Taylor’s theorem: 푓 푛 (0) 푐 = 푛 푛! • More generally, if we use powers of (x-a) in place of powers of x, Taylor’s theorem gives: 푓 푛 (푎) 푐 = 푛 푛! • Let us abbreviate the n’th Taylor coefficient of f about x = a by: 푓 푛 (푎) 푇 푓; 푎 = 푛 푛! A Key Question • I have mentioned that operations on the functions correspond to manipulations of the sequence. What manipulations correspond to composing the generating functions? • That is, we are asking to express 푇푛 푓 ⃘푔; 푎 in terms of the Taylor coefficients of f and of g. • In January, 2008, I published a paper entitled Explicit Formulas for Bernoulli and Euler Numbers, in the electronic journal Integers. In this paper, I answer the above question and give some applications of the answer. A Key Answer • Since 푓 ⃘푔 (푛)(푎) 푇 푓 ⃘푔; 푎 = , 푛 푛! the answer would depend on evaluating the numerator, which means extending the chain rule to nth derivatives. This was done (and published by Faà di Bruno in 1855.) I noticed (in 1994) a corollary of di Bruno’s formula which exactly answers the above question. • Francesco Faà di Bruno: THE MAIN RESULT With the above definitions, if both 푦 = 푓(푥) and 푥 = 푔(푡) have n derivatives, then so does 푦 = 푓 ⃘ 푔(푡), and 푛 풍 흅 푻 풇 ⃘품; 풂 = 푇 (푓; 푔 푎 ) 푇 (푔; 푎) 휋푖 풏 휹 흅 푙 휋 푖 흅∈푷풏 푖=1 where 푃푛 is the set of partitions of n, 푙 휋 is the length of the partition 휋, and 휋푖 is the multiplicity of i as a part of 휋. Here, 훿 휋 is the set of multiplicities {휋푖} which is itself a partition of 푙 휋 (I call it the derived partition ), and 푙 휋 is the associated 훿 휋 훿 휋 푙 휋 ! multinomial coefficient . 휋1!휋2!…휋푛! Illustration – How to use this machine • Let 푓 푥 = 푒푥 and let 푥 = 푔 푡 = 푒푡 − 1 Set 푎 = 0 and observe 푔 푎 = 0. Then: 1 푇 푓; 푔 0 = for all m and similarly, 푚 푚! 1 푇 푔; 0 = if 푖 ≥ 1. The right side becomes: 푖 푖! 푛 휋 푛! 푙 휋 1 1 푖 푛! 훿 휋 푙(휋)! 푖! 휋∈푃푛 푖=1 1 1 푛! 1 푆 = 푆 = 푛 푛! 훿 휋 ! 휋! 푛! 휋 푛! 휋∈푃푛 휋∈푃푛 Illustrations, continued • But the left hand side is 푇푛 푓 ⃘푔; 0 for the composite function 푡 푓 ⃘푔(푡) = 푒 푒 −1 So we just proved this is the egf for the sequence of Bell numbers 푆푛. This is a very short proof of a known (and famous) result. Likewise, I can provide new proofs of many combinatorial identities using this technique. Can we discover new results with this machine? Yes! Illustrations, continued ln(1+푥) Let 푓 푥 = and 푔 푡 = 푒푡 − 1. Again if 푎 = 0 then 푥 푡 푔 푎 = 푔 0 = 0. Also we have 푓 ⃘푔 푡 = which is 푒푡−1 precisely the egf of the Bernoulli numbers. In this case, our machine yields the formulas: ( ) (1 ) ( ) n Bn and: Pn 1 ( ) ( ) n (1)m Bn m !S(n, m) m1 1 m where S(n,m) is the number of ways of partitioning a set of size n into m nonempty subsets (a Stirling number of the 2nd kind.) Illustrations, continued • This was published in my 2008 paper, along with similar formulas for Euler numbers. • These formulas can be generalized in at least two ways: 1. Express the higher order Bernoulli numbers in terms of the usual Bernoulli numbers, since the egf for them is obviously a composite. Similarly for the higher order Euler numbers. This result is still unpublished (but I spoke at HRUMC a couple of years ago about it.) 2. Generalize my corollary of di Bruno’s formula to the multivariable case. (The next talk is about this in the case of multivariable Bernoulli numbers!) • For the remainder of this talk, I’d like to focus on one case where the identity I obtain from my machine is not obviously useful (or is it?) Final Example: the Catalan numbers • Recall from an earlier slide the generating function (ogf) of the Catalan numbers: ∞ 푛 1 − 1 − 4푥 2 퐶 푥 = 퐶푛푥 = = 2푥 1 + 1 − 4푥 푛=1 • This can be expressed as a composite generating function as 2 follows: Let 푓 푢 = and let 푢 = 푔 푥 = 1 − 4푥. Then 1+푢 퐶 푥 = 푓 푔 푥 . If 푎 = 0 then 푔 푎 = 1, so the derivatives and Taylor coefficients of 푓 푢 have to be evaluated at 푢 = 1. (−1)푚푚! • It is easy to check by direct calculation that 푓 푚 1 = 2푚 푓 푚 1 (−1)푚 and therefore 푇 푓; 1 = = . 푚 푚! 2푚 Catalan numbers, continued • To find 푇푖(푔; 0), we write the radical as a power and use Newton’s binomial series: 1 ∞ 1 푘 푘 2 2 푔 푥 = 1 − 4푥 = 푘=0 푘 −4 푥 . 1 2 푖 It follows that 푇푖 푔; 0 = 푖 −4 . So our formula yields: 휋푖 푛 푙 휋 −1 푙(휋) 1 퐶 = 2 −4 푖 푛 훿 휋 2푙(휋) 푖 휋∈푃푛 푖=1 However, we can simplify this because 푛 휋 푖 푖 푖휋 푛 −4 = −4 푖 = −4 푖=1 Simplifications Thus, 푛 휋푖 푙 휋 −1 푛+푙(휋) 1 퐶 = 4푛 2 푛 훿 휋 2푙(휋) 푖 휋∈푃푛 푖=1 Next, we rewrite the terms 휋푖 휋푖 1 1 1 1 1 − 1 − 2 … − 푖 + 1 2 = 2 2 2 2 푖 푖! When we take the product of these terms over i, the 푛 휋푖 denominator becomes 푖=1 푖! , the product of the factorials of all the parts of 휋, which I abbreviate as 휋!. Observe that 1 푛 = 푛! 휋! 휋 Looking more carefully at the numerator, we obtain: Simplifications, continued 휋 휋 1 1 1 1 푖 1 1 3 2푖 − 3 푖 − 1 − 2 … − 푖 + 1 = − − … − 2 2 2 2 2 2 2 2 휋 We can factor out a power of 2 in the denominator, namely 2푖 푖 = 2푖휋푖, and since every factor except the first is negative, we can also factor out a 휋 power of -1, namely (−1)푖−1 푖 = −1 푖휋푖−휋푖. Now when we take the product over i, this means we factor out the following: in the denominator, 2푖휋푖 = 2 푖휋푖 = 2푛 (which cancels part of the 4푛 outside the sum), and in the numerator, (−1)푖휋푖−휋푖 = (−1) 푖휋푖− 휋푖= (−1)푛−푙(휋). Combined with the (−1)푛+푙(휋) term in front of the product, this becomes (−1)2푛= 1. In other words, all the negatives cancel out! Finally, what remains in the square brackets is a product of odd integers, which we abbreviate with the double factorial notation (with the convention that (-1)!! = 1). The entire thing simplifies to: New formula for the Catalan numbers! • We have proved: 푛 푛 2 푛 푙 휋 1 휋 퐶 = 2푖 − 3 ‼ 푖 푛 푛! 휋 훿 휋 2푙(휋) 휋∈푃푛 푖=1 Let’s illustrate this with n = 4. We need the table: 흅 흅ퟏ 흅ퟐ 흅ퟑ 흅ퟒ 풍(흅) 휹(흅) [4] 0 0 0 1 1 [1] [3,1] 1 0 1 0 2 [12] [22] 0 2 0 0 2 [2] [2, 12] 2 1 0 0 3 [2,1] 14 4 0 0 0 4 [4] Catalan example (n = 4) • Our formula becomes: 4 4 2 4 푙 휋 1 휋 퐶 = 2푖 − 3 ‼ 푖 4 4! 휋 훿 휋 2푙(휋) 휋∈푃4 푖=1 16 4 1 1 4 2 1 4 2 1 = (5‼)1 + (3‼)1 + (1‼)2 24 4 1 2 3 1 1 1 22 2 2 2 22 16 4 3 1 4 4 1 + (1‼)1 + ((−1)‼)4 24 2 1 1 2 1 23 1 1 1 1 4 24 16 1 1 1 = 1 ∙ 1 ∙ ∙ 5 ∙ 3 ∙ 1 + 4 ⋅ 2 ⋅ ⋅ 3 ⋅ 1 + 6 ⋅ 1 ⋅ ⋅ 12 24 2 4 4 16 1 1 + 12 ∙ 3 ∙ ⋅ 1 + 24 ⋅ 1 ⋅ ⋅ 1 24 8 16 Catalan example (n = 4) = 5 + 4 + 1 + 3 + 1 = 14 This is the correct value as 1 퐶 = 8 = 14 4 5 4 Of course it appears as if my formula is kind of useless since it is so inefficient! Or maybe not....
Recommended publications
  • Generalizations of Euler Numbers and Polynomials 1

    Generalizations of Euler Numbers and Polynomials 1

    GENERALIZATIONS OF EULER NUMBERS AND POLYNOMIALS QIU-MING LUO AND FENG QI Abstract. In this paper, the concepts of Euler numbers and Euler polyno- mials are generalized, and some basic properties are investigated. 1. Introduction It is well-known that the Euler numbers and polynomials can be defined by the following definitions. Definition 1.1 ([1]). The Euler numbers Ek are defined by the following expansion t ∞ 2e X Ek = tk, |t| ≤ π. (1.1) e2t + 1 k! k=0 In [4, p. 5], the Euler numbers is defined by t/2 ∞ n 2n 2e t X (−1) En t = sech = , |t| ≤ π. (1.2) et + 1 2 (2n)! 2 n=0 Definition 1.2 ([1, 4]). The Euler polynomials Ek(x) for x ∈ R are defined by xt ∞ 2e X Ek(x) = tk, |t| ≤ π. (1.3) et + 1 k! k=0 It can also be shown that the polynomials Ei(t), i ∈ N, are uniquely determined by the following two properties 0 Ei(t) = iEi−1(t),E0(t) = 1; (1.4) i Ei(t + 1) + Ei(t) = 2t . (1.5) 2000 Mathematics Subject Classification. 11B68. Key words and phrases. Euler numbers, Euler polynomials, generalization. The authors were supported in part by NNSF (#10001016) of China, SF for the Prominent Youth of Henan Province, SF of Henan Innovation Talents at Universities, NSF of Henan Province (#004051800), Doctor Fund of Jiaozuo Institute of Technology, China. This paper was typeset using AMS-LATEX. 1 2 Q.-M. LUO AND F. QI Euler polynomials are related to the Bernoulli numbers. For information about Bernoulli numbers and polynomials, please refer to [1, 2, 3, 4].
  • An Identity for Generalized Bernoulli Polynomials

    An Identity for Generalized Bernoulli Polynomials

    1 2 Journal of Integer Sequences, Vol. 23 (2020), 3 Article 20.11.2 47 6 23 11 An Identity for Generalized Bernoulli Polynomials Redha Chellal1 and Farid Bencherif LA3C, Faculty of Mathematics USTHB Algiers Algeria [email protected] [email protected] [email protected] Mohamed Mehbali Centre for Research Informed Teaching London South Bank University London United Kingdom [email protected] Abstract Recognizing the great importance of Bernoulli numbers and Bernoulli polynomials in various branches of mathematics, the present paper develops two results dealing with these objects. The first one proposes an identity for the generalized Bernoulli poly- nomials, which leads to further generalizations for several relations involving classical Bernoulli numbers and Bernoulli polynomials. In particular, it generalizes a recent identity suggested by Gessel. The second result allows the deduction of similar identi- ties for Fibonacci, Lucas, and Chebyshev polynomials, as well as for generalized Euler polynomials, Genocchi polynomials, and generalized numbers of Stirling. 1Corresponding author. 1 1 Introduction Let N and C denote, respectively, the set of positive integers and the set of complex numbers. (α) In his book, Roman [41, p. 93] defined generalized Bernoulli polynomials Bn (x) as follows: for all n ∈ N and α ∈ C, we have ∞ tn t α B(α)(x) = etx. (1) n n! et − 1 Xn=0 The Bernoulli numbers Bn, classical Bernoulli polynomials Bn(x), and generalized Bernoulli (α) numbers Bn are, respectively, defined by (1) (α) (α) Bn = Bn(0), Bn(x)= Bn (x), and Bn = Bn (0). (2) The Bernoulli numbers and the Bernoulli polynomials play a fundamental role in various branches of mathematics, such as combinatorics, number theory, mathematical analysis, and topology.
  • Accessing Bernoulli-Numbers by Matrix-Operations Gottfried Helms 3'2006 Version 2.3

    Accessing Bernoulli-Numbers by Matrix-Operations Gottfried Helms 3'2006 Version 2.3

    Accessing Bernoulli-Numbers by Matrix-Operations Gottfried Helms 3'2006 Version 2.3 Accessing Bernoulli-Numbers by Matrixoperations ........................................................................ 2 1. Introduction....................................................................................................................................................................... 2 2. A common equation of recursion (containing a significant error)..................................................................................... 3 3. Two versions B m and B p of bernoulli-numbers? ............................................................................................................... 4 4. Computation of bernoulli-numbers by matrixinversion of (P-I) ....................................................................................... 6 5. J contains the eigenvalues, and G m resp. G p contain the eigenvectors of P z resp. P s ......................................................... 7 6. The Binomial-Matrix and the Matrixexponential.............................................................................................................. 8 7. Bernoulli-vectors and the Matrixexponential.................................................................................................................... 8 8. The structure of the remaining coefficients in the matrices G m - and G p........................................................................... 9 9. The original problem of Jacob Bernoulli: "Powersums" - from G
  • Sums of Powers and the Bernoulli Numbers Laura Elizabeth S

    Sums of Powers and the Bernoulli Numbers Laura Elizabeth S

    Eastern Illinois University The Keep Masters Theses Student Theses & Publications 1996 Sums of Powers and the Bernoulli Numbers Laura Elizabeth S. Coen Eastern Illinois University This research is a product of the graduate program in Mathematics and Computer Science at Eastern Illinois University. Find out more about the program. Recommended Citation Coen, Laura Elizabeth S., "Sums of Powers and the Bernoulli Numbers" (1996). Masters Theses. 1896. https://thekeep.eiu.edu/theses/1896 This is brought to you for free and open access by the Student Theses & Publications at The Keep. It has been accepted for inclusion in Masters Theses by an authorized administrator of The Keep. For more information, please contact [email protected]. THESIS REPRODUCTION CERTIFICATE TO: Graduate Degree Candidates (who have written formal theses) SUBJECT: Permission to Reproduce Theses The University Library is rece1v1ng a number of requests from other institutions asking permission to reproduce dissertations for inclusion in their library holdings. Although no copyright laws are involved, we feel that professional courtesy demands that permission be obtained from the author before we allow theses to be copied. PLEASE SIGN ONE OF THE FOLLOWING STATEMENTS: Booth Library of Eastern Illinois University has my permission to lend my thesis to a reputable college or university for the purpose of copying it for inclusion in that institution's library or research holdings. u Author uate I respectfully request Booth Library of Eastern Illinois University not allow my thesis
  • The Structure of Bernoulli Numbers

    The Structure of Bernoulli Numbers

    The structure of Bernoulli numbers Bernd C. Kellner Abstract We conjecture that the structure of Bernoulli numbers can be explicitly given in the closed form n 2 −1 −1 n−l −1 −1 Bn = (−1) |n|p |p (χ(p,l) − p−1 )|p p p,l ∈ irr p−1∤n ( ) Ψ1 p−1|n Y n≡l (modY p−1) Y irr where the χ(p,l) are zeros of certain p-adic zeta functions and Ψ1 is the set of irregular pairs. The more complicated but improbable case where the conjecture does not hold is also handled; we obtain an unconditional structural formula for Bernoulli numbers. Finally, applications are given which are related to classical results. Keywords: Bernoulli number, Kummer congruences, irregular prime, irregular pair of higher order, Riemann zeta function, p-adic zeta function Mathematics Subject Classification 2000: 11B68 1 Introduction The classical Bernoulli numbers Bn are defined by the power series ∞ z zn = B , |z| < 2π , ez − 1 n n! n=0 X where all numbers Bn are zero with odd index n > 1. The even-indexed rational 1 1 numbers Bn alternate in sign. First values are given by B0 = 1, B1 = − 2 , B2 = 6 , 1 arXiv:math/0411498v1 [math.NT] 22 Nov 2004 B4 = − 30 . Although the first numbers are small with |Bn| < 1 for n = 2, 4,..., 12, these numbers grow very rapidly with |Bn|→∞ for even n →∞. For now, let n be an even positive integer. An elementary property of Bernoulli numbers is the following discovered independently by T. Clausen [Cla40] and K.
  • Tight Bounds on the Mutual Coherence of Sensing Matrices for Wigner D-Functions on Regular Grids

    Tight Bounds on the Mutual Coherence of Sensing Matrices for Wigner D-Functions on Regular Grids

    Tight bounds on the mutual coherence of sensing matrices for Wigner D-functions on regular grids Arya Bangun, Arash Behboodi, and Rudolf Mathar,∗ October 7, 2020 Abstract Many practical sampling patterns for function approximation on the rotation group utilizes regu- lar samples on the parameter axes. In this paper, we relate the mutual coherence analysis for sensing matrices that correspond to a class of regular patterns to angular momentum analysis in quantum mechanics and provide simple lower bounds for it. The products of Wigner d-functions, which ap- pear in coherence analysis, arise in angular momentum analysis in quantum mechanics. We first represent the product as a linear combination of a single Wigner d-function and angular momentum coefficients, otherwise known as the Wigner 3j symbols. Using combinatorial identities, we show that under certain conditions on the bandwidth and number of samples, the inner product of the columns of the sensing matrix at zero orders, which is equal to the inner product of two Legendre polynomials, dominates the mutual coherence term and fixes a lower bound for it. In other words, for a class of regular sampling patterns, we provide a lower bound for the inner product of the columns of the sensing matrix that can be analytically computed. We verify numerically our theoretical results and show that the lower bound for the mutual coherence is larger than Welch bound. Besides, we provide algorithms that can achieve the lower bound for spherical harmonics. 1 Introduction In many applications, the goal is to recover a function defined on a group, say on the sphere S2 and the rotation group SO(3), from only a few samples [1{5].
  • Approximation Properties of G-Bernoulli Polynomials

    Approximation Properties of G-Bernoulli Polynomials

    Approximation properties of q-Bernoulli polynomials M. Momenzadeh and I. Y. Kakangi Near East University Lefkosa, TRNC, Mersiin 10, Turkey Email: [email protected] [email protected] July 10, 2018 Abstract We study the q−analogue of Euler-Maclaurin formula and by introducing a new q-operator we drive to this form. Moreover, approximation properties of q-Bernoulli polynomials is discussed. We estimate the suitable functions as a combination of truncated series of q-Bernoulli polynomials and the error is calculated. This paper can be helpful in two different branches, first solving differential equations by estimating functions and second we may apply these techniques for operator theory. 1 Introduction The present study has sough to investigate the approximation of suitable function f(x) as a linear com- bination of q−Bernoulli polynomials. This study by using q−operators through a parallel way has achived to the kind of Euler expansion for f(x), and expanded the function in terms of q−Bernoulli polynomials. This expansion offers a proper tool to solve q-difference equations or normal differential equation as well. There are many approaches to approximate the capable functions. According to properties of q-functions many q-function have been used in order to approximate a suitable function.For example, at [28], some identities and formulae for the q-Bernstein basis function, including the partition of unity property, formulae for representing the monomials were studied. In addition, a kind of approximation of a function in terms of Bernoulli polynomials are used in several approaches for solving differential equations, such as [7, 20, 21].
  • Euler-Maclaurin Summation Formula

    Euler-Maclaurin Summation Formula

    4 Euler-Maclaurin Summation Formula 4.1 Bernoulli Number & Bernoulli Polynomial 4.1.1 Definition of Bernoulli Number Bernoulli numbers Bk ()k =1,2,3, are defined as coefficients of the following equation. x Bk k x =Σ x e -1 k=0 k! 4.1.2 Expreesion of Bernoulli Numbers B B x 0 1 B2 2 B3 3 B4 4 = + x + x + x + x + (1,1) ex-1 0! 1! 2! 3! 4! ex-1 1 x x2 x3 x4 = + + + + + (1.2) x 1! 2! 3! 4! 5! Making the Cauchy product of (1.1) and (1.1) , B1 B0 B2 B1 B0 1 = B + + x + + + x2 + 0 1!1! 0!2! 2!1! 1!2! 0!3! In order to holds this for arbitrary x , B1 B0 B2 B1 B0 B =1 , + =0 , + + =0 , 0 1!1! 0!2! 2!1! 1!2! 0!3! n The coefficient of x is as follows. Bn Bn-1 Bn-2 B1 B0 + + + + + = 0 n!1! ()n -1 !2! ()n-2 !3! 1!n ! 0!()n +1 ! Multiplying both sides by ()n +1 ! , Bn()n +1 ! Bn-1()n+1 ! Bn-2()n +1 ! B1()n +1 ! B0 + + + + + = 0 n !1! ()n-1 !2! ()n -2 !3! 1!n ! 0! Using binomial coefficiets, n +1Ｃn Bn + n +1Ｃn-1 Bn-1 + n +1Ｃn-2 Bn-2 + + n +1Ｃ 1 B1 + n +1Ｃ 0 B0 = 0 Replacing n +1 with n , (1.3) nnＣ -1 Bn-1 + nnＣ -2 Bn-2 + nnＣ -3 Bn-3 + + nＣ1 B1 + nＣ0 B0 = 0 Substituting n =2, 3, 4, for this one by one, 1 21Ｃ B + 20Ｃ B = 0 B = - 1 0 2 2 1 32Ｃ B + 31Ｃ B + 30Ｃ B = 0 B = 2 1 0 2 6 Thus, we obtain Bernoulli numbers.
  • Handbook of Number Theory Ii

    Handbook of Number Theory Ii

    HANDBOOK OF NUMBER THEORY II by J. Sändor Babes-Bolyai University ofCluj Department of Mathematics and Computer Science Cluj-Napoca, Romania and B. Crstici formerly the Technical University of Timisoara Timisoara Romania KLUWER ACADEMIC PUBLISHERS DORDRECHT / BOSTON / LONDON Contents PREFACE 7 BASIC SYMBOLS 9 BASIC NOTATIONS 10 1 PERFECT NUMBERS: OLD AND NEW ISSUES; PERSPECTIVES 15 1.1 Introduction 15 1.2 Some historical facts 16 1.3 Even perfect numbers 20 1.4 Odd perfect numbers 23 1.5 Perfect, multiperfect and multiply perfect numbers 32 1.6 Quasiperfect, almost perfect, and pseudoperfect numbers 36 1.7 Superperfect and related numbers 38 1.8 Pseudoperfect, weird and harmonic numbers 42 1.9 Unitary, bi-unitary, infinitary-perfect and related numbers 45 1.10 Hyperperfect, exponentially perfect, integer-perfect and y-perfect numbers 50 1.11 Multiplicatively perfect numbers 55 1.12 Practical numbers 58 1.13 Amicable numbers 60 1.14 Sociable numbers 72 References 77 2 GENERALIZATIONS AND EXTENSIONS OF THE MÖBIUS FUNCTION 99 2.1 Introduction 99 1 CONTENTS 2.2 Möbius functions generated by arithmetical products (or convolutions) 106 1 Möbius functions defined by Dirichlet products 106 2 Unitary Möbius functions 110 3 Bi-unitary Möbius function 111 4 Möbius functions generated by regulär convolutions .... 112 5 K-convolutions and Möbius functions. B convolution . ... 114 6 Exponential Möbius functions 117 7 l.c.m.-product (von Sterneck-Lehmer) 119 8 Golomb-Guerin convolution and Möbius function 121 9 max-product (Lehmer-Buschman) 122 10 Infinitary
  • Mathstudio Manual

    Mathstudio Manual

    MathStudio Manual Abs(z) Returns the complex modulus (or magnitude) of a complex number. abs(-3) abs(-x) abs(\im) AiryAi(z) Returns the Airy function Ai(z). AiryAi(2) AiryAi(3-\im) AiryAi(\pi/2) AiryAi(-9) Plot(AiryAi(x),x=[-10,1],numbers=0) Page 1/187 MathStudio Manual AiryBi(z) Returns the Airy function Bi(z). AiryBi(0) AiryBi(10) AiryBi(1+\im) Plot(AiryBi(x),x=[-10,1],numbers=0) AlternatingSeries(n, [terms]) Page 2/187 MathStudio Manual This function approximates the given real number in an alternating series. The result is returned in a matrix with the top row = numerator and the bottom row = denominator of the different terms. Note the alternating sign in the numerator! AlternatingSeries(\pi,7) AlternatingSeries(ln(2),10) AlternatingSeries(sqrt(2),10) AlternatingSeries(-3.23) AlternatingSeries(123456789/987654321) AlternatingSeries(.666) AlternatingSeries(.12121212) Page 3/187 MathStudio Manual AlternatingSeries(.36363) Angle(A, B) Returns the angle between the two vectors A and B. Angle([a@1,b@1,c@1],[a@2,b@2,c@2]) Angle([1,2,3],[4,5,6]) Animate(variable, start, end, [step]) This function creates an animated entry. The variable is initialized to the start value and at each frame is incremented by step and the entry is reevaluated creating animation. When the variable is greater than the value end it is set back to start. Animate(n,1,100) ImagePlot(Random(0,1,n,n)) Page 4/187 MathStudio Manual Apart(f(x), x) Performs partial fraction decomposition on the polynomial function. Apart performs the opposite operation of Together.
  • Mathematical Constants and Sequences

    Mathematical Constants and Sequences

    Mathematical Constants and Sequences a selection compiled by Stanislav Sýkora, Extra Byte, Castano Primo, Italy. Stan's Library, ISSN 2421-1230, Vol.II. First release March 31, 2008. Permalink via DOI: 10.3247/SL2Math08.001 This page is dedicated to my late math teacher Jaroslav Bayer who, back in 1955-8, kindled my passion for Mathematics. Math BOOKS | SI Units | SI Dimensions PHYSICS Constants (on a separate page) Mathematics LINKS | Stan's Library | Stan's HUB This is a constant-at-a-glance list. You can also download a PDF version for off-line use. But keep coming back, the list is growing! When a value is followed by #t, it should be a proven transcendental number (but I only did my best to find out, which need not suffice). Bold dots after a value are a link to the ••• OEIS ••• database. This website does not use any cookies, nor does it collect any information about its visitors (not even anonymous statistics). However, we decline any legal liability for typos, editing errors, and for the content of linked-to external web pages. Basic math constants Binary sequences Constants of number-theory functions More constants useful in Sciences Derived from the basic ones Combinatorial numbers, including Riemann zeta ζ(s) Planck's radiation law ... from 0 and 1 Binomial coefficients Dirichlet eta η(s) Functions sinc(z) and hsinc(z) ... from i Lah numbers Dedekind eta η(τ) Functions sinc(n,x) ... from 1 and i Stirling numbers Constants related to functions in C Ideal gas statistics ... from π Enumerations on sets Exponential exp Peak functions (spectral) ..
  • MASON V(Irtual) Mid-Atlantic Seminar on Numbers March 27–28, 2021

    MASON V(Irtual) Mid-Atlantic Seminar on Numbers March 27–28, 2021

    MASON V(irtual) Mid-Atlantic Seminar On Numbers March 27{28, 2021 Abstracts Amod Agashe, Florida State University A generalization of Kronecker's first limit formula with application to zeta functions of number fields The classical Kronecker's first limit formula gives the polar and constant term in the Laurent expansion of a certain two variable Eisenstein series, which in turn gives the polar and constant term in the Laurent expansion of the zeta function of a quadratic imaginary field. We will recall this formula and give its generalization to more general Eisenstein series and to zeta functions of arbitrary number fields. Max Alekseyev, George Washington University Enumeration of Payphone Permutations People's desire for privacy drives many aspects of their social behavior. One such aspect can be seen at rows of payphones, where people often pick an available payphone most distant from already occupied ones.Assuming that there are n payphones in a row and that n people pick payphones one after another as privately as possible, the resulting assignment of people to payphones defines a permutation, which we will refer to as a payphone permutation. It can be easily seen that not every permutation can be obtained this way. In the present study, we consider different variations of payphone permutations and enumerate them. Kisan Bhoi, Sambalpur University Narayana numbers as sum of two repdigits Repdigits are natural numbers formed by the repetition of a single digit. Diophantine equations involving repdigits and the terms of linear recurrence sequences have been well studied in literature. In this talk we consider Narayana's cows sequence which is a third order liner recurrence sequence originated from a herd of cows and calves problem.