FACTORS OF SUMS OF POWERS OF BINOMIAL COEFFICIENTS. Dedicated to the memory of Paul Erdős. 1. Introduction. n k. f n,a =

Size: px
Start display at page:

Download "FACTORS OF SUMS OF POWERS OF BINOMIAL COEFFICIENTS. Dedicated to the memory of Paul Erdős. 1. Introduction. n k. f n,a ="

Transcription

1 FACTORS OF SUMS OF POWERS OF BINOMIAL COEFFICIENTS NEIL J. CALKIN Abstract. We prove divisibility properties for sus of powers of bioial coefficiets ad of -bioial coefficiets. Dedicated to the eory of Paul Erdős It is well ow that if 1. Itroductio f,a = =0 ( ) a the f,0 = + 1, f,1 = 2, f,2 = ( ) 2, ad it is possible to show (Wilf, persoal couicatio, usig techiues i [8]) that for 3 a 9, there is o closed for for f,a as a su of a fixed uber of hypergeoetric ters. Siilarly, usig asyptotic techiues, de Bruij has show [2] that if a 4, the h 2,a has o closed for, where h,a = =0( 1) ( (clearly, h 2+1,a = 0.) I this paper we will prove that while o closed for ay exist, there are iterestig divisibility properties of f,2a ad h 2,a. We will illustrate soe of the techiues which ay be applied to prove these sorts of results. Our ai results are: Theore 1. for all positive ad a, ( ) 2 2 =0( 1) ( 2 Theore 2. For all positive itegers a,, j [ ] a t(, ) ( 1) j, =0 where the [ ] are the -bioial coefficiets, ad t(, ) is a iteger polyoial i with the property that t(, 1) is the odd part of ( ). ) a ) a Matheatics Subject Classificatio. 05A10,05A30,11B65. 1

2 2. Bacgroud I atteptig to exted the results of previous wor [1], we were led to cosider factorizatios of sus of powers of bioial coefficiets. It uicly becae clear that for eve expoets, sall pries occurred as divisors i a regular fashio (Propositio 3), ad that this result could be exteded (Propositio 7) to odd expoets ad alteratig sus. Further ivestigatio revealed (Propositio 8) that for all alteratig sus, the pries dividig h 2,a coicided with those dividig ( ) 2. This led us to cojecture, ad subseuetly to prove, Theore 1: as part of our proof we obtai (Theore 2) a correspodig result for -bioial coefficiets. 3. No-alteratig Sus Propositio 3. For every iteger 1, if p is a prie i the iterval < p < 2a( + 1) 1 2a 1 = (2a 1) the p f,2a. I particular, f,2a is divisible by all pries p for which < p < 2a( + 1) 1 2a 1 = a 1. The followig lea will eable us to covert iforatio about divisors of f,a which are greater tha ito iforatio about divisors less tha. Lea 4. Let = s s be the expasio of i base p (ad siilarly for = s s ). The s f,a f i,a (od p). Proof: By Lucas Theore (see for exaple Graville [6]), ( ) ( ) s i (od p) i=0 i=0 i where as usual, ( ) i i 0 (od p) if i > i. Hece all the ters i the su over for which i > i for soe i disappear, givig ( ) a f,a = as claied. s s 1 s=0 s 1 =0 s i=0 i =0 s i i=0 =0 ( s i 0 0 =0 i=0 ( i i i ) a (od p) f i,a (od p) ) a (od p) Corollary 5. If l < p ad p f l,a the p f l+jp,a for all positive itegers j. 2

3 We are ow i a positio to prove Propositio 3: we proceed i two stages: first, the case whe < p. Lea 6. Let p be a prie i the iterval < p < 2a(+1) 1 2a 1. The p f,2a. Proof: Let p = + r where r > 0. The we have ( ) 2a p r ( ) 2a p r f,2a = (od p) =0 =0 p r ( ) 2a r + 1 ( 1) 2a (od p) =0 p r ( ) 2a r + 1 (od p) =0 p r ( ) 2a ( + 1)( + 2)... ( + r 1) (od p). (r 1)! =0 Writig x (0) = 1 ad x (r) for the polyoial x(x + 1)... (x + r 1) this last su becoes p r ( ) 2a ( + 1)(r 1). (r 1)! =0 We ow observe that the polyoials x (0), x (1),... x (d) for a iteger basis for the space of all iteger polyoials of degree at ost d. Hece there exist itegers c 0, c 1,... c (r 1)(2a 1) so that Thus f,2a (( + 1) (r 1) ) 2a 1 = p r 1 (r 1)! 2a =0 (r 1)(2a 1) j=0 (r 1)(2a 1) 1 (r 1)! 2a j=0 (r 1)(2a 1) j=0 p r =0 c j ( + r) (j). c j ( + 1) (r 1) ( + r) (j) c j ( + 1) (r+j 1) (r 1)(2a 1) 1 (p r + 1) (r+j) c (r 1)! 2a j. r + j j=0 Now, if r + (r 1)(2a 1) < p, the each of the ters i the su is divisible by p, ad (r 1)! is ot divisible by p: hece f,2a is divisible by p. But ad if ad oly if r + (r 1)(2a 1) = 2ra 2a + 1 = 2pa 2a 2a + 1 copletig the proof of the lea. 2pa 2a 2a + 1 < p p < 2a( + 1) 1 2a 1 3

4 Now, suppose that = ( 1)p + l with l > 0 ad l < p < 2a(l + 1) 1. 2a 1 The by lea 6, p divides f l,2a ad hece by corollary 5, p divides f,2a. But l < p if ad oly if < p, ad 2a(l + 1) 1 p < 2a 1 if ad oly if 2a( ( 1)p) 1 p < 2a 1 that is if 2a( + 1) 1 p <. 2a 1 Thus, if 2a( + 1) 1 < p < 2a 1 the p divides f,2a, copletig the proof of Propositio Alteratig Sus We ote that o siilar result holds for the case of odd powers of bioial coefficiets (with the trivial exceptio of a=1). Ideed, except for the power of 2 dividig f,2a+1 (which we discuss i Lea 12), the factorizatios of sus of odd powers see to exhibit o structure: for exaple, f 28,3 = However, for alteratig sus of odd powers, we have Propositio 7. p divides h 2,2a+1 for pries i the itervals < p < (2a + 1)( + 1) 1 (2a + 1) 1 = (2a + 1) 1 Proof: ideed by exaiig the proof of Propositio 3, we see that if we defie ( ( )) a g,a = ( 1) =0 so that g,2a = f,2a ad g,2a+1 = h,2a+1, the g,a is divisible by all pries i each of the itervals ( + 1)a 1 < p < a 1 so Propositios 3 ad 7 are really the sae result. For all alteratig sus we have Propositio 8. If p ( 2 ) the p h2,a. 4

