= m 1. sin π( ai z ) )

Similar documents
EXACT COVERING SYSTEMS AND THE GAUSS-LEGENDRE MULTIPLICATION FORMULA FOR THE GAMMA FUNCTION JOHN BEEBEE. (Communicated by William Adams)

The Parity of the Number of Irreducible Factors for Some Pentanomials

Applied Mathematics Letters

PARTITIONS WITH PARTS IN A FINITE SET

System in Weibull Distribution

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

An Optimal Bound for Sum of Square Roots of Special Type of Integers

ON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES

Binomial transforms of the modified k-fibonacci-like sequence

Bernoulli Numbers and Polynomials

Finite Fields and Their Applications

Slobodan Lakić. Communicated by R. Van Keer

Our focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e.

FORMULAS FOR BINOMIAL SUMS INCLUDING POWERS OF FIBONACCI AND LUCAS NUMBERS

On the number of regions in an m-dimensional space cut by n hyperplanes

More metrics on cartesian products

2.3 Nilpotent endomorphisms

APPENDIX A Some Linear Algebra

1. Statement of the problem

Revision: December 13, E Main Suite D Pullman, WA (509) Voice and Fax

On the Calderón-Zygmund lemma for Sobolev functions

arxiv: v1 [math.ho] 18 May 2008

Least Squares Fitting of Data

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices

Denote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form

A Radon-Nikodym Theorem for Completely Positive Maps

arxiv: v2 [math.co] 3 Sep 2017

REAL ANALYSIS I HOMEWORK 1

Expected Value and Variance

arxiv: v1 [math.co] 1 Mar 2014

Exercise Solutions to Real Analysis

EXACT TRAVELLING WAVE SOLUTIONS FOR THREE NONLINEAR EVOLUTION EQUATIONS BY A BERNOULLI SUB-ODE METHOD

Multiplicative Functions and Möbius Inversion Formula

THE GENERALIZED (s, t)-fibonacci AND FIBONACCI MATRIX SEQUENCES

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Randić Energy and Randić Estrada Index of a Graph

Series Expansion for L p Hardy Inequalities

GENERALIZED ARITHMETIC PROGRESSIONS

On some variants of Jensen s inequality

Excess Error, Approximation Error, and Estimation Error

Determinants Containing Powers of Generalized Fibonacci Numbers

Foundations of Arithmetic

The internal structure of natural numbers and one method for the definition of large prime numbers

A combinatorial proof of multiple angle formulas involving Fibonacci and Lucas numbers

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

International Journal of Mathematical Archive-9(3), 2018, Available online through ISSN

Math 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions

On Finite Rank Perturbation of Diagonalizable Operators

Deriving the X-Z Identity from Auxiliary Space Method

The Impact of the Earth s Movement through the Space on Measuring the Velocity of Light

MAE140 - Linear Circuits - Winter 16 Final, March 16, 2016

Finite Vector Space Representations Ross Bannister Data Assimilation Research Centre, Reading, UK Last updated: 2nd August 2003

XII.3 The EM (Expectation-Maximization) Algorithm

THE ADJACENCY-PELL-HURWITZ NUMBERS. Josh Hiller Department of Mathematics and Computer Science, Adelpi University, New York

Least Squares Fitting of Data

Math 261 Exercise sheet 2

CSCE 790S Background Results

Ballot Paths Avoiding Depth Zero Patterns

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS

Subset Topological Spaces and Kakutani s Theorem

e companion ONLY AVAILABLE IN ELECTRONIC FORM

Integral Transforms and Dual Integral Equations to Solve Heat Equation with Mixed Conditions

1 Definition of Rademacher Complexity

On an identity for the cycle indices of rooted tree automorphism groups

On the partial orthogonality of faithful characters. Gregory M. Constantine 1,2

Section 8.3 Polar Form of Complex Numbers

Some congruences related to harmonic numbers and the terms of the second order sequences

Semilattices of Rectangular Bands and Groups of Order Two.

Richard Socher, Henning Peters Elements of Statistical Learning I E[X] = arg min. E[(X b) 2 ]

Final Exam Solutions, 1998

Chowla s Problem on the Non-Vanishing of Certain Infinite Series and Related Questions

Some basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION

First day August 1, Problems and Solutions

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

THE PERMUTATION REPRESENTATION OF Sp(2m, F p ) ACTING ON THE VECTORS OF ITS STANDARD MODULE. Peter Sin University of Florida

arxiv: v1 [math.co] 12 Sep 2014

A Proof of a Conjecture for the Number of Ramified Coverings of the Sphere by the Torus

SL n (F ) Equals its Own Derived Group

Designing Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate

THERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS

AN ANALYSIS OF A FRACTAL KINETICS CURVE OF SAVAGEAU

NP-Completeness : Proofs

Module 2. Random Processes. Version 2 ECE IIT, Kharagpur

Anti-van der Waerden numbers of 3-term arithmetic progressions.

