‫ﺍﻟﺠﺯﺀ ﺍﻷﻭل‪ :‬ﺍﻟﺒﻨﻰ ﺍﻟﺠﺒﺭﻴﺔ ‪Alegebric Structures‬‬

‫ﺍﻟﻔﺼل ﺍﻟﺜﺎﻨﻲ‬
‫ﻤﺠﻤﻭﻋﺔ ﺍﻷﻋﺩﺍﺩ ﺍﻟﻁﺒﻴﻌﻴﺔ‬

‫‪ .1‬ﺍﻟﺨﻭﺍﺹ ﺍﻷﺴﺎﺴﻴﺔ ﻟـ‬

‫‪ ،‬ﻭﺍﻟﻤﻌﺭﻑ ﻋﻠﻴﻬﺎ ﻋﻼﻗﺔ ﺍﻟﺘﺭﺘﻴﺏ ﺍﻟﺘﺎﻟﻴﺔ‪:‬‬ ‫ﺇﻥ ﻤﺠﻤﻭﻋﺔ ﺍﻷﻋﺩﺍﺩ ﺍﻟﻁﺒﻴﻌﻴﺔ ‪،‬‬

‫∈ ) ‪∀(n , m‬‬ ‫‪2‬‬

‫‪; n ≤ m ⇔ ∃k ∈ ; m = n + k‬‬

‫ﺘﺤﻘﻕ ﺍﻟﺨﻭﺍﺹ ﺍﻟﺘﺎﻟﻴﺔ‪:‬‬

‫⊂ ‪ A‬ﻓﻴﻬﺎ ﺃﺼﻐﺭ ﻋﻨﺼﺭ‪:‬‬ ‫‪ - P1‬ﻜل ﻤﺠﻤﻭﻋﺔ ﺠﺯﺌﻴﺔ ﻏﻴﺭ ﺨﺎﻟﻴﺔ‬

‫‪∃a ∈ A; ∀x ∈ A; a ≤ x‬‬

‫⊂ ‪ A‬ﻭﺍﻟﺘﻲ ﻟﻬﺎ ﻋﻨﺼﺭﹰﺍ ﺭﺍﺠﺤﹰﺎ ﻓﻴﻬﺎ ﺃﻜﺒﺭ ﻋﻨﺼﺭ‪:‬‬ ‫‪ - P2‬ﻜل ﻤﺠﻤﻭﻋﺔ ﺠﺯﺌﻴﺔ ﻏﻴﺭ ﺨﺎﻟﻴﺔ‬
‫‪∃b ∈ A; ∀x ∈ A; x ≤ b‬‬

‫⊂ ‪ A‬ﺘﺤﻘﻕ ﺍﻟﺸﺭﻁ ﺍﻟﺘﺎﻟﻲ‪:‬‬ ‫‪ - P3‬ﺇﺫﺍ ﻜﺎﻨﺕ‬

‫)‪(0 ∈ A) ∧ (∀n ∈ N , n ∈ A ⇒ (n + 1) ∈ A‬‬

‫=‪A‬‬ ‫ﻋﻨﺩﺌﺫ‬

‫ﺇﻥ ﺍﻟﺨﺎﺼﺔ ‪ P3‬ﺘﺴﻤﻰ »ﺒﺩﻴﻬﻴﺔ ﺍﻟﺘﺩﺭﻴﺞ«‪.‬‬

‫ﻤﻼﺤﻅﺎﺕ‬

‫∈ ‪ ∃ a‬ﺒﺤﻴﺙ ‪ ∀x ∈ A‬ﻓﺈﻥ ‪. x ≤ a‬‬ ‫ﻟﻴﺱ ﻓﻴﻬﺎ ﺃﻜﺒﺭ ﻋﻨﺼﺭ‪ .‬ﻟﻨﻔﺭﺽ ﺍﻟﻌﻜﺱ ﺃﻱ‬ ‫‪ y‬ﺇﻥ‬
‫∈ )‪ (a + 1‬ﻷﻥ ‪ a ∈ N‬ﻭ ‪ a ≤ a + 1‬ﺇﺫﻥ ﻓﺭﻀﻨﺎ ﺨﺎﻁﺊ‪.‬‬ ‫ﻟﻜﻥ ﺤﺴﺏ ﺍﻟﺨﺎﺼﺔ ‪ P3‬ﻓﺈﻥ‬

‫‪1‬‬
 ‫ﻓﻴﻬﺎ ﺃﺼﻐﺭ ﻋﻨﺼﺭ ﻭﺫﻟﻙ ﺤﺴﺏ ‪P1‬‬ ‫‪ y‬ﻜل ﻤﺠﻤﻭﻋﺔ ﺠﺯﺌﻴﺔ ﻤﺅﻟﻔﺔ ﻤﻥ ﻋﻨﺼﺭﻴﻥ ﻤﻥ‬
‫ﺒـ ≤ ﻭ ﻨﺭﻤﺯ ﺒـ ‪ x < y‬ﻟﻠﺩﻻﻟﺔ ﻋﻠﻰ‬ ‫ﻤﺭﺘﺒﺔ ﻜﻠﻴﹰﺎ ﻭﻨﺭﻤﺯ ﻟﻌﻼﻗﺔ ﺍﻟﺘﺭﺘﻴﺏ ﻓﻲ‬ ‫ﻭﺒﺎﻟﺘﺎﻟﻲ‬
‫ﺃﻥ ) ‪. ( x ≤ y ) ∧ ( x ≠ y‬‬

‫∈ ‪ ، n‬ﻨﺴﻤﻲ ﺍﻟﻌﻨﺼﺭ ‪ n + 1‬ﺒﺎﻟﻌﻨﺼﺭ ﺍﻟﻼﺤﻕ ﻟـ ‪ n‬ﻭ ‪ n − 1‬ﺍﻟﻌﻨﺼﺭ ﺍﻟﺴﺎﺒﻕ ﻟـ ‪. n‬‬ ‫‪ y‬ﻟﻴﻜﻥ‬

‫ﻜﺫﻟﻙ ﺍﻟﻤﺠﻤﻭﻋﺔ }‪ {a ∈ ; n < a < n + 1‬ﻫﻲ ﻤﺠﻤﻭﻋﺔ ﺨﺎﻟﻴﺔ‪.‬‬

‫ﻤﺒﺭﻫﻨﺔ )ﻤﺒﺩﺃ ﺍﻟﺘﺩﺭﻴﺞ(‬

‫ﻭﻟﻨﻔﺭﺽ ﺃﻥ‪:‬‬ ‫ﺇﺫﺍ ﻜﺎﻨﺕ )‪ P(n‬ﻗﻀﻴﺔ ﺘﺘﻌﻠﻕ ﺒﻤﺠﻤﻭﻋﺔ ﺍﻷﻋﺩﺍﺩ ﺍﻟﻁﺒﻴﻌﻴﺔ‬

‫) ‪ P(n0‬ﺼﺤﻴﺤﺔ ; ∈ ‪ ∃n 0‬ﻭ )‪∀n ≥ n0 ; P(n) ⇒ P(n + 1‬‬

‫ﻋﻨﺩﺌﺫ )‪ P(n‬ﺼﺤﻴﺤﺔ ﻤﻥ ﺃﺠل ﺃﻱ ﻋﺩﺩ ﻁﺒﻴﻌﻲ ‪. n ≥ n0‬‬

‫ﺍﻹﺜﺒﺎﺕ‪:‬‬

‫ﻟﺘﻜﻥ }) ‪ P ( m‬ﺧ ﺎﻃ ﺌﺔ ∧ ) ‪ B = {m ∈ ;(m ≥ n 0‬ﺇﺫﺍ ﻓﺭﻀﻨﺎ ﺃﻥ ∅ ≠ ‪ B‬ﻓﻔﻴﻬﺎ ﺃﺼﻐﺭ ﻋﻨﺼﺭ‬

‫ﺤﺴﺏ ﺍﻟﺨﺎﺼﺔ ‪ P1‬ﻭﻟﻴﻜﻥ ﻫﺫﺍ ﺍﻟﻌﻨﺼﺭ ﻫﻭ ‪ l‬ﺇﺫﻥ ‪ n 0 ≤ l‬ﻫﻭ ﺃﺼﻐﺭ ﻋﺩﺩ ﻁﺒﻴﻌﻲ ﺘﻜﻭﻥ ﻤﻥ ﺃﺠﻠﻪ‬
‫) ‪ P(l‬ﺨﺎﻁﺌﺔ‪.‬‬

‫ﻟﻨﻔﺭﺽ ﺃﻥ ‪ k‬ﻫﻭ ﺍﻟﻌﺩﺩ ﺍﻟﻁﺒﻴﻌﻲ ﺍﻟﺴﺎﺒﻕ ﻤﺒﺎﺸﺭﺓ ﻟـ ‪ l‬ﺃﻱ ‪ n0 ≤ k < l‬ﻋﻨﺩﺌﺫ ) ‪ P(k‬ﺼﺤﻴﺤﺔ‬
‫ﻭﺤﺴﺏ ﺍﻟﻔﺭﺽ ﺍﻟﺜﺎﻨﻲ ﻤﻥ ﻫﺫﻩ ﺍﻟﻤﺒﺭﻫﻨﺔ ﻓﺈﻥ )‪ P(k + 1‬ﺼﺤﻴﺤﺔ ﻭﻟﻜﻥ ‪ k + 1 = l‬ﻭﻫﺫﺍ ﻤﺎ‬
‫ﻴﻨﺎﻗﺽ ﺍﻟﻔﺭﺽ ﺇﺫﻥ ﻓﺭﻀﻨﺎ ﺨﺎﻁﺊ ﻭﺒﺎﻟﺘﺎﻟﻲ ∅ = ‪ B‬ﻭ )‪ P(n‬ﺼﺤﻴﺤﺔ ﻤﻥ ﺃﺠل ﺃﻱ ‪. n 0 ≤ n‬‬

‫ﻤﺜﺎل‬

‫∈ ‪ n‬ﻓﺈﻥ‪:‬‬ ‫ﺃﺜﺒﺕ ﺒﻁﺭﻴﻘﺔ ﺍﻟﺘﺩﺭﻴﺞ ﺃﻨﻪ ﻤﻥ ﺃﺠل ﻜل ﻋﺩﺩ ﻁﺒﻴﻌﻲ‬

‫‪n‬‬
‫)‪n(n + 1)(2n + 1‬‬
‫= ‪12 + 2 2 + ......... + n 2 = ∑ k 2‬‬
‫‪k =1‬‬ ‫‪6‬‬

‫ﺍﻟﺤل‪:‬‬

‫ﻤﻥ ﺃﺠل ‪ n0 = 1‬ﻨﺠﺩ ﺃﻥ‪:‬‬

‫‪n0 (n0 + 1)(2n0 + 1) 1.2.3 6‬‬
‫=‬ ‫‪= = 1 = 12‬‬
‫‪6‬‬ ‫‪6‬‬ ‫‪6‬‬

‫‪2‬‬
 ‫ﻟﻨﻔﺭﺽ ﺃﻥ ﺍﻟﻘﻀﻴﺔ ﻤﺤﻘﻘﺔ ﻤﻥ ﺃﺠل ‪ n0 ≤ n‬ﻭﻟﻨﺜﺒﺕ ﺃﻨﻬﺎ ﺼﺤﻴﺤﺔ ﻤﻥ ﺃﺠل ‪ n + 1‬ﻋﻨﺩﺌﺫ‪:‬‬
‫‪n +1‬‬

‫‪∑k‬‬
‫‪k =1‬‬
‫‪2‬‬
‫‪= 12 + 2 2 + ....... + n 2 + (n + 1) 2‬‬ ‫⇒‬

‫‪n +1‬‬
‫)‪n(n + 1)(2n + 1‬‬ ‫‪n(n + 1)(2n + 1) + 6(n + 1) 2‬‬
‫= ‪∑k2‬‬
‫‪k =1‬‬ ‫‪6‬‬
‫= ‪+ (n + 1) 2‬‬
‫‪6‬‬
‫]‪(n + 1)[n(2n + 1) + 6n + 6‬‬
‫=‬
‫‪6‬‬
‫]‪(n + 1)[2n 2 + n + 6n + 6‬‬
‫=‬
‫‪6‬‬
‫)‪(n + 1)(2n + 7 n + 6‬‬
‫‪2‬‬
‫=‬
‫‪6‬‬
‫‪n +1‬‬
‫)‪(n + 1)(n + 2)(2n + 3‬‬
‫= ‪⇒ ∑k2‬‬
‫‪k =1‬‬ ‫‪6‬‬

‫∈‪.n‬‬ ‫ﺇﺫﻥ )‪ P(n + 1‬ﺼﺤﻴﺤﺔ ﻭﺒﺎﻟﺘﺎﻟﻲ )‪ P(n‬ﺼﺤﻴﺤﺔ ﻤﻥ ﺃﺠل ﻜل‬

‫‪ .2‬ﺍﻟﻤﺠﻤﻭﻋﺎﺕ ﺍﻟﻤﻨﺘﻬﻴﺔ‬
‫‪.‬‬ ‫‪n‬‬ ‫ﻟﻴﻜﻥ ‪ n‬ﻋﺩﺩ ﻁﺒﻴﻌﻲ ﻨﺭﻤﺯ ﻟﻠﻤﺠﻤﻭﻋﺔ } ‪ {k ∈ ; 1 ≤ k ≤ n‬ﺒﺎﻟﺭﻤﺯ‬

‫ﺘﻌﺭﻴﻑ‬

‫‪ y‬ﻟﺘﻜﻥ ‪ E‬ﻤﺠﻤﻭﻋﺔ ﻤﺎ ﻨﻘﻭل ﺃﻥ ‪ E‬ﻤﻨﺘﻬﻴﺔ ﺇﺫﺍ ﻭﻓﻘﻁ ﺇﺫﺍ ﻭﺠﺩ ﻋﺩﺩ ﻁﺒﻴﻌﻲ ‪ n ≠ 0‬ﻭﺘﻘﺎﺒل‬
‫→ ‪.f :E‬‬ ‫‪n‬‬

‫‪ y‬ﻨﺴﻤﻲ ‪ n‬ﻓﻲ ﻫﺫﻩ ﺍﻟﺤﺎﻟﺔ ﺒﺭﺌﻴﺱ ﺍﻟﻤﺠﻤﻭﻋﺔ ‪ E‬ﻭﻨﺭﻤﺯ ﻟﻪ ﺒـ ‪. Card ( E ) = n‬‬

‫‪ y‬ﻨﺼﻁﻠﺢ ﺃﻥ ‪) φ‬ﺍﻟﻤﺠﻤﻭﻋﺔ ﺍﻟﺨﺎﻟﻴﺔ( ﻫﻲ ﻤﺠﻤﻭﻋﺔ ﻤﻨﺘﻬﻴﺔ ﻭﺃﻥ ‪Card (∅) = 0‬‬

‫‪ y‬ﻨﻘﻭل ﻋﻥ ﺍﻟﻤﺠﻤﻭﻋﺔ ‪ E‬ﺃﻨﻬﺎ ﻻ ﻨﻬﺎﺌﻴﺔ ﺇﺫﺍ ﻟﻡ ﺘﻜﻥ ﻤﻨﺘﻬﻴﺔ‪.‬‬

‫ﺇﻥ ﺍﻟﺭﻤﻭﺯ ﺍﻟﺘﺎﻟﻴﺔ ) ‪ Card ( E‬ﻭ ‪ # E‬ﻭ ‪ E‬ﺘﺴﺘﺨﺩﻡ ﻟﻠﺩﻻﻟﺔ ﻋﻠﻰ ﺭﺌﻴﺱ ﺍﻟﻤﺠﻤﻭﻋﺔ ‪E‬‬

‫‪ -1‬ﺨﻭﺍﺹ ﺍﻟﻤﺠﻤﻭﻋﺎﺕ ﺍﻟﻤﻨﺘﻬﻴﺔ‬

‫ﻨﺫﻜﺭ ﻫﺫﻩ ﺍﻟﺨﻭﺍﺹ ﺩﻭﻥ ﺒﺭﻫﺎﻥ ﻨﻅﺭﹰﺍ ﻟﺴﻬﻭﻟﺘﻬﺎ‪.‬‬

‫‪ -1‬ﻤﺒﺭﻫﻨﺔ‬

‫‪3‬‬
 ‫∈ ) ‪ (m , n‬ﺤﻴﺙ ‪ m ≠ 0‬ﻭ ‪ n ≠ 0‬ﻋﻨﺩﺌﺫ‪:‬‬ ‫‪2‬‬
‫ﻟﻴﻜﻥ‬

‫‪ ∃f :‬ﺤﻴﺙ ‪ f‬ﻤﺘﺒﺎﻴﻥ‪.‬‬ ‫‪m‬‬ ‫→‬ ‫‪n‬‬ ‫‪⇔m ≤n y‬‬

‫‪ ∃f :‬ﺤﻴﺙ ‪ f‬ﻏﺎﻤﺭ‪.‬‬ ‫‪m‬‬ ‫→‬ ‫‪n‬‬ ‫‪⇔m ≥n y‬‬

‫‪ ∃ f :‬ﺤﻴﺙ ‪ f‬ﺘﻘﺎﺒل‪.‬‬ ‫‪m‬‬ ‫→‬ ‫‪n‬‬ ‫‪⇔m =n y‬‬

‫‪ -2‬ﻭﺤﺩﺍﻨﻴﺔ ﺭﺌﻴﺱ ﻤﺠﻤﻭﻋﺔ ﻤﻨﺘﻬﻴﺔ‪:‬‬

‫ﺇﺫﺍ ﻜﺎﻨﺕ ‪ E‬ﻤﺠﻤﻭﻋﺔ ﻤﻨﺘﻬﻴﺔ ﻓﺈﻥ ) ‪ n = Card ( E‬ﻭﺤﻴﺩ‪.‬‬

‫‪ -3‬ﺇﺫﺍ ﻜﺎﻨﺕ ‪ F‬ﻤﺠﻤﻭﻋﺔ ﻤﻨﺘﻬﻴﺔ ﻭ ‪ E‬ﻤﺠﻤﻭﻋﺔ ﻤﺎ‪ .‬ﺇﺫﺍ ﻭﺠﺩ ﺍﻟﺘﻁﺒﻴﻕ ﺍﻟﻤﺘﺒﺎﻴﻥ ‪ f : E → F‬ﻓﺈﻥ‬
‫‪ E‬ﻤﺠﻤﻭﻋﺔ ﻤﻨﺘﻬﻴﺔ ﻭﻴﻜﻭﻥ ) ‪Card ( E ) ≤ Card ( F‬‬

‫‪ -4‬ﺇﺫﺍ ﻜﺎﻨﺕ ‪ E‬ﻤﺠﻤﻭﻋﺔ ﻤﻨﺘﻬﻴﺔ ﻭﻟﻴﻜﻥ ‪ f : E → F‬ﺘﻁﺒﻴﻘ ﹰﺎ ﻏﺎﻤﺭﹰﺍ ﻓﺈﻥ ‪ F‬ﻤﺠﻤﻭﻋﺔ ﻤﻨﺘﻬﻴﺔ‬
‫ﻭ ) ‪. Card ( F ) ≤ Card ( E‬‬

‫‪ -2‬ﺘﻌﺭﻴﻑ‬
‫ﻨﻘﻭل ﻋﻥ ﺍﻟﻤﺠﻤﻭﻋﺘﻴﻥ ‪ F‬ﻭ ‪ E‬ﺃﻥ ﻟﻬﻤﺎ ﻨﻔﺱ ﺍﻟﻘﺩﺭﺓ ﺇﺫﺍ ﻭﻓﻘﻁ ﺇﺫﺍ ﻭﺠﺩ ﺘﻘﺎﺒل ﺒﻴﻨﻬﻤﺎ‪ .‬ﻭﻨﺭﻤﺯ‬
‫ﻟﺫﻟﻙ ﺒـ ‪. E ≈ F‬‬

‫ﻨﺘﻴﺠﺔ‪:‬‬
‫ﻟﻠﻤﺠﻤﻭﻋﺘﻴﻥ ﺍﻟﻤﻨﺘﻬﻴﺘﻴﻥ ‪ E‬ﻭ ‪ F‬ﻨﻔﺱ ﺍﻟﻘﺩﺭﺓ ﺇﺫﺍ ﻭﻓﻘﻁ ﺇﺫﺍ ﻜﺎﻥ ﻟﻬﻤﺎ ﻨﻔﺱ ﺍﻟﺭﺌﻴﺱ ﺃﻱ ﺃﻥ‬
‫) ‪E ≈ F ⇔ Card ( E ) = Card ( F‬‬

‫‪ .3‬ﻁﺭﺍﺌﻕ ﺍﻟﻌﺩ‬
‫ﻓﻴﻤﺎ ﻴﻠﻲ ﺴﻨﺫﻜﺭ ﺒﺒﻌﺽ ﻁﺭﺍﺌﻕ ﺍﻟﻌﺩ ﺃﻭ ﻤﺎ ﻴﺴﻤﻰ ﺃﻴﻀﹰﺎ ﺒﺎﻟﺘﺤﻠﻴل ﺍﻟﺘﻭﺍﻓﻘﻲ ﻭﺫﻟﻙ ﻨﻅﺭﹰﺍ ﻷﻫﻤﻴﺘﻬﺎ‬
‫ﻓﻲ ﺤﺴﺎﺏ ﻋﺩﺩ ﻋﻨﺎﺼﺭ ﻤﺠﻤﻭﻋﺔ ﻤﻨﺘﻬﻴﺔ‪.‬‬

‫ﻤﺒﺭﻫﻨﺔ‬
‫‪ -1‬ﺇﺫﺍ ﻜﺎﻨﺕ ‪ F , E‬ﻤﺠﻤﻭﻋﺘﻴﻥ ﻤﻨﺘﻬﻴﺘﻴﻥ ﻭﻤﻨﻔﺼﻠﺘﻴﻥ )∅ = ‪ (E ∩ F‬ﻓﺈﻥ ‪ E ∪ F‬ﻤﺠﻤﻭﻋﺔ‬
‫ﻤﻨﺘﻬﻴﺔ ﻭ ) ‪. Card ( E ∪ F ) = Card ( E ) + Card ( F‬‬

‫‪ P = ( A1 , A2 ,‬ﺘﺠﺯﺌﺔ ﻟﻠﻤﺠﻤﻭﻋﺔ ‪ E‬ﺍﻟﻤﻨﺘﻬﻴﺔ ﻓﺈﻥ‪:‬‬ ‫‪ -2‬ﺒﺸﻜل ﻋﺎﻡ ﺇﺫﺍ ﻜﺎﻨﺕ ) ‪, A p‬‬

‫‪4‬‬
 ‫) ‪Card ( E ) = Card ( A1 ) + Card ( A1 ) + Card ( A2 ) + .......... + Card ( A p‬‬

‫ﺍﻹﺜﺒﺎﺕ‪:‬‬

‫‪ -1‬ﺤﺴﺏ ﺘﻌﺭﻴﻑ ﺍﻟﻤﺠﻤﻭﻋﺎﺕ ﺍﻟﻤﻨﺘﻬﻴﺔ ﻓﺈﻨﻪ ﻴﻭﺠﺩ ﺘﻘﺎﺒﻠﻴﻥ ‪ f‬و ‪ g‬ﺒﺤﻴﺙ‬

‫‪ f : E → N n‬و ‪ g : F → N p‬ﺤﻴﺙ ‪ Card ( E ) = n‬ﻭ ‪. Card (F ) = p‬‬

‫ﺒﺴﻬﻭﻟﺔ ﻴﻤﻜﻥ ﺃﻥ ﺘﺜﺒﺕ ﺃﻥ ﺍﻟﺘﻁﺒﻴﻕ ‪ h : E ∪ F → N n + p‬ﻭﺍﻟﻤﻌﺭﻑ ﺒﺎﻟﺸﻜل ﺍﻟﺘﺎﻟﻲ‪:‬‬

‫;) ‪⎧ f ( z‬‬ ‫‪z∈E‬‬
‫⎨ = ) ‪∀z ∈ E ∪ F ; g ( z‬‬
‫‪⎩n + g ( z ); z ∈ F‬‬

‫ﻫﻭ ﻋﺒﺎﺭﺓ ﻋﻥ ﺘﻘﺎﺒل ﺇﺫﻥ ‪ E ∪ F‬ﻤﻨﺘﻬﻴﺔ ﻭ ) ‪. Card ( E ) = n + p = Card ( E ) + Card ( F‬‬

‫‪p‬‬
‫‪ -2‬ﻹﺜﺒﺎﺕ ﺃﻥ ) ‪Card (E ) = ∑Card (A i‬‬
‫‪i =1‬‬

‫ﻨﺴﺘﺨﺩﻡ ﻤﺒﺩﺃ ﺍﻟﺘﺩﺭﻴﺞ‪ ،‬ﻤﻥ ﺃﺠل ‪ p = 2‬ﺍﻟﻘﻀﻴﺔ ﺼﺤﻴﺤﺔ ﺍﻋﺘﻤﺎﺩﹰﺍ ﻋﻠﻰ ﺍﻟﻁﻠﺏ ﺍﻷﻭل‪ ،‬ﻟﻨﻔﺭﺽ‬
‫ﺃﻨﻬﺎ ﺼﺤﻴﺤﺔ ﻤﻥ ﺃﺠل ‪ p‬ﻭﻟﻨﺜﺒﺕ ﺼﺤﺘﻬﺎ ﻤﻥ ﺃﺠل ‪ . p + 1‬ﺇﻥ‬

‫‪E = A1 ∪ A2 ∪ .......... ∪ A p ∪ A p +1‬‬

‫‪= [ A1 ∪ A2 ∪ ........ ∪ A p ] ∪ A p +1‬‬

‫ﻭﺫﻟﻙ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺨﻭﺍﺹ ﺍﻻﺠﺘﻤﺎﻉ‪ .‬ﻨﻼﺤﻅ ﺃﻨﻪ ﺍﻟﻤﺠﻤﻭﻋﺘﻴﻥ ‪F = A1 ∪ .......... ∪ A p‬‬

‫ﻭﺍﻟﻤﺠﻤﻭﻋﺔ ‪ Ap +1‬ﻤﻨﻔﺼﻠﻴﻥ ﺇﺫﻥ ) ‪Card ( E ) = Card ( F ) + Card ( A p +1‬‬

‫ﻭﺫﻟﻙ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺍﻟﻘﺴﻡ ﺍﻷﻭل ﻤﻥ ﻫﺫﻩ ﺍﻟﻤﺒﺭﻫﻨﺔ‬

‫) ‪⇒ Card ( E ) = Card ( A1 ) + ......Card ( A p ) + Card ( A p +1‬‬

‫ﻭﺫﻟﻙ ﻷﻥ ﺍﻟﻘﻀﻴﺔ ﺼﺤﻴﺤﺔ ﻤﻥ ﺃﺠل ‪ . p‬ﻭﺒﺎﻟﺘﺎﻟﻲ ﺍﻟﻘﻀﻴﺔ ﺼﺤﻴﺤﺔ ﻤﻥ ﺃﺠل ﺃﻱ ﻗﻴﻤﺔ ﻟـ ∈ ‪. P‬‬

‫ﻤﺒﺭﻫﻨﺔ‬

‫ﺇﺫﺍ ﻜﺎﻨﺕ ‪ F , E‬ﻤﺠﻤﻭﻋﺘﻴﻥ ﻤﻨﺘﻬﻴﺘﻴﻥ ﻓﺈﻥ ‪ A × B‬ﻤﺠﻤﻭﻋﺔ ﻤﻨﺘﻬﻴﺔ ﻭ‬

‫)‪. Card ( A × B) = Card ( A).Card ( B‬‬

‫ﺍﻹﺜﺒﺎﺕ‪:‬‬

‫‪E = {x1 ,‬‬ ‫ﻨﻼﺤﻅ ﺃﻨﻪ ﺇﺫﺍ ﻜﺎﻨﺕ ‪ F‬ﻤﻜﻭﻨﺔ ﻤﻥ ﻋﻨﺼﺭ ﻭﺤﻴﺩ ﺃﻱ }‪ F = { y‬ﻭﻟﻨﻔﺭﺽ } ‪, x n‬‬
‫ﻤﻨﺘﻬﻴﺔ ﺭﺌﻴﺴﻬﺎ ﻫﻭ ‪ n‬ﻋﻨﺩﺌﺫ‪:‬‬

‫‪5‬‬
 ‫})‪E × F = {(x1, y), ,.(xn , y‬‬

‫ﻭﻨﻼﺤﻅ ﺒﺴﻬﻭﻟﺔ ﺃﻨﻪ ﻴﻭﺠﺩ ﺘﻘﺎﺒل ﺒﻴﻥ ‪ E‬ﻭ ‪ E × F‬ﻭﻟﻴﻜﻥ‪:‬‬

‫‪ϕ :E → E×F‬‬
‫‪xi → ( xi , y ), i = 1, 2,‬‬ ‫‪,n‬‬

‫‪ Card ( E × F ) = Card ( E ) = n‬ﻋﻨﺩﻤﺎ ‪ F‬ﻤﻜﻭﻨﺔ ﻤﻥ ﻋﻨﺼﺭ ﻭﺤﻴﺩ‪.‬‬

‫ﻋﻨﺩﻤﺎ } ‪ F = { y1 , , y p‬ﻤﻨﺘﻬﻴﺔ ﻭ ‪ Card ( F ) = P‬ﻋﻨﺩﺌ ٍﺫ‪:‬‬

‫‪⎧P‬‬ ‫‪⎫ P‬‬
‫}} ‪Card ( E × F ) = Card ⎨∪ {E × { y j }}⎬ = ∑ Card {E × { y j‬‬
‫‪⎩ j =1‬‬ ‫‪⎭ j =1‬‬

‫ﻷﻥ ﺍﻟﻤﺠﻤﻭﻋﺎﺕ } ‪ E × { y j‬؛ ‪ j = 1, , P‬ﻤﻨﻔﺼﻠﺔ ﻤﺜﻨﻰ ﻤﺜﻨﻰ‪ ..‬ﻋﻨﺩﺌﺫ‪:‬‬

‫‪P‬‬ ‫‪P‬‬
‫) ‪Card ( E × F ) = ∑ n = n∑1 = n.P = Card ( E )Card ( F‬‬
‫‪j =1‬‬ ‫‪j =1‬‬

‫‪F = { y1 ,‬‬ ‫&} ‪, y p‬‬ ‫‪E = {x1 ,‬‬ ‫ﺘﻭﻀﻴﺢ‪ :‬ﺇﺫﺍ ﻜﺎﻨﺕ } ‪, x n‬‬

‫‪⇒ E × F = {( x1 , y1 ),‬‬ ‫) ‪, ( xn, y 2‬‬

‫‪( x1 , y 2 ),‬‬ ‫) ‪, ( xn , y2‬‬

‫… … …‬
‫‪( x 1 , y P ),‬‬ ‫}) ‪, ( x n , y p‬‬

‫⎧‬ ‫}‪E ×{ y 1‬‬ ‫‪E× yp‬‬ ‫} {‬ ‫⎫‬

‫⎪‬ ‫‪⎪ P‬‬
‫‪= ⎨{(x 1 , y 1 ), , (x n , y 1 )} ∪,‬‬ ‫‪, ∪ {(x 1 , y p ),‬‬ ‫)} ‪, (x n , y p )}⎬ = ∪ (E × { y j‬‬
‫⎪‬ ‫‪⎪ j =1‬‬
‫⎩‬ ‫⎭‬

‫ﺤﻴﺙ ﻨﻼﺤﻅ ﺒﺴﻬﻭﻟﺔ ﺃﻥ } ‪ E × { y j‬ﻫﻲ ﻤﺠﻤﻭﻋﺎﺕ ﻤﻨﻔﺼﻠﺔ‪.‬‬

‫‪ -1‬ﺃﺠﺯﺍﺀ ﻤﺠﻤﻭﻋﺔ ﻤﻨﺘﻬﻴﺔ‬

‫ﻤﺒﺭﻫﻨﺔ‬
‫ﺇﺫﺍ ﻜﺎﻨﺕ ‪ E‬ﻤﺠﻤﻭﻋﺔ ﻤﻨﺘﻬﻴﺔ ﻓﺈﻥ ﻤﺠﻤﻭﻋﺔ ﺃﺠﺯﺍﺌﻬﺎ ) ‪ P(E‬ﻤﻨﺘﻬﻴﺔ ﻭ ‪ Card ( p( E )) = 2 n‬ﺤﻴﺙ‬
‫) ‪. n = Card ( E‬‬

‫ﺍﻹﺜﺒﺎﺕ‪:‬‬

‫ﻨﺴﺘﺨﺩﻡ ﻤﺒﺩﺃ ﺍﻹﺜﺒﺎﺕ ﺒﺎﻟﺘﺩﺭﻴﺞ‬

‫‪6‬‬
‫∅ = ‪ E‬ﻋﻨﺩﺌ ٍﺫ }∅{ = ) ‪Card (P (E )) = 1 = 20 ⇐ P (E‬‬

‫}‪Card (P (E )) = 2 = 21 ⇐ P (E ) = {∅,{x }} ⇐ E = {x‬‬

‫} ‪Card (P (E )) = 4 = 22 ⇐ P (E ) = {∅,{x },{ y },{x , y }} ⇐ E = {x , y‬‬

‫‪E n = {x1 ,‬‬ ‫ﻟﻨﻔﺭﺽ ﺍﻵﻥ ﺃﻨﻪ ﺍﻟﻌﻼﻗﺔ ﺼﺤﻴﺤﺔ ﻤﻥ ﺃﺠل } ‪, x n‬‬

‫‪E n +1 = {x1 ,‬‬ ‫ﻭﻟﻨﺜﺒﺕ ﺼﺤﺘﻬﺎ ﻤﻥ ﺃﺠل } ‪, x n +1‬‬

‫ﻟﻨﺭﻤﺯ ﺒـ )‪ A( n +1‬ﻟﻤﺠﻤﻭﻋﺔ ﺃﺠﺯﺍﺀ ‪ En +1‬ﺍﻟﺘﻲ ﺘﺤﻭﻱ ﺍﻟﻌﻨﺼﺭ ‪ xn +1‬ﻭ )‪ B ( n +1‬ﻟﻤﺠﻤﻭﻋﺔ ﺃﺠﺯﺍﺀ‬

‫‪ En +1‬ﺍﻟﺘﻲ ﻻ ﺘﺤﻭﻱ ‪ xn +1‬ﻨﻼﺤﻅ ﺃﻥ ﺍﻟﻤﺠﻤﻭﻋﺔ‪.‬‬

‫} )‪ { A ( n +1) , B ( n+1‬ﺘﺸﻜل ﺘﺠﺯﺌﺔ ﻟـ ) ‪. P( En +1‬‬

‫ﻨﻼﺤﻅ ﺃﻥ )‪ B ( n +1‬ﻫﻲ ﻨﻔﺴﻬﺎ ﺍﻟﻤﺠﻤﻭﻋﺔ ) ‪ P( En‬ﻭﻜﺫﻟﻙ ﻴﻭﺠﺩ ﺘﻘﺎﺒل ﺒﻴﻥ )‪ B ( n +1‬ﻭ )‪ A( n +1‬ﻤﻌﺭﻑ‬
‫ﺒﺎﻟﺸﻜل ﺍﻟﺘﺎﻟﻲ‪:‬‬
‫)‪ϕ : B ( n +1) → A ( n +1‬‬
‫} ‪T → T ∪ {x n +1‬‬

‫ﻋﻨﺩﺌﺫ ﻨﺴﺘﻨﺘﺞ ﺃﻥ‪:‬‬

‫‪Card ( B n +1 ) = Card ( A n +1 ) = CardP ( E n ) = 2 n‬‬

‫ﻭﻤﻨﻪ‪:‬‬
‫) ‪Card ( P( E n +1 )) = Card ( A n +1 ) + Card ( B n +1‬‬

‫‪= 2Card ( P( E n )) = 2.2 n = 2 n +1 .‬‬

‫‪ -2‬ﺍﻟﺘﺭﺍﺘﻴﺏ ﻭﺍﻟﺘﻭﺍﻓﻴﻕ‬

‫∈ ) ‪ (n , p‬ﻭﻟﻨﻌﺭﻑ‪:‬‬ ‫‪2‬‬
‫ﻟﻴﻜﻥ‬

‫! ‪ n‬ﻭﻴﻘﺭﺃ » ‪ n‬ﻋﺎﻤﻠﻲ« ﺒﺎﻟﻌﻼﻗﺔ ﺍﻟﺘﺎﻟﻴﺔ‪:‬‬

‫‪⎧1 ,‬‬ ‫‪n=0‬‬
‫⎨ =!‪n‬‬
‫× )‪⎩n × (n − 1‬‬ ‫‪× 2 × 1, n ≠ 0‬‬

‫ﺘﺭﺍﺘﻴﺏ )‪ (n, p‬ﻭﻨﺭﻤﺯ ﻟﻪ ﺏ ‪ A np‬ﺤﻴﺙ ‪ 0 ≤ p ≤ n‬ﺒﺎﻟﻌﻼﻗﺔ ﺍﻟﺘﺎﻟﻴﺔ‪:‬‬

‫!‪n‬‬
‫= ‪A nP‬‬ ‫× )‪= n × (n − 1‬‬ ‫‪× 2 ×1‬‬
‫!) ‪(n − p‬‬

‫‪7‬‬
 ‫⎞ ‪⎛n‬‬
‫ﺘﻭﺍﻓﻴﻕ )‪ (n, p‬ﻭﻨﺭﻤﺯ ﻟﻪ ﺏ ⎟⎟ ⎜⎜ ﺃﻭ ‪ C np‬ﺤﻴﺙ ‪ 0 ≤ p ≤ n‬ﻜﻤﺎ ﻴﻠﻲ‪:‬‬
‫⎠‪⎝ p‬‬
‫⎞ ‪⎛n‬‬ ‫!‪n‬‬ ‫)‪n × (n − 1) × × (n − p + 1‬‬
‫= ⎟ ⎜ = ‪C nP‬‬ ‫=‬
‫! ‪⎝ p ⎠ (n − p )! p‬‬ ‫‪p × ( p − 1) × × 2 × 1‬‬

‫ﻤﺜﺎل‪ :‬ﺍﺜﺒﺕ ﺃﻥ ‪ C nn = C n0 = 1‬ﻭﺃﻥ ‪ C n1 = n‬ﻭﺫﻟﻙ ‪∀ n ≥ 0‬‬

‫!‪n‬‬ ‫‪n! 1‬‬

‫= ‪C nn‬‬ ‫=‬ ‫‪= =1‬‬
‫‪(n − n)!n! 0!n! 1‬‬
‫!‪n‬‬ ‫!‪n‬‬
‫= ‪C n0‬‬ ‫=‬ ‫‪=1‬‬
‫!‪(n − 0)!0! n!0‬‬
‫!‪n‬‬ ‫!)‪n × (n − 1‬‬
‫= ‪C n1‬‬ ‫=‬ ‫ﻭﻜﺫﻟﻙ‪= n :‬‬
‫!‪(n − 1)!×1‬‬ ‫!)‪(n − 1‬‬

‫ﻤﺜﺎل‪ :‬ﺃﺜﺒﺕ ﺼﺤﺔ ﺍﻟﻌﻼﻗﺘﻴﻥ ﺍﻟﻬﺎﻤﺘﻴﻥ‪:‬‬

‫‪n p −1‬‬
‫= ‪C np‬‬ ‫‪C n −1 , C nn+ p = C np+ p‬‬
‫‪p‬‬

‫ﺘﻤﺭﻴﻥ‪ :‬ﺃﺜﺒﺕ ﺼﺤﺔ ﺍﻟﻌﻼﻗﺔ ﺍﻟﺘﺎﻟﻴﺔ )ﻤﺜﻠﺙ ﺒﺎﺴﻜﺎل ‪:(Pascal‬‬

‫* ‪C nk++11 = C nk + C nk +1‬‬

‫ﻨﺼﻁﻠﺢ ﻋﻠﻰ ﺃﻥ ‪ C nk = 0‬ﻤﻥ ﺃﺠل ‪) . k > n‬ﺴﻨﺭﻯ ﻻﺤﻘﹰﺎ ﺴﺒﺏ ﺫﻟﻙ(‪.‬‬

‫ﻤﺒﺭﻫﻨﺔ )ﺩﺴﺘﻭﺭ ﺍﻟﻜﺭﺨﻲ – ﻨﻴﻭﺘﻥ(‬

‫∈ ‪ n‬ﻋﺩﺩ ﻁﺒﻴﻌﻲ ﻤﺎ ﻋﻨﺩﺌﺫ‪:‬‬ ‫∈ ‪ x, y‬ﻭﻟﻴﻜﻥ‬ ‫ﻟﻴﻜﻥ ﻟﺩﻴﻨﺎ ﺍﻟﻌﺩﺩﻴﻥ ﺍﻟﺤﻘﻴﻘﻴﻴﻥ‬

‫‪n‬‬
‫‪( x + y ) n = ∑ C nk x n − k y k‬‬ ‫)‪(*′‬‬
‫‪k =0‬‬

‫ﺍﻹﺜﺒﺎﺕ‪:‬‬

‫ﻨﺴﺘﺨﺩﻡ ﻤﺒﺩﺃ ﺍﻹﺜﺒﺎﺕ ﺒﺎﻟﺘﺩﺭﻴﺞ‪:‬‬

‫‪y C 00 x 0 y 0 = 1 and ( x + y ) 0 = 1 ⇐ n = 0‬‬
‫‪1‬‬
‫‪y‬‬ ‫‪∑C‬‬
‫‪k =0‬‬
‫‪1‬‬
‫‪k‬‬
‫‪x 1− k y k = C10 xy 0 + C11 x 0 y = x + y and ( x + y )1 = x + y ⇐ n = 1‬‬

‫‪8‬‬
‫‪y ( x + y ) 2 = ( x + y )( x + y ) = x 2 + 2 xy + y 2 ⇐ n = 2‬‬
‫‪2‬‬

‫‪∑C‬‬ ‫‪k‬‬
‫‪2‬‬ ‫ﻭﻟﺩﻴﻨﺎ‪X 2− k y k = C 20 x 2 y 0 + C 21 xy + C 22 x 0 y 2 == x 2 + 2 xy + y 2 :‬‬
‫‪k =0‬‬

‫‪ y‬ﻟﻨﻔﺭﺽ ﺍﻵﻥ ﺃﻥ ﺍﻟﻌﻼﻗﺔ )‪ (*′‬ﺼﺤﻴﺤﺔ ﻤﻥ ﺃﺠل ‪ n‬ﻭﻟﻨﺜﺒﺕ ﺼﺤﺘﻬﺎ ﻤﻥ ﺃﺠل ‪ n + 1‬ﻨﺴﺘﺨﺩﻡ‬

‫ﻤﻥ ﺃﺠل ﺫﻟﻙ ﺍﻟﻌﻼﻗﺔ ﺍﻟﻤﻌﻁﺎﺓ ﻓﻲ ﺍﻟﺘﻤﺭﻴﻥ ﺍﻟﺴﺎﺒﻕ‪:‬‬

‫‪C nk++11 = C nk + C nk +1‬‬

‫ﻭﻟﻨﻀﺭﺏ ﻁﺭﻓﻲ ﻫﺫﻩ ﺍﻟﻌﻼﻗﺔ ﺒﺎﻟﻤﻘﺩﺍﺭ ‪ x n − k y k +1‬ﻭﻟﻨﺠﻤﻊ ﺍﻟﻌﻼﻗﺎﺕ ﺍﻟﻨﺎﺘﺠﺔ ﻭﺍﻟﻤﻭﺍﻓﻘﺔ ﻟﺠﻤﻴﻊ‬
‫ﻗﻴﻡ ‪ k‬ﻓﻨﺤﺼل ﻋﻠﻰ‪:‬‬
‫‪n‬‬ ‫‪n‬‬ ‫‪n‬‬

‫‪∑C nk++11 x n −k y k +1 = ∑C nk x n −k y k +1 + ∑C nk +1x n −k y k +1‬‬

‫‪k =0‬‬ ‫‪k =0‬‬ ‫‪k =0‬‬
‫‪I‬‬ ‫‪J‬‬

‫ﻨﻘﻭﻡ ﺒﺈﺼﻼﺡ ﻁﺭﻓﻲ ﻫﺫﻩ ﺍﻟﻌﻼﻗﺔ ﻭﻟﻨﺒﺩﺃ ﺒﺎﻟﻁﺭﻑ ﺍﻷﻴﺴﺭ ﻭﻟﻨﻔﺭﺽ ‪l = k + 1‬‬
‫‪n +1‬‬ ‫‪n +1‬‬
‫‪I = ∑C‬‬ ‫‪l‬‬
‫‪n +1‬‬ ‫‪x‬‬ ‫‪n +1− k‬‬
‫‪y‬‬ ‫‪e‬‬
‫=‬ ‫‪∑C‬‬ ‫‪l‬‬
‫‪n +1‬‬ ‫‪x n +1−l y l − C n0+1 x n +1‬‬
‫‪l =1‬‬ ‫‪l =0‬‬

‫ﻭﺃﻤﺎ ﺍﻟﻁﺭﻑ ﺍﻷﻴﻤﻥ ﻓﻴﺼﺒﺢ‪:‬‬

‫‪⎛ n‬‬ ‫‪⎞ n +1‬‬
‫‪J = y ⎜ ∑ C nk x n − k y k ⎟ + ∑C nl x n +1−l y l‬‬
‫‪⎝ k =0‬‬ ‫‪⎠ l =1‬‬
‫⎛‬ ‫‪n‬‬
‫⎞‬ ‫‪⎛ n +1‬‬ ‫⎞‬
‫⎟ ‪= y ⎜ ∑ C nk x n − k y k ⎟ + x ⎜ ∑C nl x n −l y l‬‬
‫‪⎝ k =0‬‬ ‫⎠‬ ‫‪⎝ l =1‬‬ ‫⎠‬
‫⎛‬ ‫⎞‬
‫‪⎜ n l n −l l‬‬ ‫⎟‬
‫⎟ ‪= y (x + y ) + x ⎜ ∑C n x y + C n x y − C n x‬‬
‫‪n‬‬ ‫‪n +1 −1 n +1‬‬ ‫‪0 n‬‬

‫‪⎜ l =0‬‬ ‫⎟‬

‫⎝‬ ‫‪0‬‬ ‫⎠‬

‫(‬
‫‪= y (x + y ) n + x (x + y ) n − C n0 x n‬‬ ‫)‬
‫ﻭﻤﻨﻪ‪:‬‬
‫‪J = (x + y ) n +1 − C n0 x n +1‬‬

‫‪x n +1‬‬

‫ﻭﺒﺎﻟﺘﺎﻟﻲ ﺒﻤﻘﺎﺭﻨﺔ ‪ J , I‬ﻨﺠﺩ ﺃﻥ‪:‬‬

‫‪n +1‬‬

‫‪∑C‬‬
‫‪l =0‬‬
‫‪l‬‬
‫‪n‬‬ ‫‪x n −l y l = (x + y )( x + y ) n = (x + y ) n +1‬‬

‫∈ ‪.n‬‬ ‫ﻭﺒﺎﻟﺘﺎﻟﻲ )‪ (*′‬ﺼﺤﻴﺤﺔ ﻤﻥ ﺃﺠل ‪ n + 1‬ﺃﻱ ﻫﻲ ﺼﺤﻴﺤﺔ ﻤﻥ ﺃﺠل ﺃﻱ‬

‫‪9‬‬
 ‫ﻤﻼﺤﻅﺔ‪ :‬ﻴﻤﻜﻥ ﺍﻟﺤﺼﻭل ﻋﻠﻰ ﻗﻴﻤﺔ ‪ C nk‬ﻤﻥ ﺩﺴﺘﻭﺭ ﺍﻟﻜﺭﺨﻲ ﻨﻴﻭﺘﻥ ﺒﺎﺸﺘﻘﺎﻕ ﻁﺭﻓﻲ ﺍﻟﻌﻼﻗﺔ‪:‬‬
‫‪n‬‬
‫‪ k . ∑ C nk x k = (1 + x) k‬ﻤﺭﺓ ﻭﻤﺴﺎﻭﺍﺓ ‪ x‬ﺒﺎﻟﺼﻔﺭ ﻋﻨﺩﺌﺫ ﻨﺠﺩ ﺃﻥ‪:‬‬
‫‪k =0‬‬

‫× )‪[k (k − 1‬‬ ‫)‪× 2 ×1]C nk = n (n − 1‬‬ ‫‪(n − k + 1) = A nk‬‬

‫‪Ank‬‬ ‫!‪n‬‬
‫= ‪⇒ C nk‬‬ ‫=‬
‫!‪K ! (n − k )!k‬‬

‫ﻤﺒﺭﻫﻨﺔ‬

‫ﺇﺫﺍ ﻜﺎﻨﺕ ‪ E‬ﻤﺠﻤﻭﻋﺔ ﻤﻨﺘﻬﻴﺔ ﻋﺩﺩ ﻋﻨﺎﺼﺭﻫﺎ ‪ n‬ﻭ ) ‪ Pk (E‬ﻤﺠﻤﻭﻋﺔ ﺃﺠﺯﺍﺀ ‪ E‬ﺍﻟﺘﻲ ﻋﺩﺩ‬
‫ﻋﻨﺎﺼﺭﻫﺎ ﻜل ﻤﻨﻬﺎ ﻴﺴﺎﻭﻱ ‪ k‬ﻓﺈﻥ‪:‬‬

‫‪Card ( Pk ( E )) = C nk‬‬

‫ﺍﻹﺜﺒﺎﺕ‪:‬‬

‫ﻭﻟﺫﻟﻙ ﻨﻜﺘﻔﻲ ﺒﺈﺜﺒﺎﺕ ﺼﺤﺔ ﻫﺫﻩ ﺍﻟﻌﻼﻗﺔ‬ ‫‪n‬‬ ‫ﺒﻤﺎ ﺃﻥ ‪ E‬ﻤﻨﺘﻬﻴﺔ ﺇﺫﻥ ﻴﻭﺠﺩ ﺘﻘﺎﺒل ﺒﻴﻥ ‪ E‬ﻭﺒﻴﻥ‬
‫= ‪.E‬‬ ‫‪n‬‬ ‫ﻤﻥ ﺃﺠل‬

‫ﺍﻟﺘﻲ ﺘﺤﻭﻱ ‪k‬‬ ‫‪n‬‬ ‫ﻭﺃﻥ ) ‪ Pk(n‬ﻫﻲ ﻤﺠﻤﻭﻋﺔ ﺃﺠﺯﺍﺀ‬ ‫‪n‬‬ ‫ﻟﻨﻔﺭﺽ ﺃﻥ ) ‪ P (n‬ﻫﻲ ﻤﺠﻤﻭﻋﺔ ﺃﺠﺯﺍﺀ‬
‫ﻋﻨﺼﺭﹰﺍ ﺤﻴﺙ ‪. k ≤ n‬‬

‫‪ y‬ﻋﻨﺩﻤﺎ ‪ n = 1‬ﻓﺈﻥ }}‪ Pk( n ) = P11 , P (1) = {∅,{1‬ﻭﺒﺎﻟﺘﺎﻟﻲ‪:‬‬

‫‪Card ( P11 ) = 1 = C11‬‬

‫ﻋﻨﺩﻤﺎ ‪ n = 2‬ﻓﺈﻥ }}‪ P (2) = {∅,{1},{2},{1, 2‬ﻭﻨﻼﺤﻅ ﺃﻥ‪:‬‬

‫‪P0(2) = {∅} ⇒ Card (P0(2) ) = 1 = C 20‬‬

‫‪P1(2) = {{1}.{2}} ⇒ Card (P1(2) ) = 2 = C 21‬‬

‫‪P2(2) = {{2}} ⇒ Card (P1(2) ) = 1 = C 22‬‬

‫‪ y‬ﻟﻨﻔﺭﺽ ﺃﻥ ﺍﻟﻌﻼﻗﺔ ﺼﺤﻴﺤﺔ ﻤﻥ ﺃﺠل ‪ n − 1‬ﻭﻟﻨـﺜﺒﺕ ﺼﺤﺘﻬﺎ ﻤﻥ ﺃﺠل ‪. n‬ﻟﻴﻜﻥ ‪1 ≤ k ≤ n‬‬

‫ﺍﻟﺘﻲ ﺘﺤﻭﻱ ﺍﻟﻌﻨﺼﺭ ‪ n‬ﻭﺍﻟﺘﻲ ﻋﺩﺩ ﻋﻨﺎﺼﺭ ﻜل ﻤﻨﻬﺎ‬ ‫‪n‬‬ ‫ﻟﻨﺭﻤﺯ ﺒـ ) ‪ Ak(n‬ﺇﻟﻰ ﻤﺠﻤﻭﻋﺔ ﺃﺠﺯﺍﺀ‬
‫ﺍﻟﺘﻲ ﻻ ﺘﺤﻭﻱ ﺍﻟﻌﻨﺼﺭ ‪ n‬ﻭﺍﻟﺘﻲ ﻋﺩﺩ ﻋﻨﺎﺼﺭ ﻜل‬ ‫‪n‬‬ ‫‪ k‬ﻭﻨﺭﻤﺯ ﺒـ ) ‪ Bk( n‬ﺇﻟﻰ ﻤﺠﻤﻭﻋﺔ ﺃﺠﺯﺍﺀ‬
‫{‬ ‫}‬
‫ﻤﻨﻬﺎ ‪ k‬ﻋﻨﺩﺌﺫ ﻨﻼﺤﻅ ﺃﻥ ‪Pk( n ) = A k( n ) , B k( n ) ; A k( n ) ∩ B k( n ) = φ‬‬

‫ﻭﺒﺎﻟﺘﺎﻟﻲ‪:‬‬
‫) ) ‪Card ( Pk( n ) ) = Card ( Ak( n ) ) + Card ( Bk( n‬‬

‫‪10‬‬
 ‫ﻴﻤﻜﻨﻨﺎ ﺃﻥ ﻨﻼﺤﻅ ﺃﻥ‪:‬‬

‫‪ Bk( n ) -1‬ﻫﻲ ﻨﻔﺴﻬﺎ )‪. Pk( n −1‬‬

‫) ‪ϕ : Pk(−n1−1) → A k( n‬‬
‫‪ -2‬ﻫﻨﺎﻙ ﺘﻘﺎﺒل ﺒﻴﻥ ) ‪ Ak(n‬ﻭ )‪ Pk(−n1−1‬ﻤﻌﺭﻑ ﻜﻤﺎﻴﻠﻲ‪:‬‬
‫} ‪P → P ∪ {n‬‬

‫ﻭﻤﻨﻪ‪Card ( Pk( n ) ) = Card ( Pkn−−11 ) + Card ( Pk( n −1) ) :‬‬

‫ﺍﻟﻌﻼﻗﺔ ﺼﺤﻴﺤﺔ ﻤﻥ ﺃﺠل ‪ n − 1‬ﻭ ‪ n −1 ≥ k‬ﺇﺫﻥ ‪Card ( Pk( n ) ) = C nk−−11 + C nk−1‬‬

‫ﺤﺴﺏ ﺍﻟﻌﻼﻗﺔ ﺍﻟﻤﻌﻁﺎﺓ ﻓﻲ ﺍﻟﺘﻤﺭﻴﻥ ﺍﻟﺴﺎﺒﻕ ﻨﺠﺩ ﺃﻥ ‪C nk−−11 + C nk−1 = C nk‬‬

‫ﻭﻤﻨﻪ‪ Card ( Pk( n ) ) = C nk :‬ﻤﻥ ﺃﺤل ﺃﻱ ‪1 ≤ k ≤ n, 1 ≤ n‬‬

‫ﻤﻼﺤﻅﺔ‬
‫ﻓﻲ ﺘﻌﺭﻴﻑ ﺍﻟﺘﻭﺍﻓﻴﻕ ﺍﺼﻁﻠﺤﻨﺎ ﺃﻥ ‪ C nk = 0‬ﻤﻥ ﺃﺠل ‪ n ≤ k‬ﻭﻫﺫﺍ ﻤﺎ ﺘﺒﻴﻨﻪ ﺍﻟﻤﺒﺭﻫﻨﺔ ﺍﻟﺴﺎﺒﻘﺔ ﺇﺫ‬
‫ﺃﻥ ‪ C nk‬ﻴﻤﺜل ﻋﺩﺩ ﺃﺠﺯﺍﺀ ﺍﻟﻤﺠﻤﻭﻋﺔ ‪ E‬ﺍﻟﺘﻲ ﺘﺤﻭﻱ ‪ k‬ﻋﻨﺼﺭﹰﺍ ﻭﺒﺎﻟﺘﺎﻟﻲ ﻻ ﻴﻭﺠﺩ ﻓﻲ ‪ E‬ﺃﺠﺯﺍﺀ‬
‫ﻋﺩﺩ ﻋﻨﺎﺼﺭﻫﺎ ﺃﻜﺒﺭ ﺘﻤﺎﻤﹰﺎ ﻤﻥ ‪ n‬ﻭﺒﺎﻟﺘﺎﻟﻲ ‪ C nk = 0‬ﻤﻥ ﺃﺠل ‪. n < k‬‬

‫ﻤﺒﺭﻫﻨﺔ‬

‫‪ -1‬ﻟﻴﻜﻥ ) ‪ F ( E , G‬ﻤﺠﻤﻭﻋﺔ ﺍﻟﺘﻁﺒﻴﻘﺎﺕ ﺍﻟﺘﻲ ﻤﻨﻁﻠﻘﻬﺎ ﺍﻟﻤﺠﻤﻭﻋﺔ ‪ E‬ﻭﻤﺴﺘﻘﺭﻫﺎ ﺍﻟﻤﺠﻤﻭﻋﺔ ‪G‬‬

‫ﺤﻴﺙ ‪ Card (E ) = n‬ﻭ ‪ Card (G ) = p‬ﻋﻨﺩﺌﺫ ‪، CardF (E ,G ) = p n‬‬

‫‪ -2‬ﺇﺫﺍ ﻜﺎﻥ‪ Card (E ) = n :‬ﻭ ‪ Card (G ) = p‬ﺤﻴﺙ ‪ n ≤ p‬ﻭ ) ‪ Fi (E , G‬ﻤﺠﻤﻭﻋﺔ‬

‫ﺍﻟﺘﻁﺒﻴﻘﺎﺕ ﺍﻟﻤﺘﺒﺎﻴﻨﺔ ﺍﻟﺘﻲ ﻤﻨﻁﻠﻘﻬﺎ ‪ E‬ﻭﻤﺴﺘﻘﺭﻫﺎ ‪ G‬ﻋﻨﺩﺌﺫ ‪، Card ( Fi ( E , G )) = AnP‬‬

‫‪ -3‬ﺇﺫﺍ ﻜﺎﻨﺕ ) ‪ Fs (E , G‬ﻤﺠﻤﻭﻋﺔ ﺍﻟﺘﻁﺒﻴﻘﺎﺕ ﺍﻟﻐﺎﻤﺭﺓ ﺍﻟﺘﻲ ﻤﻨﻁﻠﻘﻬﺎ ‪ E‬ﻭﻤﺴﺘﻘﺭﻫﺎ ‪G‬‬

‫‪P‬‬
‫ﻋﻨﺩﺌﺫ ‪، Card (Fs (E ,G )) = ∑ (−1) k C Pk (P − k )n‬‬
‫‪k =0‬‬

‫‪ -4‬ﺃﺨﻴﺭﺍﹰ‪ ،‬ﺇﺫﺍ ﻜﺎﻨﺕ ) ‪ B (E , E ) = B (E‬ﻤﺠﻤﻭﻋﺔ ﺍﻟﺘﻘﺎﺒﻼﺕ ﻋﻠﻰ ﺍﻟﻤﺠﻤﻭﻋﺔ ‪ E‬ﻭ ﺍﻟﺘﻲ ﻋﺩﺩ‬
‫ﻋﻨﺎﺼﺭﻫﺎ ‪ 1 ≤ n‬ﻋﻨﺩﺌﺫ ! ‪. Card (B (E )) = n‬‬

‫‪11‬‬
 ‫ﺘﻤﺎﺭﻴﻥ‪:‬‬
‫ﺍﻟﺘﻤﺭﻴﻥ ﺍﻷﻭل‬

‫ﻟﺘﻜﻥ ‪ F , E‬ﻤﺠﻤﻭﻋﺘﻴﻥ‪ ،‬ﺃﺜﺒﺕ ﺃﻥ‪:‬‬

‫) ‪Card ( E ∪ F ) = Card ( E ) + Card ( F ) − Card ( E ∩ F‬‬

‫ﺍﻟﺤل‪:‬‬

‫ﺒﺎﻻﺴﺘﻌﺎﻨﺔ ﺒﻤﺨﻁﻁ ﻓﻥ ﺍﻟﻤﻘﺎﺒل ﻨﺠﺩ ﺃﻥ ) ‪F = ( F \ E ) ∪ ( E ∩ F‬‬

‫ﻭﺤﻴﺙ ∅ = ) ‪(F \ E ) ∩ (E ∩ F‬‬

‫ﺇﺫﻥ ﺤﺴﺏ ﺍﻟﻤﺒﺭﻫﻨﺔ ﺍﻟﺴﺎﺒﻘﺔ‬

‫)*( ) ‪ Card ( F ) = Card ( F \ E ) + Card ( E ∩ F‬ﻟﺩﻴﻨﺎ ﺃﻴﻀﹰﺎ‪E ∪ F = E ∪ ( F \ E ) :‬‬

‫ﺤﻴﺙ ∅ = ) ‪ E ∩ (F \ E‬ﺇﺫﻥ ﺤﺴﺏ ﺍﻟﻤﺒﺭﻫﻨﺔ ﺍﻟﺴﺎﺒﻘﺔ‪:‬‬

‫) ‪Card ( E ∪ F ) = Card ( E ) + Card ( F \ E‬‬ ‫)**(‬

‫ﺒﺘﻌﻭﻴﺽ )*( ﻓﻲ )**( ﻨﺠﺩ ﺃﻥ‬

‫) ‪Card ( E ∪ F ) = Card ( E ) + Card ( F ) − Card ( E ∩ F‬‬

‫ﺍﻟﺘﻤﺭﻴﻥ ﺍﻟﺜﺎﻨﻲ‬
‫‪n − P + 1 p −1‬‬
‫= ‪C nP‬‬ ‫ﺍﺜﺒﺕ ﺃﻥ‪C n :‬‬
‫‪P‬‬

‫ﺍﻟﺤل‪:‬‬
‫!‪n‬‬ ‫‪1‬‬ ‫!‪n‬‬
‫= ‪C np‬‬ ‫=‬ ‫)‪(1‬‬
‫!)‪(n − P)! P! P (n − P )!( P − 1‬‬

‫ﻷﻥ‪ P!= P( P − 1)! :‬ﻭﻜﻤﺎ ﺃﻥ‪(n − P + 1)!= (n − P + 1)(n − P)! :‬‬

‫ﻭﺒﺎﻟﺘﺎﻟﻲ ﺒﻀﺭﺏ ﻭﺘﻘﺴﻴﻡ ﺍﻟﻁﺭﻑ ﺍﻷﻴﻤﻥ ﻓﻲ ﺍﻟﻤﺴﺎﻭﺍﺓ ﺒﺎﻟﻤﻘﺩﺍﺭ )‪ (n − p + 1‬ﻨﺤﺼل ﻋﻠﻰ‪:‬‬

‫‪n − P +1‬‬ ‫!‪n‬‬
‫= ‪C nP‬‬
‫‪P‬‬ ‫!)‪(n − P + 1)(n − P)!( p − 1‬‬

‫‪12‬‬
 ‫‪n − P +1‬‬ ‫!‪n‬‬ ‫‪n − P + 1 P −1‬‬
‫=‬ ‫‪.‬‬ ‫=‬ ‫‪Cn‬‬
‫‪P‬‬ ‫!)‪(n − P + 1)!( P − 1‬‬ ‫‪P‬‬

‫ﺍﻟﺘﻤﺭﻴﻥ ﺍﻟﺜﺎﻟﺙ‬

‫ﺍﺤﺴﺏ ﺍﻟﻤﺠﺎﻤﻴﻊ ﺍﻟﺘﺎﻟﻴﺔ‪:‬‬

‫‪n −1‬‬
‫‪n‬‬
‫‪1‬‬
‫‪∑C nk ,‬‬
‫‪k =1‬‬
‫‪∑3‬‬
‫‪k =0‬‬
‫‪k‬‬
‫‪C nk‬‬

‫ﺍﻟﺤل‪:‬‬
‫‪n‬‬
‫ﻨﻌﻠﻡ ﺃﻥ ‪( x + y ) n = ∑ C nk x n − k y k‬‬
‫‪k =0‬‬

‫‪n‬‬ ‫‪n‬‬
‫ﺒﻭﻀﻊ ‪ x = y = 1‬ﻨﺤﺼل ﻋﻠﻰ ‪2 n = ∑ C nk ⇒ ∑ C nk = 2 n − C n0 = 2 n − 1‬‬
‫‪k =0‬‬ ‫‪k =1‬‬

‫‪1‬‬
‫ﻤﻥ ﺃﺠل ﺍﻟﻤﺠﻤﻭﻉ ﺍﻟﺜﺎﻨﻲ ﺒﻔﺭﺽ ﺃﻥ ‪ x = 1‬ﻭ = ‪ y‬ﻨﺤﺼل ﻋﻠﻰ‪:‬‬
‫‪3‬‬
‫‪n‬‬ ‫‪k‬‬
‫⎞‪⎛ 1‬‬ ‫‪n‬‬
‫⎞ ‪n−k ⎛ 1‬‬
‫‪n‬‬
‫‪k l‬‬
‫‪n‬‬
‫‪1 k‬‬
‫‪⎜1 + ⎟ = ∑ C n (1) ⎜ ⎟ = ∑ C n k = ∑ k C n‬‬
‫‪k‬‬

‫⎠‪⎝ 3‬‬ ‫‪k =0‬‬ ‫⎠‪⎝ 3‬‬ ‫‪k =0‬‬ ‫‪3‬‬ ‫‪k =0 3‬‬

‫⎞‪⎛ 3 + 1‬‬
‫‪n‬‬
‫‪4 n n −1 1 k 1 n‬‬
‫⎜⇒‬ ‫‪⎟ = n = ∑ k Cn + n Cn‬‬
‫⎠ ‪⎝ 4‬‬ ‫‪3‬‬ ‫‪k =0 3‬‬ ‫‪3‬‬
‫‪4 n 1 n −1 1 k‬‬
‫⇒‬ ‫‪−‬‬ ‫‪= ∑ Cn‬‬
‫‪3 n 3 n k =0 3 k‬‬
‫‪n −1‬‬
‫‪1 k‬‬ ‫‪1‬‬
‫∑‪.‬‬ ‫ﻭﻤﻨﻪ‪C n = n (4 n − 1) :‬‬
‫‪k =0 3‬‬ ‫‪3‬‬
‫‪k‬‬

‫ﺍﻟﺘﻤﺭﻴﻥ ﺍﻟﺭﺍﺒﻊ‬

‫ﺃﺜﺒﺕ ﺼﺤﺔ ﺍﻟﻌﻼﻗﺔ ﺍﻟﺘﺎﻟﻴﺔ )ﻤﺜﻠﺙ ﺒﺎﺴﻜﺎل ‪:(Pascal‬‬

‫* ‪C nk++11 = C nk + C nk +1‬‬

‫ﺍﻟﺤل‪:‬‬

‫‪13‬‬
 ‫ﺇﻥ ﺍﻟﻁﺭﻑ ﺍﻷﻴﺴﺭ ﻤﻥ ﺍﻟﻌﻼﻗﺔ ﻴﻜﺘﺏ ﻜﻤﺎﻴﻠﻲ‪:‬‬
‫!)‪(n + 1‬‬ ‫!)‪(n + 1‬‬
‫= ‪C nk++11‬‬ ‫=‬ ‫)‪(1‬‬
‫!)‪(k + 1)!(n + 1 − k − 1)! (n − k )!(k + 1‬‬

‫ﺃﻤﺎ ﺍﻟﻁﺭﻑ ﺍﻷﻴﻤﻥ ﻤﻥ ﺍﻟﻌﻼﻗﺔ ﻓﻴﻜﺘﺏ ﺒﺎﻟﺸﻜل ﺍﻟﺘﺎﻟﻲ‪:‬‬

‫!‪n‬‬ ‫!‪n‬‬
‫= ‪C nk + C nk +1‬‬ ‫‪+‬‬
‫!)‪(n − k )!k! (n − k − 1)!(k + 1‬‬

‫ﺒﺘﻭﺤﻴﺩ ﺍﻟﻤﺨﺎﺭﺝ ﻨﺠﺩ ﺃﻥ‪:‬‬

‫) ‪n!(k + 1) + n!(nk‬‬ ‫!‪n!+ n.n‬‬ ‫!‪(n + 1)n‬‬
‫= ‪C nk + C nk +1‬‬ ‫=‬ ‫=‬
‫!)‪(n − k )(k + 1‬‬ ‫!)‪(n − k )!(k + 1)! (n − k )!(k + 1‬‬
‫!)‪(n + 1‬‬
‫=‬ ‫)‪(2‬‬
‫!)‪(n − k )!(k + 1‬‬

‫ﺒﻤﻘﺎﺭﻨﺔ ‪ 1‬ﻤﻊ ‪ 2‬ﻨﻜﻭﻥ ﺃﺜﺒﺘﻨﺎ ﺼﺤﺔ ﺍﻟﻌﻼﻗﺔ *‪.‬‬

‫ﻭﻨﻤﺜل ﻫﺫﻩ ﺍﻟﻌﻼﻗﺔ ﺒﻴﺎﻨﻴﹰﺎ ﺒﻤﺎ ﻴﺴﻤﻰ ﻤﺜﻠﺙ ‪ Pascal‬ﻜﻤﺎﻴﻠﻲ‪:‬‬

‫‪k 0‬‬ ‫‪1‬‬ ‫‪2‬‬ ‫‪3‬‬ ‫‪4‬‬

‫‪...‬‬
‫‪n‬‬
‫‪0‬‬ ‫‪1‬‬
‫‪1‬‬ ‫‪1‬‬ ‫‪1‬‬
‫‪2‬‬ ‫‪1‬‬ ‫‪2‬‬ ‫‪1‬‬
‫‪3‬‬ ‫‪1‬‬ ‫‪3‬‬ ‫‪3‬‬ ‫‪1‬‬
‫‪4‬‬ ‫‪1‬‬ ‫‪4‬‬ ‫‪6‬‬ ‫‪4‬‬ ‫‪1‬‬

‫‪14‬‬