0 ratings 0% found this document useful (0 votes) 23 views 4 pages Elacre-Advanced Topics in Discrete Math I-Task I
The document discusses various mathematical concepts, including divisibility rules and proofs related to prime numbers. It presents methods for determining divisibility by certain numbers and includes a proof by contradiction for the infinitude of prime numbers. The content is structured as a series of tasks and proofs in discrete mathematics education.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here .
Available Formats
Download as PDF or read online on Scribd
Carousel Previous Carousel Next
Save Elacre-Advanced Topics in Discrete Math I-Task I For Later FEORURAY 42, Loas
Ly G- ELACT
InAlLyN, cE tN Rede
PhD in MATHEMATICS EPucATION
ADVANCED Torics IN DISCRETE MATHEMATICS T
TAK #4
DIVISIBILITY RULE FOR F
Lt We ony (positive) ‘integew
LAN = 10%An + ION ag) + 10a + Ao...
wha, Bo is te last digt y
Since 1020 (med 5), pour % 10 & also
Uoranuent to 0 go
lo" 20 (med 5) N24,
TWH ,
1O"-an + 10 Sane} + --:10.Ar + ao = Ao
nis shows ot Ne divisible by & if and
Oo Jere Oe lee Lot noe
=O of
ows.
Proof? :
An Re behewier ip" mpdake §
“ms lo=0 (med co)
D (ma 5)
0 (wed 5)
n i runny 0 medyb &
fe ge ee 4
lo"= 0 Cmed 5), ¥nz|
H=10'an+ 10" ane) te. 10-1 +o
NZD ant O-An-1- ++ +0401 + Me (nods)
NZ Oo Cod ©)
crus Yhe remundy when N 6 Aided by ©
Refers only on its last dig Ae
i numbr is divisible y Sip anh ony ip
its last digt IS Ow § becauae
+ 020 (meds)
20 (mds)
! Scanned with
| @camScanner’ fearurry 22, Las
MAILYN — G- ELACRE
PhD un MATHEMATICS EDUCATION pe ALN REYES
ADVANCED TDeICS IN DISCRETE marMemaTICS I
TASK # £
DINISTQ@ILITY Rue FOR I
Lat Ws aay “imbeguv C positive)
bee N= An Bnet. Or dide
whe Oo ie He ghtmact dik me utr the
attr nein sun — fo Re.
S = Ce - a tQ2 - agit (-1)"an)
ce
S20 (mad 1)
Livisibe by
* numba Ny
N20 Cmod 1)
PROOP:
erry nunbr can be written ae a sum its
plow ~ value: $
N= Man + 10 laa +++ lar + 10° a
Sie
o= -I Cmod. 4)
loz
tairag fh 10 ch deflect poms
1” = 1 Cmod )
1° =~) Cows 1)
loP= | Cre D)
10° = -| (met »)
Ris Shows
= op Cedi)
ne :
PCy, rent heer toe Dian + Clan moa D)
n singli f
Ne Ar oa ae = O34 + I)" an) Coed 11)
SIE :
(ao- 0) +O -03+-» +EN'an) 20 Cmoa n)
yen N 8 divisible =y Nt
Scanned with
{© camScanner™ MAILYA 6 BLACRE Fekunky 22, bas
Phd in Mathemaics epucaTion pe. Alaa REET
foiealoco “pris ml Discacre maTHEmAnTICs T
ask ft L
PIs Iuty mule FOR
het N= oy (positive) @rlener
La Nz 1000" an + ieee ta 1000-41 + Ap
whe:
Qn, Qa-],--- Ar, Qe are - dig groupe
yn Crom " agit +
Finding 1000" mod
ee se visibility by 3, me fink
1000 313 = 3G remand 12
l000 = 19 (mek 13)
Sine ILE -| Cmek 12), me wmpute
Cave 19)
Cmed 19)
loco a1 Crd ).
Thus af py TR! Se 4
modulo 13, ork Chey entw power iy comanutr to
{ moduky 13.
Substituting back + Numbu AN
N=Qo-Q) + az—-dat.-- Croke Ip)
eae 5 je divisible by G_ ip amb omy if he
cies fy i ner - Bayt groupe is Uvinh&
Qo - Art 42-49 ++. = D Cmod 2)
Scanned with
| @camScanner’ MAILYN G- ELACRE FeBeuney 22, Roars
Php in MATHEMATICS eDucaTion) OR Allan REYES
ADVANCED TOPISS (N DISCRETE mATHEmMATICS I
Task #
PRCOF oF INFINITEYT many PRIMES THEDREM
Thue aa many 1A: ‘many prime numbus
Proof by Contradiction (Euctid’s Proof)
1) Assumphon : Cugy ote. Hot Rue on rly.
finitely mony Pom numbers. Lat tRede primes
Pi, A, fo, +1, Pr
mie P= 2, P73, fe25,---- a me Mh fhe
prime numbers in existence,
2) Condy Be number
N= fifets- fet] ae -
Tu number ig obtained by mubltiplugrey ant
assumed primes ark otliag, I.
a
net N. ie gredter Yow any of Fe wkinentn
2 ap, its ‘eitfoe a rom te Corn poaks
“ ime » Re wre Rote founor a neu)
ONS hae Ge Gta anak tat
Comba ducting VL ossunpition :
«en ic compssile , H— Must fame oo prame facto.
Powcdun, ave of Re primes C0 f2,-- Fr con dik w
bec dividing N by any f peauss a remandn gy |
DQ Comtradi ctor: Sihee me assumed Rat the list
a prim, buf we Retre a reo)
prin, Cor a fy prime Pacter og Pe assumption
mat be false.
8) Trerefere | fine must be ry
Infiat mony pam.
! Scanned with
| @camScanner’