Convexity preserving interpolation by splines of arbitrary degree

Discrete Mathematics

Dirichlet s Theorem In Arithmetic Progressions

Random Walks on Digraphs

CALCULUS CLASSROOM CAPSULES

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION

Another converse of Jensen s inequality

A property of the elementary symmetric functions

Soft Neutrosophic Bi-LA-semigroup and Soft Neutrosophic N-LA-seigroup

EXPANSIVE MAPPINGS. by W. R. Utz

On a Theorem of J. A. Green

Y. Guo. A. Liu, T. Liu, Q. Ma UDC

An Introduction to Morita Theory

Approximate Technique for Solving Class of Fractional Variational Problems

Transcription:

EXACT COVERING SYSTEMS AND THE GAUSS-LEGENDRE MULTIPLICATION FORMULA FOR THE GAMMA FUNCTION John Beeee Unversty of Alaska Anchorage July 0 199 The Gauss-Legendre ultplcaton forula for the gaa functon s π 1 1 = + 1 1... +. Let{a od : 1 } e an exact coverng syste wth standarded offsets. Then = 1 +a. a Conversely, f the aove dentty holds, then {a od : 1 } s an exact coverng syste wth standarded offsets. The Gauss-Legendre ultplcaton forula s a specal case of ths dentty. Let Z a e the arthetc progresson AP {x : x = a + n, n Z}. Another notaton for ths arthetc progresson s aod. A fnte collecton of dsjont AP s C = {Z a : 1 } s called an exact coverng syste or exact cover f each nteger elongs to exactly one AP Z a. We usually assue that the offsets a have een standarded so that 0 a <. A consequence of the fact that C s an exact cover wth standarded offsets s that there s one and only one offset that s ero, and we assue t s always a 1. Another property of exact covers s that =1 1 = 1. If the offsets are standarded, =1 a, y Theore 1 of Fraenkel [1]. Let M = lc{ }. If each of the ntegers {0, 1,..., M 1} s covered y C, then all the ntegers are covered y C. The collecton Z = {Z a : 1 < } s an nfnte exact cover f each nteger elongs to exactly one AP. There are two classes of nfnte exact covers. A saturated cover has =1 1 = 1. An unsaturated cover has =1 1 < 1. In [] I proved that snπ = sn π 1991 Matheatcs Suject Classfcaton. 11B5,33A15. sn π a sn πa = 1 1 Typeset y AMS-TEX

JOHN BEEBEE f and only f C = {Z a the well known dentty : 1 } s an exact cover. A specal case of ths s sn = 1 sn sn + π 1π... sn +. In [1] A.S. Fraenkel proves that Raae s dentty for the Bernoull polynoals, B n = n 1 B n + B n + 1 + + B n + 1, can e generaled to exact covers. See also Beeee [3]. Ths last dentty s an addtve analogy to the Gauss-Legendre ultplcaton forula, 1 π 1 1 = + 1... + 1. Evdently, these denttes elong to a class whch can e generaled to exact covers. For exaple, the referee has nonated the q-gaa functon to ths class See [4].. The defnton of ths class and the coon characterstcs of the functons need to e deterned. Theore 1. If = g =1 +a where g has no eros at the nonpostve ntegers, and s defned for all coplex, then the set of AP s C = {Z a : 1 } s an exact cover wth standarded offsets; and conversely f C s an exact cover wth standarded offsets, then = 1 +a a. Proof. Suppose = g =1 +a. The gaa functon has the nonpostve ntegers for ts only poles, and these poles have order 1. Then a s a pole of the functon on the rght and hence of the functon on the left. Thus a s a nonpostve nteger, so a s a nonnegatve nteger. If n s a nonnegatve nteger, then a n s a pole on the rght, hence on the left. Thus a + n s a nonnegatve nteger. Thus s a postve nteger. If n s a nonnegatve nteger, -n s a pole of order 1 on the left, and hence n+a s a pole for precsely one on the n+a rght, and thus s a nonpostve nteger: =. Hence n = a + for each nonnegatve n, so each nonnegatve nteger elongs to exactly one AP Z a. For fnte, ths eans C s an exact cover. There are nfnte saturated systes of dsjont AP s that cover the nonnegatve ntegers ut not the ntegers. See exaple 3 elow. Zero s a pole of the left sde, so 0+a s a pole on the rght for soe and hence a s a nonpostve nteger for soe. But a 0, so a = 0 for soe. Suppose a. Then a 0. Hence a s a pole on the left. But ths ples t s a pole on the rght. Hence a+aj j = n, for soe nonnegatve n. If j =, ths ples 1 s a pole of the gaa functon, so j. Thus a = a j + n j,

