{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# 39 - Chapter 3 Review:9...

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Chapter 3 Review :9 15.1fesndhareintegers,thenntationn|hetsmtsfor .mdtbenotationnfbstsndsfor 16. IT. 13. 19. 22. 2?. 55‘5“ According to the theorem about diﬁSihilitF by aprime number, given any integer n 3:» 1, there is a . The unique factorization theorem [fundamental theorem of arithmetic} sears that given any htegern}!,neanbewrittenasa inawavthatisunique,exoeptpom'blvfertbe___ inttrlrlilehthetournamentlill‘eill.rril:t~er:|+ The qunttent-rernainder theorem save that given an},r integer n and any positive integer ii, there exists unique integereqandrsuehtbat . Enhannnnegativeintegeranddisapnsitiveinteger,thenndied=_andamedd= where . Cl‘heperit}r property says thatanyintegeriseither . 2L Supposethatatsmnepointhaproofvouknowthetoneofthestetementeitlcud-gorilla istmeandynuwsnttoshowthatregardlessofwhiehstatementhappenstnbetrueaoertain conclusion Gerillfollnw. Tbenyouneedtoshewthat and and . .__, Given surf.r real number at, the ﬂoor of at is the unique integer n sueb that _. . Given any real number :s. the ceiling of :r is the unique integer n such that . . 'Ib prove a statement by oontradictlern, you suppose that and you show that _. . To prove a statement of the form We: E B, if Pile} then Q[x}” by rssitrapositionI you suppose that andyousbowthet . . Dneeravtoprovethst ﬁisanbrationalnumberistoaesumethst Ji=afbfnrsomeintegers nandbwith no oommnnfaotorsgrester than 1, use the lemma that save that ifthe square of anintegeriseventhen ,endeventuallyshnwtbatnandb . Dnewtoprovethatthemsreinﬂnitelymamrpﬂmenumbereistoassumethat thereare eel:r ﬁnitelvmanypﬂme numbers p1,pg,...,pmennstruetthenumber_, and thensbnvv thatthisnumberhaetobedivislblebyaprimenumberthatisgreeterthan . Whenanalgorithmﬁtatementoftheformzzeiseieecuted, . . lEonsilier an algorithm statement of the following form. if [modiﬁen] then 31 else a: When such a statement is executed. the truth or faltﬁtyr of the maditien is- evaluated- If mnﬁﬁnn is true, . If mastitien is false. .Gonsidersnalgoritbmstatementoftbeﬁnllowingform. while {Man} fstatsmmﬂt'mt make up the body of the loop} and. while Wbensuchastatementisexeented,thetnithorfslsltjrofthenendtﬁnnisevaluated. If mnditinnietrue, .Ifmdtﬂenisfalss, . ...
View Full Document

{[ snackBarMessage ]}