0% found this document useful (0 votes)
15 views10 pages

Modular Arithmetic

AMC10 math test Modular arithmetic

Uploaded by

Sichao Hou
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
0% found this document useful (0 votes)
15 views10 pages

Modular Arithmetic

AMC10 math test Modular arithmetic

Uploaded by

Sichao Hou
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
You are on page 1/ 10
20243 -REKFDS SBF -AMC10-1891-OMO-7 2024/08/24 10:30-12:30 4.27 Find the smallest four-digit number that is divisible by each ofthe four smallest prime numbers. sion bas ay. (Gin (SE1) S30. bes. 2iexS=[0S> 4.29 List all of the positive common divisors of 162 and 540. 1h2 =3% 2x20 ere 3% cd (its) = 2x32 = SY yoxtox bx f =27x3'es d =e 1esy 2*27 3x48 6x9 435 The GCD of n and 216 is 24 and their LCM is 864. Find n. A(n, = Ack (m, 2b) = 24 nerih = Ged lim =2bea6y ub) = 36! lem Cn, ab) " : i ai ne Meet =f 53.2 How many of the positive divisors of 2160 are multiples of 3? abo =| x 6? = 24 (44i)x Bt) x (1-41) G4)x (3) K(i41) =30 V £37 gta) = 1m haps diary 1 pine ds how myst divisors L Ba2xp =(in)x(34) — M=al-b” (2=3e0 ~(Ow)y(x4) mee? el? me abcd M (nm) = (4026) Ge) & x Classin > 1 sa oe eK OR ~9 539 Letnbeanatural number with exactly 2 positive prime divisors. If n? has 27 divisors, how many does m have? . n= oh 5 n> oF pe is 1x2 aa2"-3F @bin) (aban) = 27 st 2Ritl=3 > bial 1 abatl=— 9 bey n=a-b (UG) = (4) KY) oye, v Example 20. When the three-digit number Sa2 is added to the number 247, the resulting number is a three-digit number 859. Find a + b if 869 is divisible by 9. Sar 201 a+t~-lo =b Tes) J a~b=b 3 bf (8 +b49) = 9k b> 1 Example 21. Six-digit number 814693 is a multiple of 99) Find the digits a and b. 4: Bel +orb+P+3 = IRD a+b = 3h Otb=6oris Otb= boris mye 4-3. bee ih (Staxf)— (+63) =(/-m x M+a-¥-b =lln O-b +13 =11m, O-b+2= Im O-b=IIm-2 = mio Classin > 2 DEM = 2b M= 9/ -2 Q+=-2- GA=b-2 Faas r=81b ae Lecture 7 Modular Arithmetic (#8!) H-=2 Dw 7 =3x24D T= 1 (med 2) aamese iT = 3 (md7) 1.1 Definitions If a-bis divisible by m and_m=2,the following equation is true: a= (modm) ("ais congruent to 6 modulo m") = Congraact (138) abebimaistcob aS bARMABELRHY [= 3 (md7) i=l (47) > _Linear congruence equation is a congruence that involves a variance raised only to the first power BBR [Problem 14.1: Solve each of the ay linear congruences, g (mad 4) —5(d) vl G44) O) 0 (mod 4) (@ x42 0 (mod 4) Pr © x-1 = 0 (modd) () x43 = 0 (mod 4) “A (2) X-3=0 (md 4) X-3=4h. Ree K> eR+B > A+BZ0 (nd ¢) x t$=¢h Aaeh-d Cove 2 Cod ©) tame arena. aan Classin > 3 § X23 (wd 4) — ams (Ora, 830) (mal) Raa Gtat—Ha, It) x= hl = 4h) +4) = QED =Q (mdr) X= (9). (nd n) v xt] sup > 4n-l =o (mds) 2 G@esk. 4n= shel bom) n= te ba hee Be.. yee: ne Era p> ib + +0 bey al-- 1, erett ome] ? bes 26 -- 2 beT (linear congruence F#M) ASSTAEAMRER—TRBAAN, MOEA Ia cetain numbers vided by 23.4205, the remainders in cach ase. What is the east number ht satisfies these conltons? ws @0 (OD Om ww NEL (md 2) 3 (n-1)=0 (Lr) Rel (de) (ra) 3 tn) = R lom(Z 34,5) NE| (med @) (n-!) % net (mds) (nay) (4) = bok n=oke. Rei n=el What is the smallest whole number such that itis divided by 2,3 and the remainders will be 1.2 and 3, respectively? PIAS i@ARB 2 D) (B31 (CID (E10 & nN Classin > 4 M2 B31 2 (B10 = Grek lom(25,u) Ne r—a-| (wds) - Nez~e-| de) =e Ad enk n=nk-t eg. (neal=-¢ (wd s) te 32-4 (md 7) Ns 2e-F (du) Gasst rahe of A n+¢= Tk n= ase-¥ bet. nsal.~ bee bey ne ED Pre ARENA ORNED, ATOM ORRR, RUAN Ta rrORRR eg. cnetla-2 (mod 1>) Ne &=-2, (md 1) Fad bast value fn Now =to] n= 66. x nels-4, (md $) nvuegik onthe ka x les R=3 fe2Ti ene ee gee, = (md 5 “eophee wndina deat © 1 a=b(eodm), c=d(modm), thenade=b-d (mod m). @ es8inoimy edn), ten Bae ssied (esl) = ac=bd (mod m) a= bn (modm), where mis integer Bebe (mds) dB 0d m) tenn loa Ih (mds) Classin > 5 [DO = [ob (md s) = d=B (modm) DRAMAFER, BAMA. i. TR. RA. BRIE What is the last digit of 9! (a1)' = 92 (adie) Tats 4 =(to-) (10-12 9 (me 10) fecu™2 I> (do) (1) = _— (kta) Find the last digit of 9". qP=(e-)P aC = 17 (md) 2)” =(@-)” Example 6: When two different numbers are divided by 7, remainders of 2 and 3, respectively, are left. What is the remainder when the sum of these two numbers is divided by 7? Q=2 (mad 7) b=3 G7) a= Tk+2 beTrt3. » atb =T(k+r) +5 Example 9: (AMC) For each integer N> 1, there is a mathematical system in which two or more integers are defined to be congruent if they leave the same non-negative remainder when divided by Nf 69, 90, and 125 are congruent in one such system, then Js that ens epson, 81 i congruent oO OF OS O7 ws 6J= forms (mod n) 4 -6f zo (ned) m5-foz 0 ee Bl= Cv) (dg) ” n=) lf asb (mdr) > a-beO (md n) 1.3 Pattern and Exploration Problem 12:19 Find the remainder when 5° i divided by 7. j Solution for Problem 12.19: We begin by finding the modulo 7 residues of some smaller powers of 5 as : (1-2) = s*° (nd 7) say ‘i There are only 6 nonzero modulo 7 residues. Eventual. one Classin > 6 5 a 3 a “ " © ie ‘There are only 6 nonzero modulo 7 residues. Eventually, one = ‘of them repeats. The product of5 times any specific modulo 7 residue never changes. So, when one residue repeats, all subse- quent residues sepeyt as wel, forming a pattern. ‘Pgs if A “oe @2)* = (Goes) 2.25 (Hh 7) 4 ee (wd) Bb (wt) ber ad b¥e | [Problem 12.20: Find the remainder when 4! - 19" is divided by 9. J 48% = 4 (md 7) +” <3 @)ecaphyeantyt OL 9) FP (esi Ged) 2. Fermat’s theorem and Euler’s theorem a ( 2.1 Fermat's theorem Given a prime p and a not divisible by p, then a”' = 1 (mod p). (a.p3) pT aes) 21 Ged) so =I (med 2) lets ae tcuclad Go 7 aay Pisdividedby7) 55 (56) 6 sas (uy) 20S =6%33% +| eg. Ts (red. u) Classin > 7 eg. 72 edu) TP =| (elt) 2 p> a(py 17 (met 1) = (-4)* ersh | (mel w) asytd 22 (411) “PRNVERRIMIE: RRR, MRMAA, ERR 2.2Euler’s theorem = (FHERGMRANHM, LAA NKABREM) Let (a, n) = 1 (a and m relatively prime): d&=1 (mod n) (n) is the number of positive integers not exceeding n and relative prime to n. If n= pf: p! + pi isthe factorization of n into distinct primes, then 9= (PE PEN eE = PEPE =P) Plo) Euler's detract flachor a a ee boy = (pe pi) -¢ph-pit) . -- pt-pt) eg. n=w=2ss gen) ~@2-2') x(5'-s) =(W-2) x (Sa)= 2ep-¥ uoa-4 4 a) y $e). fo-T qa! eta ae) (md n) eg mts (amd 32) g2= 2 Po 2% = (6 > 52] (Ad 2) I26 ih )2¥ 20g = Ibxnb TB a a Toe 1a hed neo aon! 2 she Classin > 8 ——_ yoy isi es) “137 2 6? (nd 20) us)* 2 (phe) (mel 32) nas 32.4 ages: a,p aR, P% Fie or imme: ain BI, na @ofade. af a1 (wd 0) $ny= (ph ph) = (Pa pbs) | LEPINE BEE: HATA BRT ORL Today is Sunday. What day is 10' days from today? ny 4 @) 57-7" 26 Ws fo%et mt), CJo®): fo = [oF (mel 2) o ~ @ = 3t Sindy se 3* (md 2) = ale 4 (4) 3. Special numbers and digits 3.1 Pactorials vs primes Problem 64: Find the largest prime of eau) 5l+6'=s!+6 st = sl (+h) = 7-3! Find the largest prime divisorof 30 | +32 ! 32 30! +32! =30!(1 +5031) 31 23 EB . 36" 672 NABER, SAMprime factorBRRtin/ ARATE 3.2 Palindromes (==) ADCbo. —MFORERS, SBMA, mA (thetepalindrome e@-4 ul. Ss & si (YY -.- Classin > 9 Sfp ln Ee 7B y als WL, « Ta ‘eon (©) How many two-digit palindromes are prime? ), n, ---- t aba asin > fe b= o~f Problem 611: The prodiict of two poaltive three-digit palindromes ls 436995, What Is thelr sum? (Gource: MATHCOUNTS) Sad Ib! 436995 = 3'. 5! 13! 8a! oe ybs obs Bos = 3% 5 -D-8h ab? . * IS Sb 9 Px . ates! = 249 AF stag! = 415 3.43! = 747 is Classin. - 10

You might also like