5 Proof: Clearly 2 divides h 2,a if ad oly if 2 divides the iddle ter, ( ) 2 a, as all of the other ters cacel (od 2). Sice 2 divides ( ) 2, 2 divides h2,a. Now let p be a odd prie dividig ( ) 2 : we will show that p divides h2,a. By Kuer s theore, at least oe of the digits of 2 writte i base p is odd (sice if all are eve, the there are o carries i coputig + = 2 i base p). Let the digits of 2 i base p be (2) s, (2) s 1,... (2) 1, (2) 0. The as i Lea 4 ) 2 a =0( 1) ( 2 (2) s i ( ) a ( 1) (2)i i i=0 i =0 i ), at least oe of the digits of 2 (sice p is odd, ( 1) = ( 1) s ). Now, sice p ( 2 i base p is odd: but the the correspodig ter i the product is zero, ad so p h 2,a, copletig the proof of Propositio 8. After coputig soe exaples, it is atural to cojecture (ad the, of course, to prove!) Theore The Mai Theores We will prove Theore 1 by cosiderig bioial coefficets. Defiitios: Let be a positive iteger: throughout we will deote the uber of 1 s i the biary expasio of by l() (so that 2 l() ( ) 2 ): we further defie the followig polyoials i a ideteriate : (the -euivalet of ) (the th cyclotoic polyoial i ), (the -euivalet of!), ad (the -euivalet of ( ) ). Further, defie θ () = 1 1 = φ () = (1 d ) µ( d ) d! = θ i () i=1 [ ] =!! ( )! r(x, ) = j x ( 1 j ) = (1 )! ad s(x, ) = ( ) 1 2j+1 t(, ) = 2j+1 x s(, ) s(, )s(, )s(, )

6 Note that the apparetly ifiite product i the deoiator is i fact fiite, sice s(x, ) = 1 if x < 1. We ow ae soe useful observatios about t(, ). First, so t(, ) = s(, ) = r(, ) r( 2, 2 ) s(, ) s(, ) s(, ) s(, ) s( 2, 2 )2 s( 4, 4 )2 s( 8, 8 )2 s(, )2 = r(, 2 )2 r(, 4 )2 r(, 8 )2 r(, ) r(, ) 2 r(, ) 4 r(, 2 2 ) r(, 4 2 ) r(, r(, 4 2 ) 2 r(, 8 2 ) 2 r(, 16 2 ) 2 r(, ) = r(, 2 )2 r(, ) 2 r(, 4 )2 r(, 2 2 ) r(, 4 2 ) 2 r(, ) 4 r(, 8 )2 r(, 4 2 ) r(, 8 2 ) 2 where agai, the apparetly ifiite product is i fact fiite. Now, sice as 1, we see that r(x, ) r( x 2, )2 r(x, 2 ) r( x 2, 2 ) 2 li t(2, ) = 1 Further, t(2 + 1, ) has a factor ( 1), so { 1 x eve 1 x odd 2 ( 2 ) 2 l. li t(2 + 1, ) = 0. 1 r( 8, ) r( 16, )2 r( 8, 2 ) r( 16, 2 ) 2 I other words, sice 2 l ( ) 2, we ay regard t(2, ) as the -euivalet of the largest odd factor of ( ) 2. Lea 9. t(, ) = φ ()... where the product is over those odd for which is odd. Proof: Clearly, if is eve the φ () does t divide t(, ). Suppose is odd: the φ () divides s(, ) exactly /2 ties, ad hece φ () divides t(, ) /2 /2 /2 / j ties. Now, by cosiderig the biary expasio of, it is iediate that this is 0 if is eve, ad 1 if is odd. 6

7 Lea 10. Let,, be o-egative itegers: ad write = + = + ( ) = ( ) + ( ) where, are the least o-egative residues of, (od ). The [ ] [ ] ( ) (od φ ()) where [ ] is tae to be 0 if <. Proof: We cosider polyoials odulo θ () ad φ (). First, observe that if ad oly if that is, if ad oly if (od ) 1 1 (od 1 ), θ () θ () θ () θ () (od θ ()), (od φ ()). Now, [ ] r(, ) = r(, )r(, ) ad reducig those ters which are coprie to φ () we obtai r( 1, ) ( ) r(, ) r(, ) r(, )r(( ), ) r(, )r(( ), ). Now, = + ( ) the ( ) = 0, ad [ ] [ ] r(, ) r(, )r(( ), ) (od φ ()) [ ] ( ) (od φ ()) sice θ j () j (od (1 )), ad hece (od φ ()). If + = + ( ), the ( ) = 1, ad [ ] 0 (od φ ()), ad sice >, we have as reuired. [ ] [ ] ( ) (od φ ()) 7

8 We ote that evaluatig [ ] at = 1 iediately iplies Kuer s theore, sice [ ] is a product of cyclotoic polyoials, ad sice φ (1) = p if = p i ad 1 otherwise, we have a factor of p correspodig to each positio for which there is a carry i = + ( ) base p. We are grateful to Professor Ira Gessel for iforig us that Lea 10 appears without proof as a property of -bioial coefficiets i [7], as Propositio 2.2 i [4] ad as Rear 2.4 i [3]. Proof of Theore 2: It is eough to show that if ad = are odd, the [ ] a φ () ( 1) j. But, fro Lea 10, [ ] a ( 1) j =0 [ = =0 =0 =0 ] a =0 [ ] a ( ) a ( 1) + j (od φ ()) ( 1) j =0 ( ) a ( 1) j ad sice ad are odd, the secod su is zero, ad we are doe. We observe ow that both sides of Theore 2 are iteger polyoials; thus whe we evaluate the at = 1, the left had side (if o-zero) will divide the right had side. But we have already observed that t(2, 1) = ( ) 2 /2 l, ad hece we have proved Corollary 11. ( ) ( ) 2 2 a 2 2 l() ( 1). =0 To prove Theore 1 it reais to show that 2 l() We prove a stroger result by iductio. 2 =0 Lea 12. For all positive itegers a ad, 2 l() ad 2 l() =0 ( ) a 2 ( 1). =0 ( ) a. ( ) a ( 1). Proof: The theore is clearly true whe = 1: assue ow that it it holds for all values less tha. For each 1 i l(), let = 2 i ad let,,,, ( ), ( ) be defied as i Lea 10: writig w i () = [ ] a ( ( ) a ) 8

9 we have [ ] a w i () (od φ 2 i()) =0 By our iductio hypothesis, sice l() = l( ) + l( ), 2 l() w i (1) for each i. We ow wish to cobie these euivaleces odulo θ 2 l()() = φ 2 ()φ 4 ()φ 8 ()... φ 2 l()() ad evaluate the at = 1. To do this, defie ad for i = 2, 3,..., l(). The, settig π 1 = 1 2 l 1 π i = 1 (1 ) 2l i+1 u i () = φ 2 ()φ 4 ()... φ 2 i 1()π i φ 2 i+1()... φ 2 l()() we have u 1 () = 1 2 (1 + l 1 2 )(1 + 4 )... (1 + 2l() 1 ) 1 (od (1 + )) ad for i 2, u i () 1 2 (1 l i+1 2 )(1 + 2 )(1 + 4 )... (1 + 2i 2 )(1 + 2i )... (1 + 2l() 1 ) Further, if i j, Hece, that is, 1 (1 2i 1 )(1 + 2i )(1 + 2i+1 )... (1 + 2l() 1 ) 2l i+1 1 (od (1 + 2i 1 )) =0 [ ] a u i () 0 (od φ 2 j()). l() i=1 w i ()u i () ( od θ 2 l()()) [ ] a l() = P ()θ =0 2 l()() + w i ()u i () i=1 where we wish to coclude that P () is a iteger polyoial. Observe that it is sufficiet to prove that each w i ()u i () is a iteger polyoial, sice θ 2 l() is oic. To do this, cosider w i (): first, observe that w i () is divisible by 2 l() by our iductive hypothesis, sice < : further, if is odd, so is, ad hece the -bioial su i w i () is syetric ad its coefficiets are eve: if is eve, the l( ) i 1, ad i each case, 2 l i w i () (that is, each coefficiet of w i () is divisible by 2 l i+1 ). Thus, for each i, w i ()u i () is a iteger polyoial. We have thus prove that =0 [ ] a = P ()θ 2 l()() + 9 l() i=1 w i ()u i ()

10 where P () has iteger coefficiets. Now, settig = 1 i both sides, we observe that u i (1) is a iteger for each i, 2 l() w i (1) for each i (ideed, u i (1) = 0 for i 2, ad u 1 (1) = 1), ad that θ 2 l()(1) = 2 l(). Hece each ter o the right is divisible by 2 l(), provig that ( ) a 2 l(). =0 To prove that ( ) a 2 l() ( 1) =0 we proceed siilarly, settig v i () = [ ] a ( ( ) ( 1) a ), with the oly ajor differece beig i the proof that l() i=1 v i ()u i () is a iteger polyoial: i this case, if is eve, thigs wor as above, ad if is odd, the we have is odd, ad v i () is idetically eual to 0. Note that we eed to have already prove the Lea for o-alteratig sus to prove the alteratig case. This copletes the proof of Lea 12 ad thus of Theore 1. We gratefully acowledge ay iforative discussios with Professors Joatha M. Borwei, Ira Gessel, Adrew J. Graville ad Herbert S. Wilf. Refereces [1] Neil J. Cali, A Curious Bioial Idetity, Discrete Math 131 (1994), [2] N. G. DeBruij, Asyptotic Methods i Aalysis, (Dover, New Yor 1981). [3] Ma-Due Choi, George A. Elliott, ad Norio Yui, Gauss polyoials ad the rotatio algebra, Ivetioes Matheaticae 99 (1990), [4] J. Désaréie, U aalogue des cogrueces de Kuer pour les -obres d Euler, Europ. J. Cobi. 3 (1982), [5] A. J. Graville, Zaphod Beeblebrox s Brai ad the Fify-ith Row of Pascal s Triagle, Aerica Math. Mothly 99 (1992), [6] A. J. Graville, The Arithetic Properties of Bioial Coefficiets Proceedigs of the Orgaic Matheatics Worshop (1996) (URL verified October 10, 1996). [7] Gloria Olive, Geeralized Powers, Aerica Math Mothly 72 (1965), [8] Maro Petovše, Herbert S. Wilf ad Doro Zeilberger, A=B, (A. K. Peters, Wellesley, Massachusetts, 1996). School Of Matheatics, Georgia Istitute of Techology, Atlata, GA E-ail address: cali@ath.gatech.edu 10

Bertrand s postulate Chapter 2

Bertrand s postulate Chapter 2 Bertrad s postulate Chapter We have see that the sequece of prie ubers, 3, 5, 7,... is ifiite. To see that the size of its gaps is ot bouded, let N := 3 5 p deote the product of all prie ubers that are

More information

BINOMIAL COEFFICIENT HARMONIC SUM IDENTITIES ASSOCIATED TO SUPERCONGRUENCES

BINOMIAL COEFFICIENT HARMONIC SUM IDENTITIES ASSOCIATED TO SUPERCONGRUENCES #A37 INTEGERS (20) BINOMIAL COEFFICIENT HARMONIC SUM IDENTITIES ASSOCIATED TO SUPERCONGRUENCES Derot McCarthy Departet of Matheatics, Texas A&M Uiversity, Texas ccarthy@athtauedu Received: /3/, Accepted:

More information

Binomial transform of products

Binomial transform of products Jauary 02 207 Bioial trasfor of products Khristo N Boyadzhiev Departet of Matheatics ad Statistics Ohio Norther Uiversity Ada OH 4580 USA -boyadzhiev@ouedu Abstract Give the bioial trasfors { b } ad {

More information

Jacobi symbols. p 1. Note: The Jacobi symbol does not necessarily distinguish between quadratic residues and nonresidues. That is, we could have ( a

Jacobi symbols. p 1. Note: The Jacobi symbol does not necessarily distinguish between quadratic residues and nonresidues. That is, we could have ( a Jacobi sybols efiitio Let be a odd positive iteger If 1, the Jacobi sybol : Z C is the costat fuctio 1 1 If > 1, it has a decopositio ( as ) a product of (ot ecessarily distict) pries p 1 p r The Jacobi

More information

On the transcendence of infinite sums of values of rational functions

On the transcendence of infinite sums of values of rational functions O the trascedece of ifiite sus of values of ratioal fuctios N. Saradha ad R. Tijdea Abstract P () = We ivestigate coverget sus T = Q() ad U = P (X), Q(X) Q[X], ad Q(X) has oly siple ratioal roots. = (

More information

6.4 Binomial Coefficients

6.4 Binomial Coefficients 64 Bioial Coefficiets Pascal s Forula Pascal s forula, aed after the seveteeth-cetury Frech atheaticia ad philosopher Blaise Pascal, is oe of the ost faous ad useful i cobiatorics (which is the foral ter

More information

Automated Proofs for Some Stirling Number Identities

Automated Proofs for Some Stirling Number Identities Autoated Proofs for Soe Stirlig Nuber Idetities Mauel Kauers ad Carste Scheider Research Istitute for Sybolic Coputatio Johaes Kepler Uiversity Altebergerstraße 69 A4040 Liz, Austria Subitted: Sep 1, 2007;

More information

Bernoulli Polynomials Talks given at LSBU, October and November 2015 Tony Forbes

Bernoulli Polynomials Talks given at LSBU, October and November 2015 Tony Forbes Beroulli Polyoials Tals give at LSBU, October ad Noveber 5 Toy Forbes Beroulli Polyoials The Beroulli polyoials B (x) are defied by B (x), Thus B (x) B (x) ad B (x) x, B (x) x x + 6, B (x) dx,. () B 3

More information

CERTAIN CONGRUENCES FOR HARMONIC NUMBERS Kotor, Montenegro

CERTAIN CONGRUENCES FOR HARMONIC NUMBERS Kotor, Montenegro MATHEMATICA MONTISNIGRI Vol XXXVIII (017) MATHEMATICS CERTAIN CONGRUENCES FOR HARMONIC NUMBERS ROMEO METROVIĆ 1 AND MIOMIR ANDJIĆ 1 Maritie Faculty Kotor, Uiversity of Moteegro 85330 Kotor, Moteegro e-ail:

More information

x !1! + 1!2!

x !1! + 1!2! 4 Euler-Maclauri Suatio Forula 4. Beroulli Nuber & Beroulli Polyoial 4.. Defiitio of Beroulli Nuber Beroulli ubers B (,,3,) are defied as coefficiets of the followig equatio. x e x - B x! 4.. Expreesio

More information

A talk given at Institut Camille Jordan, Université Claude Bernard Lyon-I. (Jan. 13, 2005), and University of Wisconsin at Madison (April 4, 2006).

A talk given at Institut Camille Jordan, Université Claude Bernard Lyon-I. (Jan. 13, 2005), and University of Wisconsin at Madison (April 4, 2006). A tal give at Istitut Caille Jorda, Uiversité Claude Berard Lyo-I (Ja. 13, 005, ad Uiversity of Wiscosi at Madiso (April 4, 006. SOME CURIOUS RESULTS ON BERNOULLI AND EULER POLYNOMIALS Zhi-Wei Su Departet

More information

Problem. Consider the sequence a j for j N defined by the recurrence a j+1 = 2a j + j for j > 0

Problem. Consider the sequence a j for j N defined by the recurrence a j+1 = 2a j + j for j > 0 GENERATING FUNCTIONS Give a ifiite sequece a 0,a,a,, its ordiary geeratig fuctio is A : a Geeratig fuctios are ofte useful for fidig a closed forula for the eleets of a sequece, fidig a recurrece forula,

More information

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime. MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,

More information

arxiv: v1 [math.nt] 10 Dec 2014

arxiv: v1 [math.nt] 10 Dec 2014 A DIGITAL BINOMIAL THEOREM HIEU D. NGUYEN arxiv:42.38v [math.nt] 0 Dec 204 Abstract. We preset a triagle of coectios betwee the Sierpisi triagle, the sum-of-digits fuctio, ad the Biomial Theorem via a

More information

THE GREATEST ORDER OF THE DIVISOR FUNCTION WITH INCREASING DIMENSION

THE GREATEST ORDER OF THE DIVISOR FUNCTION WITH INCREASING DIMENSION MATHEMATICA MONTISNIGRI Vol XXVIII (013) 17-5 THE GREATEST ORDER OF THE DIVISOR FUNCTION WITH INCREASING DIMENSION GLEB V. FEDOROV * * Mechaics ad Matheatics Faculty Moscow State Uiversity Moscow, Russia

More information

1. By using truth tables prove that, for all statements P and Q, the statement

1. By using truth tables prove that, for all statements P and Q, the statement Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3

More information

distinct distinct n k n k n! n n k k n 1 if k n, identical identical p j (k) p 0 if k > n n (k)

distinct distinct n k n k n! n n k k n 1 if k n, identical identical p j (k) p 0 if k > n n (k) THE TWELVEFOLD WAY FOLLOWING GIAN-CARLO ROTA How ay ways ca we distribute objects to recipiets? Equivaletly, we wat to euerate equivalece classes of fuctios f : X Y where X = ad Y = The fuctios are subject

More information

Modern Algebra 1 Section 1 Assignment 1. Solution: We have to show that if you knock down any one domino, then it knocks down the one behind it.

Modern Algebra 1 Section 1 Assignment 1. Solution: We have to show that if you knock down any one domino, then it knocks down the one behind it. Moder Algebra 1 Sectio 1 Assigmet 1 JOHN PERRY Eercise 1 (pg 11 Warm-up c) Suppose we have a ifiite row of domioes, set up o ed What sort of iductio argumet would covice us that ocig dow the first domio

More information

GENERALIZED LEGENDRE POLYNOMIALS AND RELATED SUPERCONGRUENCES

GENERALIZED LEGENDRE POLYNOMIALS AND RELATED SUPERCONGRUENCES J. Nuber Theory 0, o., 9-9. GENERALIZED LEGENDRE POLYNOMIALS AND RELATED SUPERCONGRUENCES Zhi-Hog Su School of Matheatical Scieces, Huaiyi Noral Uiversity, Huaia, Jiagsu 00, PR Chia Eail: zhihogsu@yahoo.co

More information

q-fibonacci polynomials and q-catalan numbers Johann Cigler [ ] (4) I don t know who has observed this well-known fact for the first time.

q-fibonacci polynomials and q-catalan numbers Johann Cigler [ ] (4) I don t know who has observed this well-known fact for the first time. -Fiboacci polyoials ad -Catala ubers Joha Cigler The Fiboacci polyoials satisfy the recurrece F ( x s) = s x = () F ( x s) = xf ( x s) + sf ( x s) () with iitial values F ( x s ) = ad F( x s ) = These

More information

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006 MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the

More information

18.S34 (FALL, 2007) GREATEST INTEGER PROBLEMS. n + n + 1 = 4n + 2.

18.S34 (FALL, 2007) GREATEST INTEGER PROBLEMS. n + n + 1 = 4n + 2. 18.S34 (FALL, 007) GREATEST INTEGER PROBLEMS Note: We use the otatio x for the greatest iteger x, eve if the origial source used the older otatio [x]. 1. (48P) If is a positive iteger, prove that + + 1

More information

Math 4707 Spring 2018 (Darij Grinberg): midterm 2 page 1. Math 4707 Spring 2018 (Darij Grinberg): midterm 2 with solutions [preliminary version]

Math 4707 Spring 2018 (Darij Grinberg): midterm 2 page 1. Math 4707 Spring 2018 (Darij Grinberg): midterm 2 with solutions [preliminary version] Math 4707 Sprig 08 Darij Griberg: idter page Math 4707 Sprig 08 Darij Griberg: idter with solutios [preliiary versio] Cotets 0.. Coutig first-eve tuples......................... 3 0.. Coutig legal paths

More information

Factors of sums and alternating sums involving binomial coefficients and powers of integers

Factors of sums and alternating sums involving binomial coefficients and powers of integers Factors of sums ad alteratig sums ivolvig biomial coefficiets ad powers of itegers Victor J. W. Guo 1 ad Jiag Zeg 2 1 Departmet of Mathematics East Chia Normal Uiversity Shaghai 200062 People s Republic

More information

Bertrand s Postulate

Bertrand s Postulate Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a

More information

BINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n

BINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n BINOMIAL PREDICTORS VLADIMIR SHEVELEV arxiv:0907.3302v2 [math.nt] 22 Jul 2009 Abstract. For oegative itegers, k, cosider the set A,k = { [0, 1,..., ] : 2 k ( ). Let the biary epasio of + 1 be: + 1 = 2

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

Proc. Amer. Math. Soc. 139(2011), no. 5, BINOMIAL COEFFICIENTS AND THE RING OF p-adic INTEGERS

Proc. Amer. Math. Soc. 139(2011), no. 5, BINOMIAL COEFFICIENTS AND THE RING OF p-adic INTEGERS Proc. Amer. Math. Soc. 139(2011, o. 5, 1569 1577. BINOMIAL COEFFICIENTS AND THE RING OF p-adic INTEGERS Zhi-Wei Su* ad Wei Zhag Departmet of Mathematics, Naig Uiversity Naig 210093, People s Republic of

More information

#A18 INTEGERS 11 (2011) THE (EXPONENTIAL) BIPARTITIONAL POLYNOMIALS AND POLYNOMIAL SEQUENCES OF TRINOMIAL TYPE: PART I

#A18 INTEGERS 11 (2011) THE (EXPONENTIAL) BIPARTITIONAL POLYNOMIALS AND POLYNOMIAL SEQUENCES OF TRINOMIAL TYPE: PART I #A18 INTEGERS 11 (2011) THE (EXPONENTIAL) BIPARTITIONAL POLYNOMIALS AND POLYNOMIAL SEQUENCES OF TRINOMIAL TYPE: PART I Miloud Mihoubi 1 Uiversité des Scieces et de la Techologie Houari Bouediee Faculty

More information

SOME TRIBONACCI IDENTITIES

SOME TRIBONACCI IDENTITIES Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece

More information

Bertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.

Bertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n. Bertrad s Postulate Our goal is to prove the followig Theorem Bertrad s Postulate: For every positive iteger, there is a prime p satisfyig < p We remark that Bertrad s Postulate is true by ispectio for,,

More information

A PROBABILITY PROBLEM

A PROBABILITY PROBLEM A PROBABILITY PROBLEM A big superarket chai has the followig policy: For every Euros you sped per buy, you ear oe poit (suppose, e.g., that = 3; i this case, if you sped 8.45 Euros, you get two poits,

More information

Some remarks on the paper Some elementary inequalities of G. Bennett

Some remarks on the paper Some elementary inequalities of G. Bennett Soe rears o the paper Soe eleetary iequalities of G. Beett Dag Ah Tua ad Luu Quag Bay Vieta Natioal Uiversity - Haoi Uiversity of Sciece Abstract We give soe couterexaples ad soe rears of soe of the corollaries

More information

Zeros of Polynomials

Zeros of Polynomials Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree

More information

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n Series. Defiitios ad first properties A series is a ifiite sum a + a + a +..., deoted i short by a. The sequece of partial sums of the series a is the sequece s ) defied by s = a k = a +... + a,. k= Defiitio

More information

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient Problem 4: Evaluate by egatig actually u-egatig its upper idex We ow that Biomial coefficiet r { where r is a real umber, is a iteger The above defiitio ca be recast i terms of factorials i the commo case

More information

42 Dependence and Bases

42 Dependence and Bases 42 Depedece ad Bases The spa s(a) of a subset A i vector space V is a subspace of V. This spa ay be the whole vector space V (we say the A spas V). I this paragraph we study subsets A of V which spa V

More information

Stream Ciphers (contd.) Debdeep Mukhopadhyay

Stream Ciphers (contd.) Debdeep Mukhopadhyay Strea Ciphers (cotd.) Debdeep Mukhopadhyay Assistat Professor Departet of Coputer Sciece ad Egieerig Idia Istitute of Techology Kharagpur IDIA -7232 Objectives iear Coplexity Berlekap Massey Algorith ow

More information

MT5821 Advanced Combinatorics

MT5821 Advanced Combinatorics MT5821 Advaced Combiatorics 1 Coutig subsets I this sectio, we cout the subsets of a -elemet set. The coutig umbers are the biomial coefficiets, familiar objects but there are some ew thigs to say about

More information

(s)h(s) = K( s + 8 ) = 5 and one finite zero is located at z 1

(s)h(s) = K( s + 8 ) = 5 and one finite zero is located at z 1 ROOT LOCUS TECHNIQUE 93 should be desiged differetly to eet differet specificatios depedig o its area of applicatio. We have observed i Sectio 6.4 of Chapter 6, how the variatio of a sigle paraeter like

More information

Ma/CS 6a Class 22: Power Series

Ma/CS 6a Class 22: Power Series Ma/CS 6a Class 22: Power Series By Ada Sheffer Power Series Mooial: ax i. Polyoial: a 0 + a 1 x + a 2 x 2 + + a x. Power series: A x = a 0 + a 1 x + a 2 x 2 + Also called foral power series, because we

More information

Some results on the Apostol-Bernoulli and Apostol-Euler polynomials

Some results on the Apostol-Bernoulli and Apostol-Euler polynomials Soe results o the Apostol-Beroulli ad Apostol-Euler polyoials Weipig Wag a, Cagzhi Jia a Tiaig Wag a, b a Departet of Applied Matheatics, Dalia Uiversity of Techology Dalia 116024, P. R. Chia b Departet

More information

Double Derangement Permutations

Double Derangement Permutations Ope Joural of iscrete Matheatics, 206, 6, 99-04 Published Olie April 206 i SciRes http://wwwscirporg/joural/ojd http://dxdoiorg/04236/ojd2066200 ouble erageet Perutatios Pooya aeshad, Kayar Mirzavaziri

More information

Math 2112 Solutions Assignment 5

Math 2112 Solutions Assignment 5 Math 2112 Solutios Assigmet 5 5.1.1 Idicate which of the followig relatioships are true ad which are false: a. Z Q b. R Q c. Q Z d. Z Z Z e. Q R Q f. Q Z Q g. Z R Z h. Z Q Z a. True. Every positive iteger

More information

Proof of two divisibility properties of binomial coefficients conjectured by Z.-W. Sun

Proof of two divisibility properties of binomial coefficients conjectured by Z.-W. Sun Proof of two ivisibility properties of bioial coefficiets cojecture by Z.-W. Su Victor J. W. Guo Departet of Matheatics Shaghai Key Laboratory of PMMP East Chia Noral Uiversity 500 Dogchua Roa Shaghai

More information

A generalization of Morley s congruence

A generalization of Morley s congruence Liu et al. Advaces i Differece Euatios 05 05:54 DOI 0.86/s366-05-0568-6 R E S E A R C H Ope Access A geeralizatio of Morley s cogruece Jiaxi Liu,HaoPa ad Yog Zhag 3* * Correspodece: yogzhag98@63.com 3

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of

More information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity

More information

Lecture 10: Bounded Linear Operators and Orthogonality in Hilbert Spaces

Lecture 10: Bounded Linear Operators and Orthogonality in Hilbert Spaces Lecture : Bouded Liear Operators ad Orthogoality i Hilbert Spaces 34 Bouded Liear Operator Let ( X, ), ( Y, ) i i be ored liear vector spaces ad { } X Y The, T is said to be bouded if a real uber c such

More information

Combinatorics and Newton s theorem

Combinatorics and Newton s theorem INTRODUCTION TO MATHEMATICAL REASONING Key Ideas Worksheet 5 Combiatorics ad Newto s theorem This week we are goig to explore Newto s biomial expasio theorem. This is a very useful tool i aalysis, but

More information

COMP 2804 Solutions Assignment 1

COMP 2804 Solutions Assignment 1 COMP 2804 Solutios Assiget 1 Questio 1: O the first page of your assiget, write your ae ad studet uber Solutio: Nae: Jaes Bod Studet uber: 007 Questio 2: I Tic-Tac-Toe, we are give a 3 3 grid, cosistig

More information

MATH 304: MIDTERM EXAM SOLUTIONS

MATH 304: MIDTERM EXAM SOLUTIONS MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest

More information

Summer MA Lesson 13 Section 1.6, Section 1.7 (part 1)

Summer MA Lesson 13 Section 1.6, Section 1.7 (part 1) Suer MA 1500 Lesso 1 Sectio 1.6, Sectio 1.7 (part 1) I Solvig Polyoial Equatios Liear equatio ad quadratic equatios of 1 variable are specific types of polyoial equatios. Soe polyoial equatios of a higher

More information

Orthogonal Functions

Orthogonal Functions Royal Holloway Uiversity of odo Departet of Physics Orthogoal Fuctios Motivatio Aalogy with vectors You are probably failiar with the cocept of orthogoality fro vectors; two vectors are orthogoal whe they

More information

Q-BINOMIALS AND THE GREATEST COMMON DIVISOR. Keith R. Slavin 8474 SW Chevy Place, Beaverton, Oregon 97008, USA.

Q-BINOMIALS AND THE GREATEST COMMON DIVISOR. Keith R. Slavin 8474 SW Chevy Place, Beaverton, Oregon 97008, USA. INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 2008, #A05 Q-BINOMIALS AND THE GREATEST COMMON DIVISOR Keith R. Slavi 8474 SW Chevy Place, Beaverto, Orego 97008, USA slavi@dsl-oly.et Received:

More information

THE ARTIN CARMICHAEL PRIMITIVE ROOT PROBLEM ON AVERAGE

THE ARTIN CARMICHAEL PRIMITIVE ROOT PROBLEM ON AVERAGE THE ARTIN CARMICHAEL PRIMITIVE ROOT PROBLEM ON AVERAGE SHUGUANG LI AND CARL POMERANCE Abstract. For a atural uber, let λ() deote the order of the largest cyclic subgroup of (Z/Z). For a give iteger a,

More information

The log-behavior of n p(n) and n p(n)/n

The log-behavior of n p(n) and n p(n)/n Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

Homework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger.

Homework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger. Homewor 1 Solutios Math 171, Sprig 2010 Hery Adams The exercises are from Foudatios of Mathematical Aalysis by Richard Johsobaugh ad W.E. Pfaffeberger. 2.2. Let h : X Y, g : Y Z, ad f : Z W. Prove that

More information

A Pair of Operator Summation Formulas and Their Applications

A Pair of Operator Summation Formulas and Their Applications A Pair of Operator Suatio Forulas ad Their Applicatios Tia-Xiao He 1, Leetsch C. Hsu, ad Dogsheg Yi 3 1 Departet of Matheatics ad Coputer Sciece Illiois Wesleya Uiversity Blooigto, IL 6170-900, USA Departet

More information

BOUNDS ON SOME VAN DER WAERDEN NUMBERS. Tom Brown Department of Mathematics, Simon Fraser University, Burnaby, BC V5A 1S6

BOUNDS ON SOME VAN DER WAERDEN NUMBERS. Tom Brown Department of Mathematics, Simon Fraser University, Burnaby, BC V5A 1S6 BOUNDS ON SOME VAN DER WAERDEN NUMBERS To Brow Departet of Matheatics, Sio Fraser Uiversity, Buraby, BC V5A S6 Bruce M Lada Departet of Matheatics, Uiversity of West Georgia, Carrollto, GA 308 Aaro Robertso

More information

Discrete Mathematics: Lectures 8 and 9 Principle of Inclusion and Exclusion Instructor: Arijit Bishnu Date: August 11 and 13, 2009

Discrete Mathematics: Lectures 8 and 9 Principle of Inclusion and Exclusion Instructor: Arijit Bishnu Date: August 11 and 13, 2009 Discrete Matheatics: Lectures 8 ad 9 Priciple of Iclusio ad Exclusio Istructor: Arijit Bishu Date: August ad 3, 009 As you ca observe by ow, we ca cout i various ways. Oe such ethod is the age-old priciple

More information

4 A Survey of Congruent Results 1

4 A Survey of Congruent Results 1 4 A Survey of Cogruet Results 1 SECTION 4.4 ersee Numbers By the ed of this sectio you will be able to decide which ersee umbers are composite fid factors of ersee umbers How would you fid the largest

More information

Week 5-6: The Binomial Coefficients

Week 5-6: The Binomial Coefficients Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers

More information

SOME FINITE SIMPLE GROUPS OF LIE TYPE C n ( q) ARE UNIQUELY DETERMINED BY THEIR ELEMENT ORDERS AND THEIR ORDER

SOME FINITE SIMPLE GROUPS OF LIE TYPE C n ( q) ARE UNIQUELY DETERMINED BY THEIR ELEMENT ORDERS AND THEIR ORDER Joural of Algebra, Nuber Theory: Advaces ad Applicatios Volue, Nuber, 010, Pages 57-69 SOME FINITE SIMPLE GROUPS OF LIE TYPE C ( q) ARE UNIQUELY DETERMINED BY THEIR ELEMENT ORDERS AND THEIR ORDER School

More information

Some p-adic congruences for p q -Catalan numbers

Some p-adic congruences for p q -Catalan numbers Some p-adic cogrueces for p q -Catala umbers Floria Luca Istituto de Matemáticas Uiversidad Nacioal Autóoma de México C.P. 58089, Morelia, Michoacá, México fluca@matmor.uam.mx Paul Thomas Youg Departmet

More information

Lecture Outline. 2 Separating Hyperplanes. 3 Banach Mazur Distance An Algorithmist s Toolkit October 22, 2009

Lecture Outline. 2 Separating Hyperplanes. 3 Banach Mazur Distance An Algorithmist s Toolkit October 22, 2009 18.409 A Algorithist s Toolkit October, 009 Lecture 1 Lecturer: Joatha Keler Scribes: Alex Levi (009) 1 Outlie Today we ll go over soe of the details fro last class ad ake precise ay details that were

More information

The minimum value and the L 1 norm of the Dirichlet kernel

The minimum value and the L 1 norm of the Dirichlet kernel The miimum value ad the L orm of the Dirichlet kerel For each positive iteger, defie the fuctio D (θ + ( cos θ + cos θ + + cos θ e iθ + + e iθ + e iθ + e + e iθ + e iθ + + e iθ which we call the (th Dirichlet

More information

Random Models. Tusheng Zhang. February 14, 2013

Random Models. Tusheng Zhang. February 14, 2013 Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the

More information

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS LIVIU I. NICOLAESCU ABSTRACT. We ivestigate the geeralized covergece ad sums of series of the form P at P (x, where P R[x], a R,, ad T : R[x] R[x]

More information

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163

More information

ECE Spring Prof. David R. Jackson ECE Dept. Notes 20

ECE Spring Prof. David R. Jackson ECE Dept. Notes 20 ECE 6341 Sprig 016 Prof. David R. Jackso ECE Dept. Notes 0 1 Spherical Wave Fuctios Cosider solvig ψ + k ψ = 0 i spherical coordiates z φ θ r y x Spherical Wave Fuctios (cot.) I spherical coordiates we

More information

Beurling Integers: Part 2

Beurling Integers: Part 2 Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers

More information

MDIV. Multiple divisor functions

MDIV. Multiple divisor functions MDIV. Multiple divisor fuctios The fuctios τ k For k, defie τ k ( to be the umber of (ordered factorisatios of ito k factors, i other words, the umber of ordered k-tuples (j, j 2,..., j k with j j 2...

More information

Math 2784 (or 2794W) University of Connecticut

Math 2784 (or 2794W) University of Connecticut ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really

More information

The Structure of Z p when p is Prime

The Structure of Z p when p is Prime LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z

More information

Chapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients:

Chapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients: Chapter 7 COMBINATIONS AND PERMUTATIONS We have see i the previous chapter that (a + b) ca be writte as 0 a % a & b%þ% a & b %þ% b where we have the specific formula for the biomial coefficiets: '!!(&)!

More information

The multiplicative structure of finite field and a construction of LRC

The multiplicative structure of finite field and a construction of LRC IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio

More information

On Some Properties of Digital Roots

On Some Properties of Digital Roots Advaces i Pure Mathematics, 04, 4, 95-30 Published Olie Jue 04 i SciRes. http://www.scirp.org/joural/apm http://dx.doi.org/0.436/apm.04.46039 O Some Properties of Digital Roots Ilha M. Izmirli Departmet

More information

Lecture 1. January 8, 2018

Lecture 1. January 8, 2018 Lecture 1 Jauary 8, 018 1 Primes A prime umber p is a positive iteger which caot be writte as ab for some positive itegers a, b > 1. A prime p also have the property that if p ab, the p a or p b. This

More information

arxiv: v1 [math.nt] 26 Feb 2014

arxiv: v1 [math.nt] 26 Feb 2014 FROBENIUS NUMBERS OF PYTHAGOREAN TRIPLES BYUNG KEON GIL, JI-WOO HAN, TAE HYUN KIM, RYUN HAN KOO, BON WOO LEE, JAEHOON LEE, KYEONG SIK NAM, HYEON WOO PARK, AND POO-SUNG PARK arxiv:1402.6440v1 [ath.nt] 26

More information

X. Perturbation Theory

X. Perturbation Theory X. Perturbatio Theory I perturbatio theory, oe deals with a ailtoia that is coposed Ĥ that is typically exactly solvable of two pieces: a referece part ad a perturbatio ( Ĥ ) that is assued to be sall.

More information

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT TR/46 OCTOBER 974 THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION by A. TALBOT .. Itroductio. A problem i approximatio theory o which I have recetly worked [] required for its solutio a proof that the

More information

The Boolean Ring of Intervals

The Boolean Ring of Intervals MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,

More information

On Involutions which Preserve Natural Filtration

On Involutions which Preserve Natural Filtration Proceedigs of Istitute of Mathematics of NAS of Ukraie 00, Vol. 43, Part, 490 494 O Ivolutios which Preserve Natural Filtratio Alexader V. STRELETS Istitute of Mathematics of the NAS of Ukraie, 3 Tereshchekivska

More information

Chapter 2. Asymptotic Notation

Chapter 2. Asymptotic Notation Asyptotic Notatio 3 Chapter Asyptotic Notatio Goal : To siplify the aalysis of ruig tie by gettig rid of details which ay be affected by specific ipleetatio ad hardware. [1] The Big Oh (O-Notatio) : It

More information

The Gamma function Michael Taylor. Abstract. This material is excerpted from 18 and Appendix J of [T].

The Gamma function Michael Taylor. Abstract. This material is excerpted from 18 and Appendix J of [T]. The Gamma fuctio Michael Taylor Abstract. This material is excerpted from 8 ad Appedix J of [T]. The Gamma fuctio has bee previewed i 5.7 5.8, arisig i the computatio of a atural Laplace trasform: 8. ft

More information

Hoggatt and King [lo] defined a complete sequence of natural numbers

Hoggatt and King [lo] defined a complete sequence of natural numbers REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies

More information

On Divisibility concerning Binomial Coefficients

On Divisibility concerning Binomial Coefficients A talk give at the Natioal Chiao Tug Uiversity (Hsichu, Taiwa; August 5, 2010 O Divisibility cocerig Biomial Coefficiets Zhi-Wei Su Najig Uiversity Najig 210093, P. R. Chia zwsu@ju.edu.c http://math.ju.edu.c/

More information

On Order of a Function of Several Complex Variables Analytic in the Unit Polydisc

On Order of a Function of Several Complex Variables Analytic in the Unit Polydisc ISSN 746-7659, Eglad, UK Joural of Iforatio ad Coutig Sciece Vol 6, No 3, 0, 95-06 O Order of a Fuctio of Several Colex Variables Aalytic i the Uit Polydisc Rata Kuar Dutta + Deartet of Matheatics, Siliguri

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

Different kinds of Mathematical Induction

Different kinds of Mathematical Induction Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}

More information

INMO-2018 problems and solutions

INMO-2018 problems and solutions Pioeer Educatio The Best Way To Success INMO-018 proles ad solutios NTSE Olypiad AIPMT JEE - Mais & Advaced 1. Let ABC e a o-equilateral triagle with iteger sides. Let D ad E e respectively the id-poits

More information

Harmonic Number Identities Via Euler s Transform

Harmonic Number Identities Via Euler s Transform 1 2 3 47 6 23 11 Joural of Iteger Sequeces, Vol. 12 2009), Article 09.6.1 Harmoic Number Idetities Via Euler s Trasform Khristo N. Boyadzhiev Departmet of Mathematics Ohio Norther Uiversity Ada, Ohio 45810

More information

Commutativity in Permutation Groups

Commutativity in Permutation Groups Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are

More information

Enumerative & Asymptotic Combinatorics

Enumerative & Asymptotic Combinatorics C50 Eumerative & Asymptotic Combiatorics Notes 4 Sprig 2003 Much of the eumerative combiatorics of sets ad fuctios ca be geeralised i a maer which, at first sight, seems a bit umotivated I this chapter,

More information

Complete Solutions to Supplementary Exercises on Infinite Series

Complete Solutions to Supplementary Exercises on Infinite Series Coplete Solutios to Suppleetary Eercises o Ifiite Series. (a) We eed to fid the su ito partial fractios gives By the cover up rule we have Therefore Let S S A / ad A B B. Covertig the suad / the by usig

More information

Accepted in Fibonacci Quarterly (2007) Archived in SEQUENCE BALANCING AND COBALANCING NUMBERS

Accepted in Fibonacci Quarterly (2007) Archived in  SEQUENCE BALANCING AND COBALANCING NUMBERS Accepted i Fiboacci Quarterly (007) Archived i http://dspace.itrl.ac.i/dspace SEQUENCE BALANCING AND COBALANCING NUMBERS G. K. Pada Departmet of Mathematics Natioal Istitute of Techology Rourela 769 008

More information

Math 220A Fall 2007 Homework #2. Will Garner A

Math 220A Fall 2007 Homework #2. Will Garner A Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information