hes WAN PIEGON HOLE PRINCIPLE (N+ 1) oF more we placed to N boxes then here Example : I 6 colour are used to paint 37 home. Show that ‘solution but remainder 1 wi bea colour frm the 6 © easypaisa - Payments Made.. TCE NA J Ad: 4.5% FREE tee Discrete Mathematics Lecture 7 | What is Pigeon Hole Principle | Pigeon Principle By ... 314K views 1y ago Engineering Mathematics ...more 2 Dr.Gajendra Purohit 1.23M ov 63K GD AShare Remix 4 Download Comments 191 @ sir greatest integer value will give floor value and not ceiling. [1.5]=1,not 2. am i right sir?GENERALIZED PIGEON HOLE PRINCIPLE f'n’ pigeon hole are occupied by kn+1 or more pigeons then atleast one pigeonhole is occupied by k + 1 or more pigeon Find the minimum number of teachers in a college to be sure that four of them are born in the same month. Solution : n=12,k+1=4 i —_———dGENERALIZED PIGEON HOLE PRINCIPLE f'n’ pigeon hole are occupied by kn+1 or more pigeons then atleast one pigeonhole is occupied by k + 1 or more pigeon. Find the minimum number of teachers in a college to be sure that four of them are born in the same month. Solution : n= 12,k+1=425k net =12x3+1=37 MeeeDefinition 2.1 if an integer m, not zero, divides the difference a — b, we say that a is congruent t0 b modulo m and write a = b (mod m). If a — b is not divisible by m, we say that a is not congruent to b modulo m, and in this case we write a # b (mod m). Since a — b is divisible by m if and only if a — b is divisible by —m, we can generally confine our attention to a positive modulus. Indeed, we shall assume throughout the present chapter that the modulus m is a positive integer. Congruences have many properties in common with equalities. Some properties that follow easily from the definition are listed in the following theorem. Theorem 2.1 Leta, b,c,d denote integers. Then: (1) a = b(mod m), b = a (mod m), and a — b equivalent statements. (2) If a = b(mod m) and b = c(mod m), then a = c (mod m). (mod m) are (3) Ifa (mod m), then a + c = b + d(mod m), (4) Ifa d (mod m), then ac = bd (mod m). (5) If a = b(mod m) and d\m,d > 0, then (mod d). (6) If @ = b(mod m) then ac = bc (mod me) for ¢ > 0. Theorem 2.2 Let f denote a polynomial with integral coefficients. If a = b (mod m) then f(a)Divisibility Rules Anumber is divisible by If last digit is 0, 2, 4, 6, or 8 If the sum of the digits is divisible by 3 If the last two digits is divisible by 4 If the last digit is O or 5 If the number is divisible by 2 and 3 sloalalalwlrn cross off last digit, double it and subtract. Repeat if you want. If new number is divisible by 7, the original number is divisible by 7 If last 3 digits is divisible by 8 If the sum of the digits is divisible by 9 10 If the last digit is O 11 Subtract the last digit from the number formed by the remaining digits. If new number is divisible by 11, the original number is divisible by 11 12 If the number is divisible by 3 and 44:46 PM | 1.7KB/s Zi ral tll GD! X — @ Divisibility Rules (Tests) —- ff: ‘mathsisfun.com @x! Any integer (not a fraction) is divisible by 1 2Q The last digit is even (0,2,4,6,8) =P 128 Yes SP 129 No 3 The sum of the digits is divisible by 3 381 (3+8+1=12, and 123 = 4) Yes p> 217 (2414710, and 10#3 = 3 1/2) No This rule can be repeated when needed: 99996 (9+9+9+9+6 = 42, then 4+2=6) Yes2:54 PM | 0.7KB/s wall at! GD v 5 The sum of the digits is divisible by 3 => 381 (3+8+1=12, and 123 = 4) Yes n> 217 (2414710, and 103 = 3 1/3) No This rule can be repeated when needed: 99996 (9+9+9+9+6 = 42, then 4+2=6) Yes A\ The last 2 digits are divisible by 4 eo 1312 is (12+4=3) Yes = 7019 is not (19+4=4 3/4) No We can also subtract 20 as many times as we want before checking: 68: subtract 3 lots of 20 and we get 8 Yes 102: subtract 5 lots of 20 and we get 2 No Another method is to halve the number twice and see if the result is still a whole number: 124/2 = 62, 62/2 = 31, and 31isa whole number. Yes s © <4:46 PM | 8.5KB/s Zi Sal ati] GD oN ry} The last 2 digits are divisible by 4 em) 1312 is (12+4=3) Yes ee 7019 is not (19+4=4 3/4) No We can also subtract 20 as many times as we want before checking 68: subtract 3 lots of 20 and we get 8 Yes 102: subtract 5 lots of 20 and we get 2No Another method is to halve the number twice and see if the result is still a whole number: 124/2 = 62, 62/2 = 31, and 31 isa whole number. Yes 30/2 = 15, 15/2 = 7.5 which is not a whole number. No 5 The last digit is 0 or 5 = 175 Yes = 809 No s © <4:46 PM | 0.3KB/s Zi Fall «ati! GO oN 5 The last digit is 0 or 5 = 175 Yes = 809 No @ Is even and is divisible by 3 (it passes both the 2 rule and 3 rule above) 114 (it is even, and 14+1+4=6 and 63 = 2) Yes 308 (it is even, but 3+0+8=11 and 1143 = 3 2/,) No 7 Double the last digit and subtract it from a number made by the other digits. The result must be divisible by 7. (We can apply this rule to that answer again) 672 (Double 2 is 4, 67-4=63, and 63+7=9) Yes 105 (Double 5 is 10, 10-10=0, and 0 is divisible by 7) Yes 905 (Double 5 is 10, 90-10=80, and 80+7=11 3/7) No4:47 PM | 0.0KB/s Zi Fall ati! GD 905 (Double 5 is 10, 90-10=80, and 80+7=11 3/7) No 8 The last three digits are divisible by 8 pp 109816 (816+8=102) Yes em 216302 (302+ 37 3/4) No A quick check is to halve three times and the result is still a whole number: 816/2 = 408, 408/2 = 204, 204/2 = 102 Yes em 302/2 = 151, 151/2 = 75.5 No ® The sum of the digits is divisible by 9 (Note: This rule can be repeated when needed) 1629 (1+6+2+9=18, and again, 1+8=9) Yes > 2013 (2+0+1+3=6) No s © <4:47 PM | 0.8KB/s Zi ual ati! GO! @x oN ® The sum of the digits is divisible by 9 (Note: This rule can be repeated when needed) 1629 (1+6+2+9=18, and again, 1+8=9) Yes > 2013 (2+0+1+3=6) No 10 The number ends in 0 = 220 Yes = 221 No 1 q Add and subtract digits in an alternating pattern (add digit, subtract next digit, add next digit, etc). Then check if that answer is divisible by 11 > 1364 (+1-346-4 = 0) Yes > 913 (49-143 = 11) Yes > 3729 (+3-74+2-9 = -11) Yes > 987 (+9-8+7 = 8) No s © <4:47 PM | 0.0KB/s Zi Fall atl! GO X — @ Divisibility Rules (Tests) —- ff: ‘mathsisfun.com @x a q q Add and subtract digits in an alternating pattern (add digit, subtract next digit, add next digit, etc). Then check if that answer is divisible by 11. <> 1364 (+1-3+6-4 = 0) Yes > 913 (49-143 = 11) Yes > 3729 (+3-7+2-9 = -11) Yes > 987 (+9-8+7 = 8) No q 2 The number is divisible by both 3 and 4 (it passes both the 3 rule and 4 rule above) 648 (By 3? 6+4+8=18 and 18+3=6 Yes) (By 4? 48+4=12 Yes) Both pass, so Yes 524 (By 3? 5+2+4=11, 11+3= 3 2/3 No) (Don't need to check by 4) No ~ s © <PACE Aa Te) The Chinese Remainder Theorem (CRT) is used to solve eae jh one variable but different moduli which are relatively en Pen Earn Description x The Chinese Remainder Theorem (Solved Example 1) AIK 281,384 2021 Likes Nov 7 Cryptography & Network Security #NetworkSecurityByNeso + Network Security: The Chinese Remainder Theorem (Solved Example 1) Topics discussed: 1) Chinese Remainder Theorem (CRT) statement and explanation of all the fields involved in the theorem. 2) Explanation of working of CRT with different moduli that are relatively prime. 3) Solved Example 1 on finding the common variable ‘x’ using CRT with 3 different congruent equations. 4) Explanation on how to verify the final result obtained. Follow Neso Academy on Instagram: @nesoacademy (https://bit.ly/2XP630E) Contribute: https://www.nesoacademy.org/donateTe RCE rea) See ec em rere : eae ee ee eee ee eet ee ae Cee 1 Description x The Chinese Remainder Theorem (Solved Example 1) AIK 281,384 2021 Likes Nov 7 Cryptography & Network Security #NetworkSecurityByNeso + Network Security: The Chinese Remainder Theorem (Solved Example 1) Topics discussed: 1) Chinese Remainder Theorem (CRT) statement and explanation of all the fields involved in the theorem. 2) Explanation of working of CRT with different moduli that are relatively prime. 3) Solved Example 1 on finding the common variable ‘x’ using CRT with 3 different congruent equations. 4) Explanation on how to verify the final result obtained. Follow Neso Academy on Instagram: @nesoacademy (https://bit.ly/2XP630E) Contribute: https://www.nesoacademy.org/donatePee etna) SSonCre Ln) cer) Pet ED Ee My, The Chinese Remainder Theorem (Solved Example 1) 281K vie 1y ago Cryptography & Network Security ...more a Neso Academy 2.22M Oy bo 4x BD A> Share & Remix a Download Comments 127 please complete discrete mathematics and computer ‘organisation and architecture ASAP v Play Games with Friends Play Free Games with Fri a 0} <eSB EL9 ar else Le kt) Chapters x Chinese Remainder Theorem 0:35 Solved Example 1 3:17 Finding the given data 417 Finding the values Pa edincetl ie 13:57 s © < 6:29CEE ECLA a elas ae Uk 2) M= M, My= Chapters x Chinese Remainder Theorem 0:35 Solved Example 1 3:17 Finding the given data 417 Finding the values — 6:29 Outro ered 13:57 a 0} <PEER CIE 0 ar eal ase re Uk) ee nx Ma ee ene Pe ee Ee Peete re eee) ree ncr Mi Ms! Chapters x Chinese Remainder Theorem 0:35 Solved Example 1 3:17 Finding the given data 417 Finding the values — 6:29 ted on 13:57 a 0} <DEER CIES Mia Rela uae ale kt) Se en eee een Peers) ae Po) cr) re ONE eee) Cre Eee Ree ced eed Chapters x Chinese Remainder Theorem 0:35 Solved Example 1 3:17 Finding the given data 417 Finding the values — 6:29 Outro ered 13:57 a 0} <Spee Ee) 2 l4y x & se short trick to find (1001) and ©(5040)| euler's phi function | number theory 7.1K views 2y ago competitive exams| NDA|GATE|JEE |) ...more @ Kamaldeep Nijjar 34.5 e&> O17 B > Share & Remix 2 Download Comments 23 @ rad 2comment.. 3 Tae nares ee merle ened (240) (720) (5040) (1000) Number Theory ERS eNom eee cm et Kamaldeep Nijjar important results of Euler's phi function | #phifunction |#numbertheory s © <