AN ALMOST LINEAR RECURRENCE. Donald E. Knuth Calif. Institute of Technology, Pasadena, Calif.
|
|
- Angel Lamb
- 5 years ago
- Views:
Transcription
1 AN ALMOST LINEAR RECURRENCE Doald E. Kuth Calif. Istitute of Techology, Pasadea, Calif. form A geeral liear recurrece with costat coefficiets has the U 0 = a l* U l = a 2 " ' " U r - l = a r ; u = b, u, + b~u b u, > r r -r The Fiboacci sequece is the simplest o-trivial case. however, the followig sequece: a) V 1 ; Cosider, ^ = *-l +^[/2J ' > 0 I this case, successive terms are formed from the previous oe byaddig the term "halfway back" i the sequece. This recurrece, which may be cosidered as a ew kid of geeralizatio of the Fiboacci sequece, has a umber of iterestig properties which we will examie here. The sequece begis 1/2, 4, 6, 10, 14, 20, 26, 36,.... It is easy to see that all terms except the first are eve, ad furthermore 0 2k-1 2k is divisible by 4 if ad oly if = 2 (mod 2 ) for some k > 1. We leave it to the reader to discover' further arithmetic properties of the sequece. The sequece <$> has a iterestig combiatorial iterpretatio: < is precisely the umber of partitios of the umber 2 ito powers of 2. For example, 6 = = = = = = , ad <t> = 6. To verify this iterpretatio, let P(m) be the umber of partitios of m The preparatio of this paper was supported, i part, by NSF grat GP-212. Ackowledgemet is also made to the Burroughs Corporatio for the use of a B5000 computer. 117
2 118 AN ALMOST LINEAR RECURRENCE April ito powers of 2. If 2 = a + a a, where a 1 _\ a >.. A a-i ad each a. is a power of 2, there are two cases: (i) a = 1; the 1 K. a a is a partitio of 2-l; (ii) a > 1; the a, /Z + a? / a, /2 is a partitio of. Coversely, all partitios of 2 are obtaied from partitios of 2~l ad i this way, so P(2) = P(2-1) + P(). We also fid P(2+1) = P(2) by a similar argumet; here oly case (i) ca arise sice is a odd umber. These recurrece relatios for P, together with P(l) = 1 ad P(2) = 2, establish the fact that <t> = P(2). The same sequece also arises i other ways; the author first oticed it i coectio with the solutio of the recurrece relatio (la) M(0) =0 M() = + mi 0 4 k < (2M(k)+M(-l-k)) for which it ca be show that M() - M(-l) = m if 0 < 2 < < >,, N x ' ' m - ^r+1, a d ^V^^-L^Z-ll Recurreces such as (la) occur i the study of dyamic programmig problems, ad they will be the subject of aother paper. Let us begi our aalysis of <t> by oticig some of its most elemetary properties. (2) * = 2 ( * «). By applyig the rule (1) repeatedly, we fid Aother immediate cosequece of (1) is ( x3 ) ' 4>l 2 ' <*> 2+l 9 M *, 2-1 T = < * 2. The sequece <t> grows fairly rapidly; for example, 4» A = *IOOOO = X 1 2 I fact, we ow show that <t> grows more rapidly tha ay power of :
3 1966 AN A L M O S T L I N E A R R E C U R R E N C E 119 T h e o r e m 1. F o r a y p o w e r k, t h e r e i s a i t e g e r N, s u c h t h a t k k 0 > for a l l > N,. k k+1 * 1 k+1 P r o o f : L e t N be s u c h t h a t (2 +1) > (2 + ^ ), ad let a = m m ( 0 / ). N N T h e by i d u c t i o 0 k+1 A a for a l l A N, s i c e t h i s i s t r u e for N 4 < 2N, ad if > 2N * = *-l + <^[/2] ^ t * - 1 ) * * 1 + j > / 2 ] k + 1 ) ^ // i \ k + 1.,11-Lk+l 1 k + l > 1 x k + l. 1 Nk+l > a ( ( - l ) + (-j-) ) = a(l + - E T r ) ( - l ) - a(l + ^ ) (-1).,_ ^ 1. k Nk+l k+1 > a(l + r ) (-1) = a - 1 If w e c h o o s e N, $> 1/a ad N, > N, the p r o o f i s c o m p l e t e. K. K. We ow c o s i d e r the g e e r a t i g fuctio for 0. L e t & (4) F(x) = x x 2 + <*> x +... N o t i c e t h a t ( l + x ) ( F ( x 2 ) = < + 0 Q x + 0 l X 2 + ^> 1 x x 4 + <*> 2 x = 0 Q + ( 0 r 0 o ) x + ( ) x 2 + ( ) x 3 + ( ) x 4 +. t h u s = ( l - x ) F ( x ) ; F(x) = ±E F(x 2 ) = ill2hl±4- F(x 4 ) X ' X ( l - x ) ( l - x * ) We h a v e t h e r e f o r e l*\ VM - ( l + x ) ( l + x 2 ) ( l + x 4 ) ( l + x 8 ) _ 1 \ D ) r v x / - 7 x ~ 7? 2 g (i-x)(i-x A )(i-x*)(i-x )--- (i-kr(i-x)(\-x)(i-x)-
4 120 AN ALMOST LINEAR RECURRENCE April F r o m this form of the geeratig fuctio, we see that F(x) coverges for x < 1. (As a fuctio of the complex variable z, F(z) has the uit circle as a atural boudary. ) It follows that lim sup \/<& = 1 > i. e. the sequece <t> grows m o r e slowly tha a for ay costat a > 1 0 This is i marked cotrast to liear r e c u r r e c e s such as the Fiboacci umbers 0 I the remaider of this paper we will determie the true rate of growth of the sequece that <t> ; it will be proved by elemetary methods 1 2 I <t> * -j -j- (I ), I 4 x ' 4 ( l ) 2 + o ( ( l ) 2 ) (6) <f> = e The techiques a r e similar to others which have bee used for d e t e r - miig the order of magitude of the partitio fuctio (see F2J ). We s t a r t by observig that ad hece by differetiatio ^ k I F(x) = -l(l-x) + V ^ ( - l ( l - x 2 )) k=0 E v E E r=l k=0 r=l? k 2 r x oo JS^ ^-E"'-, A 2 ' r=l k=0 r=l = 2 + 4x + 2x 2 + 8x 3 + 2x 4 + 4x $, x k ~ l +. k
5 1966 A N A L M O S T L I N E A R R E C U R R E N C E 121 w h e r e $ i s t w i c e the h i g h e s t p o w e r of 2 d i v i d i g k. T h e r e f o r e w h e r e if J J ^ - ( 1 - X ) ( X + 8 X X X X ^ x k " X + 8 e. ) _b (x) ^k ' a, a 1 r k = , a, > a» >... > a > 0, 1 Z r - k - 1 the c o e f f i c i e t of x i the p o w e r s e r i e s o the r i g h t h a d s i d e is a, a ^ k = e = a, 2 k a 2 r r + 2k. (The r e a d e r w i l l fid the v e r i f i c a t i o of t h i s l a t t e r f o r m u l a a i t e r - e s t i g e x e r c i s e i the u s e of the b i a r y s y s t e m. ) We c a e s t i m a t e the m a g i t u d e of w, a s f o l l o w s : a - 1 a A a k + 2k - (2 x x + " a + ' a l ' a +1 = (a +2)k a + 2 > (1+log k)k - 2k ; h e c e (7) k l o g 2 k - k 4 i i k 4 k l o g 2 k + 2k. T h i s e s t i m a t e ad the m o o t o i c i t y of <t> a r e the oly f a c t s a b o u t F(x) 'which a r e u s e d i the d e r i v a t i o b e l o w. T h e Let E - * < l ( l - x ) ) 2 G(x) = e G'(x) _ - l o g ( l - x ) _ _ u G(x) I 2 (1-x) X ' T H T X + 2 I 2 x 3 I 2 x I 2 x r - > Sice the d e r i v a t i v e of - l o g ( l - x ) / ( l -x) i s ( l - l o g ( l - x ) ) / ( l - x ), we k - 1 fid t h a t the. c o e f f i c i e t of x i the p o w e r s e r i e s o t h e r i g h t i s w h e r e
6 122 AN ALMOST LINEAR RECURRENCE April (9) h k = l + A Sice L = I k + 0(1), we have therefore established the equatios k=l k=l ad ( i i ) ^ k - x k + o(k). This suggests a p o s s i b l e relatio betwee the coefficiets of F(x) those of G(x). Note that if ad ^ ) = ( l - x ) f ( x ). the x F(x) = exp J (l-t)f(t)dt. 0 Therefore the followig lemma shows how relatios (10) ad (11) might be applied to our problem: Lemma 1. Let x A(x) = exp / (l-t)a(t)dt, 0 x B(x) = exp J (l-t)b(t)dt, where A(x) = A x, a(x) 2}k xk_1 ' B(x) 53k xk - b(x) ^}y* k ~ l A s s u m e the coefficiets of A(x) ad of b(x) a r e o-egative ad odecreasig. The if a, <_ b for all k, A, <^ B ; if a, > b for all k, A k > B k.
7 1966 AN ALMOST LINEAR RECURRENCE 12: Proof: A Q = B Q = 1. Assume a k < b R for all k, ad A < B fo 0 L k <, The sice A'(x) = (1-x)a(x)A(x), we have A = a A + a. (A -A ) a. (A. - A J) o - l x 1 o' l v ^ < b A o + b - l. x (A.-A 1 o' ) b. l v (A -1,-A -20) 7 - A (B -b J + A ^ b _-b J A. b, o < B (b -b.) + B. (b. -b 0) B. b, = B o -1 l v -1-2 ' -1 1 Essetially the same argumet works if a ^ b for all k e The problem is ow oe of estimatig the coefficiets of I ^ l ^ l - x ) G(x) = e Theorem 2 0 If (12) U. JL1JL I J. - JS.J ' V ^ 1 1 we have (13) Proof: (14) Fi-r s t we c = a I + 0((l )(l I )) show that 00 I (1-x) = > H x Zm^ m, =m where H m =y * ^ * 1 m-1 summed over all itegers a,,..., a. such that 1 = a. <, ad te 1 m-1 l the a. a r e distict. This follows iductively, sice the derivative I of (14) is I^V-x) _ Y" H x 11 " 1 (x-1) " Z J m 3 X
8 124 AN ALMOST LINEAR RECURRENCE April ad we have (15) x H = H, + " ^ H... m, m, - l -1 m - l, - l Turig to equatio (12), we have oo oo (16) V c x = V a m i 2 m ( l - x ) = ^ X ) ^ ( ) H 7 / ^ Z«^ m i^"^ ^^ ml 2m, =0 m=0 =0 m=0 (We defie H = 0 if m >, so the parethesized summatio is m, actually a fiite,sum for ay fixed value of. ) Our theorem relies o the e s t imates (17) (h. - h. ) m _ 1 < H L h 1 * 1 ". 1, if m <. -1 m - 1 ~ m, ~ -1 The righthad iequality is obvious, sice this is the sum Z ^ a i ' * ' m - 1 without the r e s t r i c t i o that the a's a r e distict. O the other had, give ay t e r m of we form a t e r m -1 x-1 L.-J a, a,, / 1 m - 1 m L a 1 4- b b 1 1 m - 1 belogig to H, where b, = a, - r if a, is the r - t h largest of & 6 te m, k k k j a,,,.. ^, o Thus, we d e c r e a s e the largest elemet b y l, the I 1 m - l. f secod largest by 2, ad so o; i case of ties, a a r b i t r a r y order is take. No two t e r m s map ito the same 1 a."* a 1 m - 1
9 1966 A N A L M O S T L I N E A R R E C U R R E N C E 125 ad 1 m m m - 1 so the lefthad s i d e of (17) is e s t a b l i s h e d. P u t t i g the r i g h t h a d s i d e of (17) ito (16), we o b t a i oo 0 JiiL m - L 2 m m 2 ah 1 T"^1 a h. -. ah (18) c ^ V ^ H, < 2 -. I Tv = e " Z_^ ( m - l ) I 2 m, ~ m = 0 O the o t h e r h a d,? m a M > H 9 A * ( m - l ). m = l (19) c > -, ( m - 1 )I 2 m, for a y p a r t i c u l a r v a l u e of m We c h o o s e m to be a p p r o x i m a t e l y 2 ah + 1, a s s u m i g is l a r g e. T h e we e v a l u a t e the l o g a r i t h m of the t e r m o the r i g h t, u s i g S t i r l i g ' s a p p r o x i m a t i o ad the left h a d s i d e of (17), ad d i s c a r d i g t e r m s of o r d e r l e s s t h a (I )(l I ): i, / 2a a /,, 2 m I c > I I T r r r ( h i " h o i ) / x I ( m - l ) I m - l / = ah, I a + 2 a h. l(h, - h 0. ) - a h, (l(ah, ) - 1) + O(l) m - l ' - l x - 1 ' = a h 2 + 2a h 2 2. l(l - m " 1 ) + 0(l ) h, ' - 1 = a h a h. h (l ) m - l T h i s t o g e t h e r w i t h (18) e s t a b l i s h e s t h e o r e m 2 0 T h e o r e m 3. Let c be a s i t h e o r e m 2. T h e,. +1. h m = 1. c *-+~ oo P r o o f : Sice H., > H, we h a v e m, +1 m, by (16). +1 y c +1
10 126 AN ALMOST LINEAR RECURRENCE April We also observe that H < h. H, ad hece by (15) m, "" -1 m - 1, thus H ^ < H + H l L h.h 0 ; m, +1 - m, -1 m-z, E a. (2m. 2a V"^ a 2m-l ) ( 2(m-l) l)!7m-2 / v ' 2(m-l), m=l ml W r ) Z m, (+1) -1 m=2 ^i I 7 3 ah. -1 < c + -ps c ~ Corollary 3. If P(x) is ay polyomial, ad if y ^ c x = e a l 2 ( l - x ) + P(x) the P(x) a Q + a x x + a 2 x I C = I c +0(1). C a 0 C + a l C - l + ' - + a 0 P(l) = _> e c c 1 2 Theorem 4. I 0 ^ -p ^-(l ) I 4 Proof: Let > 0 be give. By (11), we ca fid N so that whe > N, (1- )X < {p < (I + ) x k. Apply lemma 1 with A(x) = F(x), oo b(x)= ^ + ^ x V^1 + X ) (1+ )X l + c j xx ^ 1. k=n+l We fid <t> < C where, by Corollary 3, "~ The apply lemma 1 with I C ^ t - r i. l4' A(x) = F(x), b(x) = ^ (l- )X k x k _ 1 k=n+l
11 1966 AN ALMOST LINEAR RECURRENCE 127 This gives us <p > C' where Therefore 1-2 I C ~* ( T /l )l I 4' I 0, 1 (I ) is arbitrarily small whe is large eough. Of course, the estimate we have derived i this theorem is verycrude as far as the actual value of <t> is cocered. Empirical ^ tests based o the exact values of 4> for < reveal excel ~" let agreemet with the followig formula: (20) I < & J2-2L ( l. 2(l I ) + 1) + I I 4 The error is less tha.05 for > 10; it reaches a low of about - o 05 whe is ear 50, the icreases to approximately. 032 whe is ear 5000, ad it slowly decreases after that. Thus we ca use (20) to calculate (21) 0 ^ s472 le 12l ( 1 lil) i ' log 2 with a error of at most 5% whe 10 < < Although formula (20) gives very good accuracy, it should be remembered that oly the first term of the expasio has bee verified, ad the comparatively small values of l l for the rage of cosidered makes it possible that (20) is ot the true asymptotic result. O the assumptio that the true formula is a relatively "simple" oe, however, equatio (20) gives strikig agreemet. A similar situatio exists i the study of the partitio fuctio; the methods used here ca be applied with ease to that problem, to give log p() *v 7r \/-^ ; the actual asymptotic formula for p() itself is
12 128 A N A L M O S T L I N E A R R E C U R R E N C E A p r i l W! -I6 A r- P() - ( j ) T + 0(e V ) 4VT 4 w V r ( - ^ ) ( - l 4 ) w h e r e A < ^ " / p() <- e 4 V 3 It i s doubtful t h a t it w o u l d h a v e b e e g u e s s e d e m p i r i c a l l y i e i t h e r of t h e s e formso F o r a a c c o u t of t h i s a d a b i b l i o g r a p h y, s e e f l l. REFERENCES 1. Go H. H a r d y, R a m a u j a, c h a p t e r 8. C h e l s e a, N. Y., o K, Kopp ad I. S c h u r, E L e m e t a r e r B e w e i s e i i g e r a s y m p t o t i s c h e r F o r m e l d e r a d d i t i v e Z a h l e t h e o r i e. M a t h, Z e i t s c h r i f t 24 ( ) xxxxxxxxxxxxxxx N O T I C E T O A L L S U B S C R I B E R S! i I P l e a s e otify t h e M a a g i g E d i t o r A T O N C E of a y a d d r e s s c h a g e. T h e P o s t Office D e p a r t m e t, r a t h e r t h a f o r w a r d i g m a g a z i e s m a i l e d t h i r d c l a s s, s e d s t h e m d i r e c t l y to the d e a d - l e t t e r office. U l e s s t h e a d d r e s s e e s p e c i f i c a l l y r e q u e s t s the F i b o a c c i Q u a r t e r l y be f o r w a r d e d a t f i r s t c l a s s r a t e s to the e w a d d r e s s, he w i l l ot r e c e i v e i t. ( T h i s w i l l u s u a l l y c o s t a b o u t 30 c e t s for f i r s t - c l a s s p o s t a g e. ) If p o s s i b l e, p l e a s e otify us A T L E A S T T H R E E W E E K S P R I O R to p u b l i c a t i o d a t e s : F e b r u a r y 15, A p r i l 15, O c t o b e r 15, a d D e c e m b e r 1 5.
CHAPTER 1 SEQUENCES AND INFINITE SERIES
CHAPTER SEQUENCES AND INFINITE SERIES SEQUENCES AND INFINITE SERIES (0 meetigs) Sequeces ad limit of a sequece Mootoic ad bouded sequece Ifiite series of costat terms Ifiite series of positive terms Alteratig
More informationIt is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.
Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable
More informationDIVISIBILITY 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 informationHomework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is
Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of
More informationWeek 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 information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationUnit 4: Polynomial and Rational Functions
48 Uit 4: Polyomial ad Ratioal Fuctios Polyomial Fuctios A polyomial fuctio y px ( ) is a fuctio of the form p( x) ax + a x + a x +... + ax + ax+ a 1 1 1 0 where a, a 1,..., a, a1, a0are real costats ad
More informationGenerating Functions. 1 Operations on generating functions
Geeratig Fuctios The geeratig fuctio for a sequece a 0, a,..., a,... is defied to be the power series fx a x. 0 We say that a 0, a,... is the sequece geerated by fx ad a is the coefficiet of x. Example
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
More informationMath 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 informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationLINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS
LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS BROTHER ALFRED BROUSSEAU St. Mary's College, Califoria Give a secod-order liear recursio relatio (.1) T. 1 = a T + b T 1,
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationHoggatt 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 informationA GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca
Idia J Pure Appl Math 45): 75-89 February 204 c Idia Natioal Sciece Academy A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS Mircea Merca Departmet of Mathematics Uiversity
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More informationCSE 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 informationDifferent 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 informationIntroduction To Discrete Mathematics
Itroductio To Discrete Mathematics Review If you put + pigeos i pigeoholes the at least oe hole would have more tha oe pigeo. If (r + objects are put ito boxes, the at least oe of the boxes cotais r or
More informationCourse : Algebraic Combinatorics
Course 8.32: Algebraic Combiatorics Lecture Notes # Addedum by Gregg Musier February 4th - 6th, 2009 Recurrece Relatios ad Geeratig Fuctios Give a ifiite sequece of umbers, a geeratig fuctio is a compact
More informationMath 312 Lecture Notes One Dimensional Maps
Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,
More informationOn 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 informationMath 104: Homework 2 solutions
Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does
More informationFLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS H. W. Gould Departmet of Mathematics, West Virgiia Uiversity, Morgatow, WV
More informationWe are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n
Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at
More informationA 2nTH ORDER LINEAR DIFFERENCE EQUATION
A 2TH ORDER LINEAR DIFFERENCE EQUATION Doug Aderso Departmet of Mathematics ad Computer Sciece, Cocordia College Moorhead, MN 56562, USA ABSTRACT: We give a formulatio of geeralized zeros ad (, )-discojugacy
More informationMath 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 informationTopics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.
MATH 301 Itroductio to Aalysis Chapter Four Sequeces Topics 1. Defiitio of covergece of sequeces. 2. Fidig ad provig the limit of sequeces. 3. Bouded covergece theorem: Theorem 4.1.8. 4. Theorems 4.1.13
More informationANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION
ANOTHER GENERALIZED FIBONACCI SEQUENCE MARCELLUS E. WADDILL A N D LOUIS SACKS Wake Forest College, Wisto Salem, N. C., ad Uiversity of ittsburgh, ittsburgh, a. 1. INTRODUCTION Recet issues of umerous periodicals
More informationChapter 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 informationsin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =
60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece
More informationGENERALIZATIONS OF ZECKENDORFS THEOREM. TilVIOTHY J. KELLER Student, Harvey Mudd College, Claremont, California
GENERALIZATIONS OF ZECKENDORFS THEOREM TilVIOTHY J. KELLER Studet, Harvey Mudd College, Claremot, Califoria 91711 The Fiboacci umbers F are defied by the recurrece relatio Fi = F 2 = 1, F = F - + F 0 (
More information+ au n+1 + bu n = 0.)
Lecture 6 Recurreces - kth order: u +k + a u +k +... a k u k 0 where a... a k are give costats, u 0... u k are startig coditios. (Simple case: u + au + + bu 0.) How to solve explicitly - first, write characteristic
More informationSOME 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 informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More informationarxiv: v1 [math.fa] 3 Apr 2016
Aticommutator Norm Formula for Proectio Operators arxiv:164.699v1 math.fa] 3 Apr 16 Sam Walters Uiversity of Norther British Columbia ABSTRACT. We prove that for ay two proectio operators f, g o Hilbert
More informationBertrand 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 informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationCurve Sketching Handout #5 Topic Interpretation Rational Functions
Curve Sketchig Hadout #5 Topic Iterpretatio Ratioal Fuctios A ratioal fuctio is a fuctio f that is a quotiet of two polyomials. I other words, p ( ) ( ) f is a ratioal fuctio if p ( ) ad q ( ) are polyomials
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationMDIV. 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 informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationMATH 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 informationZeros 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 informationWHAT ARE THE BERNOULLI NUMBERS? 1. Introduction
WHAT ARE THE BERNOULLI NUMBERS? C. D. BUENGER Abstract. For the "What is?" semiar today we will be ivestigatig the Beroulli umbers. This surprisig sequece of umbers has may applicatios icludig summig powers
More informationPolynomials with Rational Roots that Differ by a Non-zero Constant. Generalities
Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by
More informationHOMEWORK #10 SOLUTIONS
Math 33 - Aalysis I Sprig 29 HOMEWORK # SOLUTIONS () Prove that the fuctio f(x) = x 3 is (Riema) itegrable o [, ] ad show that x 3 dx = 4. (Without usig formulae for itegratio that you leart i previous
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationIn algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:
74 The Method of Partial Fractios I algebra oe speds much time fidig commo deomiators ad thus simplifyig ratioal epressios For eample: + + + 6 5 + = + = = + + + + + ( )( ) 5 It may the seem odd to be watig
More informationMa 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5
Ma 42: Itroductio to Lebesgue Itegratio Solutios to Homework Assigmet 5 Prof. Wickerhauser Due Thursday, April th, 23 Please retur your solutios to the istructor by the ed of class o the due date. You
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More informationA Note on the Symmetric Powers of the Standard Representation of S n
A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationDirichlet s Theorem on Arithmetic Progressions
Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty
More informationMAT1026 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 informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationM A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O
M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet
More information~j=zhax~ 6=0, t,2... ), k=~
Numerische Mathematik 6, 35 -- 39 (964) Exactess Coditios i Numerical Quadrature* By HERBERT S. WILl* The itegral b () I--f t(x)dx is usually computed umerically by meas of a formula of the type (2) I
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationA LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II 1. INTRODUCTION
A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II C. T. LONG J. H. JORDAN* Washigto State Uiversity, Pullma, Washigto 1. INTRODUCTION I the first paper [2 ] i this series, we developed certai properties
More informationRoger Apéry's proof that zeta(3) is irrational
Cliff Bott cliffbott@hotmail.com 11 October 2011 Roger Apéry's proof that zeta(3) is irratioal Roger Apéry developed a method for searchig for cotiued fractio represetatios of umbers that have a form such
More information6. Uniform distribution mod 1
6. Uiform distributio mod 1 6.1 Uiform distributio ad Weyl s criterio Let x be a seuece of real umbers. We may decompose x as the sum of its iteger part [x ] = sup{m Z m x } (i.e. the largest iteger which
More informationBasic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S.
Basic Sets Example 1. Let S = {1, {2, 3}, 4}. Idicate whether each statemet is true or false. (a) S = 4 (b) {1} S (c) {2, 3} S (d) {1, 4} S (e) 2 S. (f) S = {1, 4, {2, 3}} (g) S Example 2. Compute the
More information1. 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 informationON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS
ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS NORBERT KAIBLINGER Abstract. Results of Lid o Lehmer s problem iclude the value of the Lehmer costat of the fiite cyclic group Z/Z, for 5 ad all odd. By complemetary
More informationReview Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =
Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:
More informationCSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture)
CSI 101 Discrete Structures Witer 01 Prof. Lucia Moura Uiversity of Ottawa Homework Assigmet #4 (100 poits, weight %) Due: Thursday, April, at 1:00pm (i lecture) Program verificatio, Recurrece Relatios
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationREGULARIZATION 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 informationSeries: Infinite Sums
Series: Ifiite Sums Series are a way to mae sese of certai types of ifiitely log sums. We will eed to be able to do this if we are to attai our goal of approximatig trascedetal fuctios by usig ifiite degree
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationA Proof of Birkhoff s Ergodic Theorem
A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed
More informationCERTAIN GENERAL BINOMIAL-FIBONACCI SUMS
CERTAIN GENERAL BINOMIAL-FIBONACCI SUMS J. W. LAYMAN Virgiia Polytechic Istitute State Uiversity, Blacksburg, Virgiia Numerous writers appear to have bee fasciated by the may iterestig summatio idetitites
More informationand 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 informationTHE 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 information1. Hydrogen Atom: 3p State
7633A QUANTUM MECHANICS I - solutio set - autum. Hydroge Atom: 3p State Let us assume that a hydroge atom is i a 3p state. Show that the radial part of its wave fuctio is r u 3(r) = 4 8 6 e r 3 r(6 r).
More information1 Lecture 2: Sequence, Series and power series (8/14/2012)
Summer Jump-Start Program for Aalysis, 202 Sog-Yig Li Lecture 2: Sequece, Series ad power series (8/4/202). More o sequeces Example.. Let {x } ad {y } be two bouded sequeces. Show lim sup (x + y ) lim
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
More informationSequences of Definite Integrals, Factorials and Double Factorials
47 6 Joural of Iteger Sequeces, Vol. 8 (5), Article 5.4.6 Sequeces of Defiite Itegrals, Factorials ad Double Factorials Thierry Daa-Picard Departmet of Applied Mathematics Jerusalem College of Techology
More information1 Approximating Integrals using Taylor Polynomials
Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................
More informationMathematics review for CSCI 303 Spring Department of Computer Science College of William & Mary Robert Michael Lewis
Mathematics review for CSCI 303 Sprig 019 Departmet of Computer Sciece College of William & Mary Robert Michael Lewis Copyright 018 019 Robert Michael Lewis Versio geerated: 13 : 00 Jauary 17, 019 Cotets
More informationChapter 7 Isoperimetric problem
Chapter 7 Isoperimetric problem Recall that the isoperimetric problem (see the itroductio its coectio with ido s proble) is oe of the most classical problem of a shape optimizatio. It ca be formulated
More informationOn a Smarandache problem concerning the prime gaps
O a Smaradache problem cocerig the prime gaps Felice Russo Via A. Ifate 7 6705 Avezzao (Aq) Italy felice.russo@katamail.com Abstract I this paper, a problem posed i [] by Smaradache cocerig the prime gaps
More informationTR/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 informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationSome 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 informationThe 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 informationAbstract. 1. Introduction This note is a supplement to part I ([4]). Let. F x (1.1) x n (1.2) Then the moments L x are the Catalan numbers
Abstract Some elemetary observatios o Narayaa polyomials ad related topics II: -Narayaa polyomials Joha Cigler Faultät für Mathemati Uiversität Wie ohacigler@uivieacat We show that Catala umbers cetral
More information(2) F j+2 = F J+1 + F., F ^ = 0, F Q = 1 (j = -1, 0, 1, 2, ). Editorial notes This is not our standard Fibonacci sequence.
ON THE LENGTH OF THE EUCLIDEAN ALGORITHM E. P. IV1ERKES ad DAVSD MEYERS Uiversity of Ciciati, Ciciati, Ohio Throughout this article let a ad b be itegers, a > b >. The Euclidea algorithm geerates fiite
More informationNEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE
UPB Sci Bull, Series A, Vol 79, Iss, 207 ISSN 22-7027 NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE Gabriel Bercu We itroduce two ew sequeces of Euler-Mascheroi type which have fast covergece
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More informationThe Riemann Zeta Function
Physics 6A Witer 6 The Riema Zeta Fuctio I this ote, I will sketch some of the mai properties of the Riema zeta fuctio, ζ(x). For x >, we defie ζ(x) =, x >. () x = For x, this sum diverges. However, we
More information[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]
[ 47 ] Number System 1. Itroductio Pricile : Let { T ( ) : N} be a set of statemets, oe for each atural umber. If (i), T ( a ) is true for some a N ad (ii) T ( k ) is true imlies T ( k 1) is true for all
More informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More informationMath 4400/6400 Homework #7 solutions
MATH 4400 problems. Math 4400/6400 Homewor #7 solutios 1. Let p be a prime umber. Show that the order of 1 + p modulo p 2 is exactly p. Hit: Expad (1 + p) p by the biomial theorem, ad recall from MATH
More information