EXACT COVERING SYSTEMS AND THE GAUSS-LEGENDRE MULTIPLICATION FORMULA FOR THE GAMMA FUNCTION3 whch s a contradcton, ecause a cannot elong to two AP s n the exact cover. Hence 0 a <, so C has standarded offsets. Now suppose C s an exact cover wth a 1 = 0, 0 a <. The referee suggested the followng dervaton of. It s slar to the dervaton of 1 n Ranvlle [5] or Marsden []. Let n = + 1 + n 1 and N = a ultple of all the odul,. Snce C s an exact cover wth standarded offsets Thus =1 {0, 1,,..., N 1} = {a + n : 0 n N 1}. n = + a + a + + a + N 1 = By Theore 9 of [5], n = 3 + N =1 + n. Thus = =1 N +a + N. +a =1 N + a. N By lea 7 of [5], l n n 1!n + n = 1. Rearrangng 3 and usng ths, =1 +a = l N N 1!N! N =1 N 1, +a N or 4 =1 +a = l N N 1 N 1! N a =1 = constant, ecause 1 = 1 and a = 1. Takng l on the left, we see that 0 constant = a 1 Susttutng ths value of the constant n 4 yelds. Nether ths or any other proof I have found apples to nfnte exact covers. Exaple 1. The Gauss-Legendre ultplcaton forula s a specal case of. Proof. It s easy to see that C = {Z 1, : 1 } s an exact cover. In [] I proved.

4 JOHN BEEBEE Lea. If C = {Z a : 1 } s an exact cover then sn π a = 1. When we apply ths lea to the exact cover C, we get But 1 = 1 1 sn π π sn π. Hence 1 1 But 1 = 1 1, so = = 1. π sn π 1 = π 1. 5 1 = 1 π. Now susttute for, 1 for a, and for n, and use 5: = + 1 1... + π 1 1 Rearrangeent of ths gves the Gauss-Legendre ultplcaton forula 1. Exaple. As an exaple of, consder the exact cover Susttutng n yelds = For = 10, ths equaton s 3, 880 = C = {Z 04, Z 4, Z 1, Z 3, Z 5 }. 4 + 4 +1 +3 +5 4 1 4 4 4 4 1 3 5 1.39.9411.081.39 4 1.5 4.5 1.7 1.7 1.7 1.775.51.771.19.

EXACT COVERING SYSTEMS AND THE GAUSS-LEGENDRE MULTIPLICATION FORMULA FOR THE GAMMA FUNCTION5 Exaple 3. C n = {Z 0 ; Z 14 ; Z 3,8 ;... ; Z n 1 1, n; Z n 1,n} s an exact cover, the Grey cover, wth n + 1 AP s. Susttute C n nto. = 1 n 1+ n n n n 1 n n 1 1+. 1 1 Takng l n on oth sdes we see that the product converges and = 1 + 1 1 1 0 1 1 1. But the set of dsjont AP s C = {Z 0 ; Z 14 ; Z 3,8 ;... ; Z n 1 1,n;... } s not an nfnte saturated exact cover, even though =1 1 = 1, ecause t does not cover 1. Thus for = can hold, ut C s not an exact cover. The proof of Theore 1 ade use of =1 1 = 1, so I speculate that f C s an unsaturated nfnte exact cover, does not hold. But f C s a saturated nfnte exact cover, then does hold. Lted nuercal experents support ths conjecture. Exaple 4. Defne Wth ths notaton, s a = = +a a f a = 0 f a 0. a. =1 The functon a has aout the sae relaton to the AP Z a that has to the ntegers. a. has ts poles at the non-postve ntegers. a has ts poles at the nonpostve ntegers n Z a.. For n 1, 1 + =, and n = n 1!. For the functons a, we have 0 = 1 a = a and and 0 n = n 1 n a n = a + n 1 a + n a + a + a. Let C e an exact cover and let = M = lc{ }. Then s the self-evdent forula M 1! = M1 1 M1 a + M 1 a + M a + a.

JOHN BEEBEE References 1. Aver S. Fraenkel, A characteraton of exactly coverng congruences, Dscrete Math 4 1973, 359-3... John Beeee, Soe Trgonoetrc Identtes Related To Exact Covers, Proceedngs of the Aercan Matheatcal Socety 11 1991, 39 338. 3. John Beeee, Bernoull nuers and exact coverng systes, Aercan Matheatcal Monthly to appear. 4. George Gasper and Man Rahan, Basc Hypergeoetrc Seres, Cardge Unversty Press, Cardge, 1990. 5. Earl D. Ranvlle, Specal Functons, The Macllan Copany, New York, 190.. Jerrold E Marsden, Basc Coplex Analyss, W.H. Freean & Copany, San Francsco, 1973. 7. B. Novák and S. Zná, Dsjont Coverng Systes, Aercan Matheatcal Monthly 81 1974, 4 45. 8. Sheran K. Sten, Unons of arthetc sequences, Math. Ann. 138 1958, 89-94. 9. M.A. Berger, A. Felenau, A.S. Fraenkel, and R. Holan, On Infnte and Fnte Coverng Systes, Aercan Matheatcal Monthly 98 1991, 739-74.