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

‫ﺍﻟﻔﺼل ﺍﻟﺭﺍﺒﻊ‬
‫ﺍﻟﺤﻠﻘﺎﺕ ﻭﺍﻟﺤﻘﻭل ‪Rings and fields‬‬

‫‪ .1‬ﺍﻟﺤﻠﻘﺔ ‪Ring‬‬

‫ﺘﻌﺭﻴﻑ‬

‫ﻟﺘﻜﻥ ‪ A‬ﻤﺠﻤﻭﻋﺔ ﻤﺯﻭﺩﺓ ﺒﻘﺎﻨﻭﻨﻲ ﺘﺸﻜﻴل ﺩﺍﺨﻠﻴﻴﻥ ﻫﻤﺎ )‪ (+‬ﻭ )×( ‪.‬‬

‫ﻨﻘﻭل ﺃﻥ )× ‪ (A , +,‬ﺤﻠﻘﺔ ﺇﺫﺍ ﻭﻓﻘﻁ ﺇﺫﺍ ﺘﺤﻘﻘﺕ ﺍﻟﺸﺭﻭﻁ ﺍﻟﺘﺎﻟﻴﺔ‪:‬‬

‫‪ -2‬ﺍﻟﻘﺎﻨﻭﻥ )×( ﺘﺠﻤﻴﻌﻲ‪.‬‬ ‫‪ -1‬ﺍﻟﺒﻨﻴﺔ )‪ ( A,+‬ﺯﻤﺭﺓ ﺘﺒﺩﻴﻠﻴﺔ‪.‬‬

‫‪ -3‬ﺍﻟﻘﺎﻨﻭﻥ )×( ﺘﻭﺯﻴﻌﻲ ﻋﻠﻰ ﺍﻟﻘﺎﻨﻭﻥ )‪: (+‬‬

‫‪∀(x , y , z ) ∈ A 3 ; x × ( y + z ) = x × y + x × z‬‬
‫‪(x + y ) × z = x × z + y × z‬‬

‫‪ -4‬ﻴﻘﺒل ﺍﻟﻘﺎﻨﻭﻥ )×( ﻋﻨﺼﺭﹰﺍ ﺤﻴﺎﺩﻴﹰﺎ ﻨﺭﻤﺯ ﻟﻪ ﺒـ ‪ 1‬ﺃﻱ‪:‬‬

‫‪∀ x ∈ A ; x × 1 = 1× x = x‬‬

‫ﻓﻲ ﺤﺎﻟﺔ ﻜﻭﻥ ﺍﻟﻘﺎﻨﻭﻥ )×( ﺘﺒﺩﻴﻠﻲ ﻓﺈﻥ ﺍﻟﺒﻨﻴﺔ )× ‪ (A , +,‬ﺘﺴﻤﻰ ﺤﻠﻘﺔ ﺘﺒﺩﻴﻠﻴﺔ‪.‬‬

‫ﺃﻤﺜﻠﺔ‬

‫‪ -1‬ﺇﻥ ﺍﻟﺒﻨﻰ ﺍﻟﺘﺎﻟﻴﺔ ﻫﻲ ﻋﺒﺎﺭﺓ ﻋﻥ ﺤﻠﻘﺎﺕ ﺘﺒﺩﻴﻠﻴﺔ‪:‬‬

‫)× ‪( , +, ×), ( , +, ×), ( , +,‬‬

‫‪ -2‬ﺍﻟﺒﻨﻴﺔ )• ‪ ( / n , +,‬ﻫﻲ ﺤﻠﻘﺔ ﺘﺒﺩﻴﻠﻴﺔ ﺤﻴﺙ‪:‬‬

‫‪∀k , k ′ ∈ / n ; [k ] + [k ′] = [k + k ′],‬‬

‫‪1‬‬
 ‫]‪; [k ] • [k ′] = [k × k ′‬‬

‫‪ .2‬ﺍﻟﺤﺴﺎﺏ ﻓﻲ ﺍﻟﺤﻠﻘﺎﺕ‬
‫ﻤﺒﺭﻫﻨﺔ )‪(1‬‬

‫ﻟﺘﻜﻥ )× ‪ (A , +,‬ﺤﻠﻘﺔ‪ ،‬ﻋﻨﺩﺌ ٍﺫ ﺍﻟﺨﻭﺍﺹ ﺍﻟﺘﺎﻟﻴﺔ ﻤﺤﻘﻘﺔ‪:‬‬

‫‪∀x ∈ A ; x × 0 = 0 × x = 0 -1‬‬

‫‪∀x ∈ A ; (−1) × x = −x -2‬‬

‫‪∀(x , y , z ) ∈ A 3 ; (x − y ) × z = x × y − y × z‬‬
‫‪-3‬‬
‫‪x × (y − z ) = x × y − x × z‬‬

‫ﺍﻹﺜﺒﺎﺕ‪:‬‬
‫‪∀x ∈ A ; x + 0 = x ⇒ x × (x + 0) = x × x + x × 0 = x × x -1‬‬

‫ﻭﺒﺎﻟﺘﺎﻟﻲ ‪ x × 0 = 0‬ﻭﺒﺎﻟﺸﻜل ﻨﻔﺴﻪ ﻨﺠﺩ ﺃﻥ ‪. 0 × x = 0‬‬

‫‪∀x ∈ A ; (−1) × x + x = ( ( −1) + 1) × x = 0 × x = 0 -2‬‬

‫‪( −1) × x‬‬ ‫ﻭﺒﺎﻟﺘﺎﻟﻲ ‪ ( −1) × x‬ﻫﻭ ﻨﻅﻴﺭ ‪ x‬ﺒﺎﻟﻨﺴﺒﺔ ﻟﻠﻘﺎﻨﻭﻥ )‪ (+‬ﺇﺫﻥ‪= − x :‬‬

‫‪-3‬‬

‫) ‪∀ (x , y , z ) ∈ A 3 ; x × ( y − z ) = x × ( y + ( −1) × z‬‬
‫) ‪= x × y + x × ( ( −1) × z‬‬

‫‪= x × y + ( x × ( −1) ) × z‬‬ ‫ﻷﻥ × ﺘﺠﻤﻴﻌﻲ‬

‫‪= x × y + ( −x ) × z‬‬
‫)) ‪= x × y + ( − ( x × z‬‬
‫‪= x ×y −x ×z‬‬

‫ﻻﺤﻅ ﺃﻥ‬
‫)‪x × (−1) + x = x × ( ( −1) + 1‬‬
‫‪= x × 0 = 0 ⇒ x × (−1) = − x‬‬

‫‪2‬‬
‫ﻭﻜﺫﻟﻙ ‪ ( −x ) × z + x × z = ( ( − x ) + x ) × z = 0 × z = 0‬ﺇﺫﻥ ‪ (−x ) × z‬ﻫﻭ ﻨﻅﻴﺭ ‪ x × z‬ﺃﻱ‬
‫ﺃﻥ ) ‪(−x ) × z = −(x × z‬‬

‫ﻤﻼﺤﻅﺔ‪:‬‬
‫ﻻﺤﻅ ﺃﻨﻪ ﺇﺫﺍ ﻜﺎﻨﺕ )× ‪ (A , +,‬ﺤﻠﻘﺔ ﻓﺈﻥ ﺍﻟﺒﻨﻴﺔ )× ‪ (A ,‬ﻟﻴﺴﺕ ﺒﺎﻟﻀﺭﻭﺭﺓ ﺯﻤﺭﺓ ﻭﻜﻤﺜﺎل ﻋﻠﻰ ﺫﻟﻙ‬
‫ﺍﻟﺤﻠﻘﺔ )× ‪. ( , +,‬‬

‫‪ .3‬ﺍﻟﺤﻠﻘﺎﺕ ﺍﻟﺘﺎﻤﺔ )‪(Entire Ring‬‬

‫ﺘﻌﺭﻴﻑ‬

‫ﻟﺘﻜﻥ )× ‪ (A , +,‬ﺤﻠﻘﺔ‪ .‬ﻨﻘﻭل ﻋﻥ ﺍﻟﻌﻨﺼﺭ ‪ x ∈ A‬ﺃﻨﻪ ﻗﺎﺴﻡ ﻟﻠﺼﻔﺭ ﺇﺫﺍ ﺘﺤﻘﻕ ﺍﻟﺸﺭﻁﺎﻥ‪:‬‬

‫‪x ≠ 0 .i‬‬

‫‪ .ii‬ﻴﻭﺠﺩ ‪ y ∈ A‬ﺒﺤﻴﺙ ‪ y ≠ 0‬ﻭ) ‪.( x × y = 0 or y × x = 0‬‬

‫ﺘﻌﺭﻴﻑ‬

‫ﻨﻘﻭل ﻋﻥ ﺍﻟﺤﻠﻘﺔ )× ‪ (A , +,‬ﺃﻨﻬﺎ ﺘﺎﻤﺔ ﺇﺫﺍ ﺘﺤﻘﻕ ﻤﺎ ﻴﻠﻲ‪:‬‬

‫‪A ≠ {0} -1‬‬

‫‪ (×) -2‬ﺘﺒﺩﻴﻠﻲ‪.‬‬

‫‪∀(x , y ) ∈ A 2 , x × y = 0 ⇒ x = 0 or‬‬ ‫‪ -3‬ﺍﻟﺤﻠﻘﺔ ‪ A‬ﻻ ﺘﺤﻭﻱ ﻗﻭﺍﺴﻡ ﻟﻠﺼﻔﺭ ﺃﻱ ‪y = 0‬‬

‫ﻤﻼﺤﻅﺔ ﻫﺎﻤﺔ‬

‫ﻓﻲ ﺍﻟﺤﻠﻘﺎﺕ ﺍﻟﺘﺎﻤﺔ ﻴﻤﻜﻨﻨﺎ ﺍﻻﺨﺘﺼﺎﺭ ﻋﻠﻰ ﺍﻟﻌﻨﺎﺼﺭ ﻏﻴﺭ ﺍﻟﻤﻌﺩﻭﻤﺔ ﺃﻱ ﺃﻥ‬

‫‪∀ (x , y , z ) ∈ A 3 ; (z ≠ 0) ∧ (x × z = y × z ) ⇒ x = y‬‬

‫ﺤﺴﺏ ﺍﻟﻤﺒﺭﻫﻨﺔ ﺍﻟﺴﺎﺒﻘﺔ ﻓﺈﻥ‪x × z = y × z ⇒ (x − y ) × z = 0 :‬‬

‫ﻭﺒﻤﺎ ﺃﻥ ‪ z ≠ 0‬ﻭ ‪ A‬ﺤﻠﻘﺔ ﺘﺎﻤﺔ ﺃﻱ ﻻ ﺘﺤﻭﻱ ﻗﻭﺍﺴﻡ ﻟﻠﺼﻔﺭ ﻓﺈﻥ ‪ x − y = 0‬ﻭﻤﻨﻪ ‪x = y‬‬

‫‪3‬‬
 ‫ﺒﻌﺽ ﺍﻟﺭﻤﻭﺯ ﻭﺍﻟﻤﺼﻁﻠﺤﺎﺕ‬

‫ﻟﺘﻜﻥ ﻟﺩﻴﻨﺎ ﺍﻟﺤﻠﻘﺔ )× ‪ (A , +,‬ﻭﻟﻴﻜﻥ ‪ a ∈ A‬ﻋﻨﺼﺭﹰﺍ ﻤﻥ ‪ A‬ﻭ ∈ ‪ n‬ﻓﺈﻨﻨﺎ ﻨـﺴﺘﺨﺩﻡ ﺍﻟﺭﻤـﻭﺯ‬

‫ﺍﻟﺘﺎﻟﻴﺔ‪:‬‬
‫‪⎧⎪a + a + … + a if n ≠ 0‬‬
‫‪1 – na = ⎨ n −times‬‬
‫⎩⎪‬ ‫‪0‬‬ ‫‪if n = 0‬‬

‫) ‪2 – ( − n) a = n( − a ) = ( − a ) + ( − a ) + … + ( − a‬‬
‫‪⎧⎪a × × a‬‬ ‫‪if n ≠ 0‬‬
‫‪3 – a = ⎨ n −times‬‬
‫‪n‬‬

‫‪⎪⎩ 1‬‬ ‫‪if n = 0‬‬

‫ﺇﺫﺍ ﻟﻡ ﻴﻜﻥ ﻟﻠﻌﻨﺼﺭ ‪ a ∈ A‬ﻨﻅﻴﺭﹰﺍ ﺒﺎﻟﻨﺴﺒﺔ ﻟﻠﻘﺎﻨﻭﻥ )×( ﻓﻠﻴﺱ ﻫﻨﺎﻙ ﺃﻱ ﻤﻌﻨﻰ ﻟﻠﻜﺘﺎﺒﺔ ‪. a − n‬‬

‫ﺃﻤﺜﻠﺔ‬

‫‪ -1‬ﺍﻟﺤﻠﻘﺎﺕ )× ‪ , ( , +, ×), ( , +, ×), ( , +,‬ﻫﻲ ﺤﻠﻘﺎﺕ ﺘﺎﻤﺔ ﻴﻤﻜﻥ ﺇﺜﺒﺎﺕ ﺫﻟﻙ ﺒﺴﻬﻭﻟﺔ‪.‬‬

‫‪ ( / n , +, •) -2‬ﺤﻠﻘﺔ ﺘﺎﻤﺔ ⇔ ‪ n = 0‬ﺃﻭ ‪ n‬ﻋﺩﺩ ﺃﻭﻟﻲ‪.‬‬

‫ﻭﻹﺜﺒﺎﺕ ﺫﻟﻙ ﻨﻤﻴﺯ ﺍﻟﺤﺎﻻﺕ ﺍﻟﺘﺎﻟﻴﺔ‪:‬‬

‫ﺘﺎﻤﺔ‪.‬‬ ‫‪/n‬‬ ‫ﻭﺒﺎﻟﺘﺎﻟﻲ‬ ‫ﺘﺸﺎﻜل ﺘﻘﺎﺒﻠﻴﹰﺎ‬ ‫‪/n‬‬ ‫‪ n = 0 y‬ﻋﻨﺩﺌ ٍﺫ‬

‫‪ y‬ﻟﻨﻔﺭﺽ ﺃﻥ ‪ n‬ﻋﺩﺩﹰﺍ ﺃﻭﻟﻴـﹰﺎ ﻭﻟـﻴﻜﻥ ]‪ [0] = [r ].[s‬ﻓﻬـﺫﺍ ﻴﻌﻨـﻲ ﺃﻥ‪ [0] = [rs ] :‬ﺃﻱ ﺃﻥ‬
‫∈ ‪ z‬ﺒﺤﻴﺙ ‪ r.s = nz‬ﺃﻱ ﺃﻥ ‪ n‬ﻴﻘﺴﻡ ‪ r.s‬ﻭﺒﻤﺎ ﺃﻨﻪ ﺃﻭﻟﻲ ﻓﺈﻥ ‪ n‬ﺇﻤﺎ‬ ‫‪ rs ∈ n‬ﺃﻱ ﻴﻭﺠﺩ‬
‫ﺃﻥ ﻴﻘﺴﻡ ‪ r‬ﺃﻱ ﺃﻥ ]‪ [r ] = [0‬ﻭ ﺇﻤﺎ ‪ n‬ﻴﻘﺴﻡ ‪ s‬ﻭﺒﺎﻟﺘﺎﻟﻲ ]‪ [ s ] = [0‬ﻭﺒﺎﻟﺘـﺎﻟﻲ ﻨـﺴﺘﻨﺘﺞ ﺃﻥ‪:‬‬
‫ﺤﻠﻘﺔ ﺘﺎﻤﺔ ﻓﻲ ﺤﺎل ‪ n‬ﻋﺩﺩ ﺃﻭﻟﻲ‪.‬‬ ‫‪/n‬‬ ‫‪ [r ][s ] = [0] ⇒ [r ] = [0]or [s ] = 0‬ﺇﺫﻥ‬

‫‪ y‬ﺇﺫﺍ ﻟﻡ ﻴﻜﻥ ‪ n‬ﺃﻭﻟﻴﹰﺎ ﻓـﺈﻥ ‪ ∃ a, b‬ﺒﺤﻴـﺙ ﻴﻜـﻭﻥ ‪ n = a.b‬ﻭﺒﻤـﺎ ﺃﻥ ]‪ [n] = [0‬ﻋﻨﺩﺌـ ٍﺫ‬
‫ﻟﻴﺴﺕ ﺘﺎﻤﺔ‪.‬‬ ‫‪/n‬‬ ‫]‪ [0] = [a][b‬ﻭﺤﻴﺙ ]‪ [b ] ≠ [0], [a ] ≠ [0‬ﺇﺫﻥ‬

‫‪4‬‬
 ‫‪ .4‬ﺍﻟﻌﻨﺎﺼﺭ ﺍﻟﻘﻠﻭﻴﺔ ﻓﻲ ﺤﻠﻘﺔ )‪(Invertible elements‬‬

‫ﺘﻌﺭﻴﻑ‬

‫ﻟﺘﻜﻥ )× ‪ (A , +,‬ﺤﻠﻘﺔ‪ ،‬ﻨﻘﻭل ﻋﻥ ﺍﻟﻌﻨﺼﺭ ‪ x ∈ A‬ﺃﻨﻪ ﻋﻨﺼﺭ ﻗﻠﻭﺏ ﺇﺫﺍ ﻭﺠـﺩ ‪ x ′ ∈ A‬ﺒﺤﻴـﺙ‬
‫ﻴﻜﻭﻥ ‪ . x .x ′ = x ′.x = 1‬ﻨﺭﻤﺯ ﻟﻤﺠﻤﻭﻋﺔ ﺍﻟﻌﻨﺎﺼﺭ ﺍﻟﻘﻠﻭﺒﺔ ﻓﻲ ﺍﻟﺤﻠﻘﺔ ‪ A‬ﺒـ ) ‪.U (A‬‬

‫‪ -1‬ﺨﻭﺍﺹ ﺍﻟﻌﻨﺎﺼﺭ ﺍﻟﻘﻠﻭﻴﺔ‬

‫‪ -1‬ﻟﺘﻜﻥ )× ‪ (A , +,‬ﺤﻠﻘﺔ ﻓﺈﻥ ﻤﺠﻤﻭﻋﺔ ﺍﻟﻌﻨﺎﺼﺭ ﺍﻟﻘﻠﻭﻴﺔ ) ‪ U (A‬ﻫﻲ ﺯﻤـﺭﺓ ﺒﺎﻟﻨـﺴﺒﺔ ﻟﻠﻘـﺎﻨﻭﻥ‬
‫)×( ‪ .‬ﻴﻤﻜﻥ ﺍﻟﺘﺤﻘﻕ ﻤﻥ ﺫﻟﻙ ﺒﺴﻬﻭﻟﺔ‪.‬‬

‫ﻤﺜﺎل‪:‬‬

‫ﻓﻲ ﺍﻟﺤﻠﻘﺔ )× ‪ ( , +,‬ﺯﻤﺭﺓ ﺍﻟﻌﻨﺎﺼﺭ ﺍﻟﻘﻠﻭﻴﺔ ﻫﻲ ﺍﻟﻤﺠﻤﻭﻋﺔ }‪U ( ) = {−1, +1‬‬

‫= ) ( ‪.U‬‬ ‫*‬
‫∈ ‪ q‬ﺤﻴﺙ ‪ q ≠ 0‬ﻟﻪ ﻤﻘﻠﻭﺏ ﻓﻲ ﺇﺫﻥ‬ ‫ﻭﻓﻲ ﺍﻟﺤﻠﻘﺔ )× ‪ ( , +,‬ﻟﻜل ﻋﻨﺼﺭ‬

‫‪ -2‬ﺇﺫﺍ ﻜﺎﻨﺕ ‪ A, B‬ﺤﻠﻘﺘﻴﻥ ﻭﻟﻨﺯﻭﺩ ‪ A × B‬ﺒﺎﻟﻘﺎﻨﻭﻨﻴﻥ‪:‬‬

‫)‪(a, b ) + (a ′, b ′) = (a + a′, b + b ′‬‬

‫)‪(a, b ) • (a ′, b ′) = (a × a′, b × b ′‬‬

‫ﻋﻨﺩﺌﺫ )• ‪ (A × B , +,‬ﺤﻠﻘﺔ ﻭﺘﻘﺒل ) ‪ (1A,1B‬ﻋﻨﺼﺭﹰﺍ ﺤﻴﺎﺩﻴ ﹰﺎ ﺒﺎﻟﻨﺴﺒﺔ ﻟـ )•(‬

‫ﺍﻹﺜﺒﺎﺕ ﺴﻬل ﻭﻴﺘﺭﻙ ﻟﻠﻁﺎﻟﺏ‪.‬‬

‫ﻭﻜﺫﻟﻙ ﻴﻜﻭﻥ ) ‪U (A × B ) = U (A ) ×U (B‬‬

‫) ‪∀ (x , y ) ∈U (A × B ) ⇒ ∃ (x ′, y ′) ∈ A × B ; (x × x ′, y × y ′) = (1A ,1B‬‬

‫ﺇﺫﻥ ‪ x × x ′ = 1A‬ﻭ ‪ y × y ′ = 1B‬ﻭﺒﺎﻟﺘﺎﻟﻲ ) ‪y ∈U (B ), x ∈U (A‬‬

‫ﻭﻤﻨﻪ ) ‪U (A × B ) ⊂ U (A ) ×U (B ) ⇐ (x , y ) ∈U (A ) ×U (B‬‬

‫ﻭﺒﺴﻬﻭﻟﺔ ﻨﺠﺩ ﺃﻥ ) ‪.U (A ) ×U (B ) ⊂ U (A × B‬‬

‫‪5‬‬
 ‫‪ -2‬ﺜﻨﺎﺌﻲ ﺍﻟﺤﺩ ﻨﻴﻭﺘﻥ‬

‫ﻤﺒﺭﻫﻨﺔ )‪(2‬‬

‫ﻟﺘﻜﻥ )× ‪ (A , +,‬ﺤﻠﻘﺔ‪ ،‬ﻭﻟﻨﻔﺭﺽ ﺃﻥ ‪ (a, b) ∈ A 2‬ﻴﺤﻘﻕ ﻤﺎ ﻴﻠﻲ‪a × b = b × a :‬‬

‫‪n‬‬
‫ﻋﻨﺩﺌ ِﺫ ‪∀ n ∈ ; (a + b ) n = ∑C nk a k b n − k‬‬
‫‪k =0‬‬

‫‪⎡ n −1‬‬ ‫⎤‬

‫ﻭﻜﺫﻟﻙ‪∀ n ≥ 1; (a n − b n ) = (a − b ) ⎢ ∑ a n −1− k b k ⎥ :‬‬
‫‪⎣ k =0‬‬ ‫⎦‬

‫ﺍﻹﺜﺒﺎﺕ ﺴﻬل ﺒﺎﺴﺘﺨﺩﺍﻡ ﻤﺒﺩﺃ ﺍﻟﺘﺩﺭﻴﺞ ﻋﻠﻰ ‪. n‬‬

‫‪ .5‬ﺍﻟﻤﺜﺎﻟﻴﺎﺕ ﻓﻲ ﺤﻠﻘﺔ ﺘﺒﺩﻴﻠﻴﺔ )‪(Ideals‬‬

‫ﺘﻌﺭﻴﻑ‬

‫ﻟﺘﻜﻥ )× ‪ (A , +,‬ﺤﻠﻘﺔ ﺘﺒﺩﻴﻠﻴﺔ‪ .‬ﻭﻟﻴﻜﻥ ‪ I ⊆ A‬ﺠﺯﺀﹰﺍ ﻤﻥ ‪ . A‬ﻨﻘﻭل ﺃﻥ ‪ I‬ﻫﻭ ﻤﺜﺎﻟﻲ ﻓـﻲ ‪ A‬ﺇﺫﺍ‬
‫ﺘﺤﻘﻕ ﺍﻟﺸﺭﻁﺎﻥ‪:‬‬

‫‪ ( I ,+) -1‬ﺯﻤﺭﺓ ﺠﺯﺌﻴﺔ ﻤﻥ )‪. ( A,+‬‬

‫‪ ∀ x ∈ I -2‬ﻭ ‪ ∀ a ∈ A‬ﻓﺈﻥ ‪ a × x ∈ I‬ﺃﻭ ‪ AI ⊂ I‬ﻨﻘﻭل ﺃﻥ ﺍﻟﺠﺯﺀ ‪ I‬ﻤﺎﺹ‪.‬‬

‫ﻨﺘﻴﺠﺔ ﻫﺎﻤﺔ‬
‫ﺇﺫﺍ ﻜﺎﻥ ‪ I‬ﻤﺜﺎﻟﻴ ﹰﺎ ﻓﻲ ‪ A‬ﺤﻴﺙ ‪ A‬ﺤﻠﻘﺔ ﺘﺒﺩﻴﻠﻴﺔ ﻓﺈﻥ‪(1A ∈ I ) ⇔ I = A :‬‬

‫ﻭﺫﻟﻙ ﻷﻥ‪ ∀ a ∈ A ; a = a ×1∈ I :‬ﺇﺫﻥ ‪ A ⊂ I‬ﻭﻤﻨﻪ ‪. A = I‬‬

‫ﻤﻼﺤﻅﺔ‬
‫ﺇﻥ ﺠﻤﻴﻊ ﺍﻟﻤﺜﺎﻟﻴﺎﺕ ﻓﻲ ﺤﻠﻘﺔ ﺍﻷﻋﺩﺍﺩ ﺍﻟﺼﺤﻴﺤﺔ )× ‪ ( , +,‬ﻫﻲ ﻤﻥ ﺍﻟﻨﻤﻁ ‪. n‬‬

‫ﺍﻹﺜﺒﺎﺕ ﻤﻭﺠﻭﺩ ﻀﻤﻥ ﺍﻟﺘﻤﺎﺭﻴﻥ‪.‬‬

‫‪6‬‬
 ‫ﺘﻌﺭﻴﻑ ﺍﻟﻤﺜﺎل ﺍﻟﺭﺌﻴﺴﻲ )‪(Principal ideal‬‬

‫ﻟﺘﻜﻥ )× ‪ (A , +,‬ﺤﻠﻘﺔ ﺘﺒﺩﻴﻠﻴﺔ‪ .‬ﻨﻘﻭل ﻋﻥ ‪ I ⊂ A‬ﺃﻨﻪ ﻤﺜﺎل ﺭﺌﻴﺴﻲ ﺇﺫﺍ ﻭﻓﻘﻁ ﺇﺫﺍ ﻭﺠـﺩ ﻋﻨـﺼﺭ‬
‫‪ a ∈ A‬ﺒﺤﻴﺙ ﻴﻜﻭﻥ ‪ I = aA‬ﺃﻱ ﺃﻥ } ‪ I = {a × b ; b ∈ A‬ﻭﻨﻘﻭل ﺃﻥ ‪ aA‬ﻫﻭ ﺍﻟﻤﺜﺎﻟﻲ ﺍﻟﻤﻭﻟـﺩ‬
‫ﺒﺎﻟﻌﻨﺼﺭ ‪. a‬‬

‫ﺘﻌﺭﻴﻑ ﺍﻟﺤﻠﻘﺔ ﺍﻟﺭﺌﻴﺴﻴﺔ )‪(Principal Ring‬‬

‫ﻨﻘﻭل ﻋﻥ )× ‪ (A , +,‬ﺃﻨﻬﺎ ﺤﻠﻘﺔ ﺭﺌﻴﺴﻴﺔ ﺇﺫﺍ ﺘﺤﻘﻕ ﺍﻟﺸﺭﻁﺎﻥ‪:‬‬

‫‪ A -1‬ﺤﻠﻘﺔ ﺘﺎﻤﺔ‪.‬‬

‫‪ -2‬ﻜل ﻤﺜﺎﻟﻲ ﻓﻲ ‪ A‬ﻤﺜﺎﻟﻲ ﺭﺌﻴﺴﻲ‪.‬‬

‫ﻤﺜﺎل‬
‫ﺤﻠﻘﺔ ﺍﻷﻋﺩﺍﺩ ﺍﻟﺼﺤﻴﺤﺔ )× ‪ ( , +,‬ﻫﻲ ﺤﻠﻘﺔ ﺭﺌﻴﺴﻴﺔ ﻷﻨﻬﺎ ﺤﻠﻘﺔ ﺘﺎﻤﺔ ﻭﻜﺫﻟﻙ ﻜل ﻤﺜﺎﻟﻲ ﻤـﻥ‬
‫‪. n = a.‬‬ ‫∈ ‪ a = n‬ﺒﺤﻴﺙ ﺃﻥ‬ ‫∈ ‪ n‬ﺇﺫﻥ ﻴﻭﺠﺩ‬ ‫‪ n‬ﺤﻴﺙ‬ ‫ﻫﻭ ﻤﻥ ﺍﻟﻨﻤﻁ‬

‫ﻤﺒﺭﻫﻨﺔ )‪(3‬‬

‫ﻟﺘﻜﻥ )× ‪ (A , +,‬ﺤﻠﻘﺔ ﺘﺒﺩﻴﻠﻴﺔ‪ ،‬ﻭﻟﺘﻜﻥ ‪ I1 , I 2 ,…, I m‬ﻤﺜﺎﻟﻴﺎﺕ ﻓﻲ ‪ ، A‬ﺇﺫﻥ ﻜل ﻤﻥ‪:‬‬

‫‪m‬‬ ‫‪n‬‬
‫‪K = ∑ I k = {a1 +‬‬ ‫‪+ am , ai ∈ I i } , J = ∩ I k‬‬
‫‪k =1‬‬ ‫‪k =1‬‬

‫ﻫﻲ ﻤﺜﺎﻟﻲ ﻓﻲ ‪. A‬‬

‫‪7‬‬
 ‫‪ .6‬ﺍﻟﺘﺸﺎﻜﻼﺕ ﺍﻟﺤﻠﻘﻴﺔ )‪(Morphisms of Rings‬‬

‫ﺘﻌﺭﻴﻑ‬

‫ﻟﺘﻜﻥ )× ‪ (A , +,‬ﻭ )× ‪ (B , +,‬ﺤﻠﻘﺘﻴﻥ‪ ،‬ﻭﻟﻴﻜﻥ ‪f : A → B‬‬

‫ﻨﻘﻭل ﺃﻥ ‪ f‬ﺘﺸﺎﻜل ﺤﻠﻘﻲ ﻤﻥ ‪ A‬ﺇﻟﻰ ‪ B‬ﺇﺫﺍ ﺘﺤﻘﻘﺕ ﺍﻟﺸﺭﻭﻁ ﺍﻟﺘﺎﻟﻴﺔ‪:‬‬

‫‪. f (1A ) = 1B -1‬‬

‫; ‪∀( x, y ) ∈ A 2‬‬ ‫‪f ( x + y ) = f ( x ) + f ( y ) -2‬‬

‫‪∀(x , y ) ∈ A 2 ; f (x × y ) = f (x ) × f ( y ) -3‬‬

‫ﻭﻨﻘﻭل ﻋﻥ ‪ f‬ﺃﻨﻪ ﺘﺸﺎﻜل ﺤﻠﻘﻲ ﻨﻘﺎﺒﻠﻲ ﺇﺫﺍ ﻜﺎﻥ ﺘﻘﺎﺒ ﹰ‬

‫ﻼ‪.‬‬

‫ﻤﺒﺭﻫﻨﺔ )‪(4‬‬

‫ﻟﺘﻜﻥ )× ‪ (A , +,‬ﻭ )× ‪ (B , +,‬ﺤﻠﻘﺘﻴﻥ ﺘﺒﺩﻴﻠﻴﺘﻴﻥ‪ .‬ﻭﻟﻴﻜﻥ ‪ f : A → B‬ﺘﺸﺎﻜ ﹰ‬

‫ﻼ ﺤﻠﻘﻴﹰﺎ‪ .‬ﺇﻥ ﺍﻟـﺼﻭﺭﺓ‬
‫‪f‬‬ ‫‪−1‬‬
‫‪({0}) = ker f‬‬ ‫ﺍﻟﻌﻜﺴﻴﺔ ﻷﻱ ﻤﺜﺎﻟﻲ ‪ I‬ﻤﻥ ‪ B‬ﻫﻲ ﻤﺜﺎﻟﻲ ﻓﻲ ‪ . A‬ﻭﺒﺸﻜل ﺨـﺎﺹ ﻟـﺩﻴﻨﺎ‬
‫ﻤﺜﺎﻟﻲ ﻓﻲ ‪ . A‬ﻭﺘﺘﺤﻘﻕ ﺍﻟﻤﺴﺎﻭﺍﺓ }‪ ker f = {0‬ﺇﺫﺍ ﻭﻓﻘﻁ ﺇﺫﺍ ﻜﺎﻥ ‪ f‬ﻤﺘﺒﺎﻴﻨﹰﺎ‪.‬‬

‫ﺍﻹﺜﺒﺎﺕ‪ :‬ﻴﺘﻡ ﻤﺒﺎﺸﺭﺓ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺍﻟﺘﻌﺎﺭﻴﻑ‪.‬‬

‫‪ .7‬ﺘﻁﺒﻴﻕ )ﺤﻠﻘﺔ ﺍﻷﻋﺩﺍﺩ ﺍﻟﺼﺤﻴﺤﺔ(‬

‫)‪(Euclidean division‬‬ ‫‪ -1‬ﺍﻟﻘﺴﻤﺔ ﺍﻟﺘﻘﻠﻴﺩﻴﺔ ﻓﻲ‬

‫ﻤﺒﺭﻫﻨﺔ )‪(5‬‬

‫∈ ) ‪ ∃!(q , r‬ﺒﺤﻘﻕ ‪ a = bq + r‬ﺣ ﻴ ﺚ ‪. 0 ≤ r < b‬‬ ‫‪2‬‬

‫× ∈ ) ‪ (a, b‬ﺤﻴﺙ ‪ . b ≠ 0‬ﻋﻨﺩﺌﺫ‬ ‫ﻟﻴﻜﻥ‬

‫ﻨﻘﻭل ﺃﻥ ‪ q‬ﻫﻭ ﺤﺎﺼﺭ ﺍﻟﻘﺴﻤﺔ ﻭ ‪ r‬ﻫﻭ ﺒﺎﻗﻲ ﺍﻟﻘﺴﻤﺔ ﺍﻷﻗﻠﻴﺩﻴﺔ ﻟـ ‪ a‬ﻋﻠﻰ ‪. b‬‬

‫ﺍﻹﺜﺒﺎﺕ‪:‬‬

‫ﻫﻲ ﺯﻤﺭﺓ ﺨﺎﺭﺝ ﺍﻟﻘﺴﻤﺔ ﻭﺇﻥ ﻜل ﻋﻨﺼﺭ ﻤﻥ ﻫﺫﻩ ﺍﻟﺯﻤﺭﺓ ﻴﻜﺘﺏ ﺒﺎﻟـﺸﻜل‬ ‫‪|b‬‬ ‫ﺒﻤﻼﺤﻅﺔ ﺃﻥ‬
‫ﺍﻟﺘــﺎﻟﻲ‪ ∀ [r ] ∈ b ; [r ] = r + b ; r < b :‬ﺇﺫﻥ ﻤــﻥ ﺃﺠــل ﺃﻱ ﻋﻨــﺼﺭ ﻓــﺈﻥ‬
‫‪∃q ∈ ; a = r + bq‬‬

‫‪8‬‬
 ‫ﺘﻌﺭﻴﻑ ﻗﺎﺒﻠﻴﺔ ﺍﻟﻘﺴﻤﺔ )‪(Divisibility‬‬

‫∈ ) ‪ (a, b‬ﻋﺩﺩﻴﻥ ﺼﺤﻴﺤﻴﻥ‪ .‬ﻨﻘﻭل ﺃﻥ ﺍﻟﻌﺩﺩ ﺍﻟﺼﺤﻴﺢ ‪ a‬ﻴﻘﺴﻡ ﺍﻟﻌـﺩﺩ ﺍﻟـﺼﺤﻴﺢ ‪ b‬ﺇﺫﺍ‬ ‫‪2‬‬
‫ﻟﻴﻜﻥ‬
‫ﻭﻓﻘﻁ ﺇﺫﺍ ﺘﺤﻘـﻕ ﺍﻟـﺸﺭﻁ ﺍﻟﺘـﺎﻟﻲ‪ ∃k ∈ ; b = k × a :‬ﻭﻨﺭﻤـﺯ ﻟـﺫﻟﻙ ﺒــ ‪ a b‬ﺃﻱ ﺃﻥ‪:‬‬
‫‪a b ⇔ ∃k ∈ ; n = k × a‬‬

‫ﻤﻼﺤﻅﺎﺕ‬

‫‪ ∀n ∈ ; n 0 ; -1‬ﻷﻥ ‪ ، 0 = 0.n‬ﺇﺫﻥ ‪ n‬ﻋﺩﺩ ﻁﺒﻴﻌﻲ ﻴﻘﺴﻡ ﺍﻟﺼﻔﺭ‪.‬‬

‫‪ ∀n ∈ ; 0 n ⇒ n = 0 -2‬ﻷﻥ ‪∀ n ∈ ; 0 n ⇒ n = k × 0 = 0‬‬

‫‪⎧⎪a b‬‬
‫∈ ) ‪∀ (a, b , c , d‬‬ ‫‪4‬‬
‫⎨;‬ ‫‪⇒ ac | bd -3‬‬
‫⎩⎪‬‫‪c‬‬ ‫‪d‬‬

‫‪ ∃ k 1 ∈ Z ; b = k × a ⇐ a b‬ﻭ ‪ ∃ k 1 ∈ Z ; d = l × d ⇐ c d‬ﻭﺒﺎﻟﺘﺎﻟﻲ‬
‫∈ ‪ k = k 1 × k 2‬ﺣ ﻴ ﺚ ‪. b ×d = k × a ×c‬‬ ‫‪ b × d = k 1 × a × k 2 × c = k 1 × k 2 × a × c‬ﺃﻱ ﻴﻭﺠﺩ‬

‫ﻤﺒﺭﻫﻨﺔ )‪(6‬‬

‫‪. a b ⇔ (b ∈ a ) ⇔ b ⊂ a‬‬ ‫ﺇﺫﺍ ﻜﺎﻥ ‪ (a, b) ∈ Z 2‬ﻋﻨﺩﺌ ٍﺫ‬

‫ﺘﻌﺭﻴﻑ ﺍﻟﺘﻁﺎﺒﻕ )‪(Congruency‬‬

‫∈ ) ‪ . (a, b‬ﻨﻘﻭل ﺃﻥ ‪ a‬ﻤﺘﻁﺎﺒﻕ ﺃﻭ ﻤﻨـﺴﺠﻡ ﻤـﻊ ‪b‬‬ ‫‪2‬‬

‫ﻟﻴﻜﻥ ﻟﺩﻴﻨﺎ ﺍﻟﻌﺩﺩ ﺍﻟﻁﺒﻴﻌﻲ ‪ 0 < n‬ﻭﻟﻴﻜﻥ‬
‫ﻭﻓﻕ ‪ n‬ﺇﺫﺍ ﻜﺎﻥ ‪ n‬ﻴﻘﺴﻡ ﺍﻟﻌﺩﺩ ﺍﻟﺼﺤﻴﺢ )‪ (b − a‬ﻭﻨﻜﺘﺏ )‪ a ≡ b med (n‬ﺃﻱ ﺃﻥ‪:‬‬

‫‪a ≡ b mod(n ) ⇔ n | (b − a ) ⇔ ∃k ∈ ; b − a = k × n ⇔ b = a + k × n‬‬

‫ﻤﺒﺭﻫﻨﺔ )‪(7‬‬

‫∈ ) ‪ (a, b‬ﻋﻨﺩﺌ ٍﺫ‪ a ≡ b mod(n ) ⇔ ra = rb :‬ﺤﻴﺙ ‪ ra‬ﻴﻤﺜل ﺒﺎﻗﻲ‬ ‫‪2‬‬

‫ﻟﻴﻜﻥ ‪ 0 < n‬ﻋﺩﺩ ﻁﺒﻴﻌﻲ ﻭ‬
‫ﻗﺴﻤﺔ ‪ a‬ﻋﻠﻰ ‪ n‬ﻭ ‪ rb‬ﻴﻤﺜل ﺒﺎﻗﻲ ﻗﺴﻤﺔ ‪ b‬ﻋﻠﻰ ‪. n‬‬

‫ﻤﺒﺭﻫﻨﺔ )‪(8‬‬

‫ﺒﺎﻟﺸﻜل ﺍﻟﺘﺎﻟﻲ‪:‬‬ ‫∈ ‪ . n‬ﺇﻥ ﺍﻟﻌﻼﻗﺔ ≡ ﺍﻟﻤﻌﺭﻓﺔ ﻋﻠﻰ‬ ‫*‬

‫ﻟﻴﻜﻥ‬
‫∈ ) ‪ ∀ (a, b‬ﻫﻲ ﻋﻼﻗﺔ ﺘﻜﺎﻓﺅ‪.‬‬ ‫‪2‬‬
‫) ‪; a ≡ b ⇔ a ≡ b mod(n‬‬

‫‪9‬‬
 ‫ﻤﺒﺭﻫﻨﺔ )‪(9‬‬

‫∈ ‪ n‬ﻭ ﻭﻟﻨﻔﺭﺽ ﺃﻥ‪ a ≡ b mod(n) :‬ﻭ )‪c ≡ d mod (n‬‬ ‫*‬

‫∈ ) ‪, (a, b , c , d‬‬ ‫‪4‬‬
‫ﻟﻴﻜﻥ‬

‫ﻋﻨﺩﺌ ٍﺫ‪:‬‬
‫‪a + c = (b + d ) mod (n) -1‬‬

‫‪a.c = (b.d ) mod (n) -2‬‬

‫‪∀k ∈ , a k ≡ b k mod(n ) -3‬‬

‫ﻤﻼﺤﻅﺔ‪:‬‬

‫∈ ‪ n‬ﻓﺈﻥ }]‪| n = {[0],[1],… ,[n − 1‬‬ ‫*‬

‫ﺇﺫﺍ ﻜﺎﻥ‬

‫ﺘﻤﺜل ﺼﻔﻭﻑ ﺘﻜﺎﻓﺅ ﺍﻟﻌﻼﻗﺔ ≡ ﻭﺘﻤﺜل ﺒﺎﻗﻲ ﺍﻟﻘـﺴﻤﺔ ﺍﻹﻗﻠﻴﺩﻴـﺔ‬ ‫‪|n‬‬ ‫ﺇﻥ ﻋﻨﺎﺼﺭ ﺍﻟﻤﺠﻤﻭﻋﺔ‬
‫ﻋﻠﻰ ﺍﻟﻌﺩﺩ ﺍﻟﻁﺒﻴﻌﻲ ‪. 0 < n‬‬ ‫ﻟﻌﻨﺎﺼﺭ‬

‫ﻤﺜﺎل‪:1‬‬

‫ﺃﻭﺠﺩ ﺒﺎﻗﻲ ﺍﻟﻘﺴﻤﺔ ﺍﻷﻗﻠﻴﺩﻴﺔ ﻟﻠﻌﺩﺩ ‪ a = 126745‬ﻋﻠﻰ ﺍﻟﻌﺩﺩ ‪. n = 9‬‬

‫ﺍﻟﺤل‪:‬‬

‫ﺇﺫﻥ ﺒﺎﻗﻲ ﻗﺴﻤﺔ ‪ a‬ﻋﻠـﻰ ‪ n‬ﻫـﻭ ﻋﻨـﺼﺭ ﻤـﻥ ﺍﻟﻤﺠﻤﻭﻋـﺔ‬ ‫ﺇﻥ }]‪| 9 = {[0],[1],… ,[8‬‬
‫}‪. {0,1,2,…,8‬‬

‫ﻻﺤﻅ ﺃﻥ ﺍﻟﻌﺩﺩ ‪ a‬ﻻ ﻴﻘﺒل ﺍﻟﻘﺴﻤﺔ ﺍﻟﻤﻨﺘﻬﻴﺔ ﻋﻠﻰ ‪ .9‬ﻟﻜﻥ ‪ a − 7 = 126738‬ﻴﻘﺒل ﺍﻟﻘﺴﻤﺔ ﻋﻠـﻰ ‪9‬‬
‫∈ ‪ k‬ﺒﺤﻴﺙ ﻴﻜﻭﻥ ‪ 126745 − 7 = 9k‬ﻭﺒﺎﻟﺘﺎﻟﻲ ‪ ra = r7‬ﺤﺴﺏ ﺍﻟﻨﻅﺭﻴﺔ )‪(7‬‬ ‫ﺇﺫﻥ ﻴﻭﺠﺩ‬

‫‪ 7 = 9 × 0 + 7‬ﺃﻱ ‪ γ 7 = 7‬ﻭﺒﺎﻟﺘﺎﻟﻲ ‪. γ a = 7‬‬

‫ﻤﺜﺎل‪:2‬‬

‫ﺃﻭﺠﺩ ﺒﺎﻗﻲ ﻗﺴﻤﺔ ﺍﻟﻌﺩﺩ ‪ a = 1211256‬ﻋﻠﻰ ‪.7‬‬

‫ﺍﻟﺤل‪:‬‬

‫ﻨﻁﺒﻕ ﺍﻟﻤﺒﺭﻫﻨﺔ ‪ 9‬ﺃﻱ ‪ ra‬ﻴﺴﺎﻭﻱ ﺇﻟﻰ ‪. r121‬‬

‫ﺇﻥ }]‪ : | 7 = {[0],[1],… ,[6‬ﻭﺒﺎﻟﺘﺎﻟﻲ }‪ra ∈ {0,1,2,…,6‬‬

‫‪10‬‬
‫ـﻭ ‪ 2‬ﻷﻥ‬
‫ـﺴﻤﺔ ﻫـ‬
‫ـﺎﻗﻲ ﺍﻟﻘـ‬
‫ـﻅ ﺃﻥ ‪ 121 − 2 = 119 = 7k‬ﺃﻱ ﺃﻥ )‪ . 2 ≡ 121mod (7‬ﺇﺫﻥ ﺒـ‬
‫ﻨﻼﺤـ‬
‫‪2 = 7.0 + 2‬‬

‫ﻤﺜﺎل‪:3‬‬

‫∈ ‪ x‬ﺒﺤﻴﺙ ﻴﻘﺒل ‪ x 2 − 4 x + 3‬ﺍﻟﻘﺴﻤﺔ ﻋﻠﻰ ‪.6‬‬ ‫ﺃﻭﺠﺩ ﺍﻟﻌﺩﺩ ﺍﻟﺼﺤﻴﺢ‬

‫ﺍﻟﺤل‪:‬‬

‫∈ ‪ k‬ﺃﻱ ﺃﻥ ‪(x − 1)(x − 3) = 6k‬‬ ‫ﻴﺠﺏ ﺃﻥ ﻴﻜﻭﻥ‪ x 2 − 4x + 3 = 6k :‬ﺤﻴﺙ‬

‫ﻭﺒﺎﻟﺘﺎﻟﻲ ‪ 6‬ﻴﻘﺴﻡ )‪ ( x − 3‬ﺃﻭ ﻴﻘﺴﻡ )‪ ( x − 1‬ﺃﻱ ﺃﻥ ‪ x = 6k 1 + 1‬ﺃﻭ ‪x = 6k 2 + 3‬‬

‫ﻼ ﻤﻥ ﺃﺠل ‪ k 1 = 2‬ﻭﻤﻥ ﺃﺠل ‪ x = 13‬ﻨﺠﺩ ﺃﻥ ‪( x − 1)( x − 3) = 12 × 10 = 120 = 6 × 20‬‬

‫ﻤﺜ ﹰ‬

‫ﻭﻤﻥ ﺃﺠل ‪ k 2 = 2‬ﻭﻤﻥ ﺃﺠل ‪ x = 15‬ﻨﺠﺩ ﺃﻥ ‪. ( x − 1)( x − 3) = 14 × 12 = 6 × 28‬‬

‫‪ -2‬ﺍﻟﻘﺎﺴﻡ ﺍﻟﻤﺸﺘﺭﻙ ﺍﻷﻋﻅﻤﻲ ﻭﺍﻟﻤﻀﺎﻋﻑ ﺍﻟﻤﺸﺘﺭﻙ ﺍﻷﺼﻐﺭﻱ‬

‫)‪(Greatest Common Divisor and Least Common Multiple‬‬
‫)‪(GCD and LCM‬‬
‫ﺘﻌﺭﻴﻑ‬

‫∈ ) ‪ (a, b‬ﻋﻨﺩﺌ ٍﺫ‪:‬‬ ‫‪2‬‬

‫ﻟﻴﻜﻥ‬
‫*‬
‫∈ ) ‪ (a, b‬ﻭﺍﻟﻤﺤﺘﻭﺍﺓ ﻓﻲ‬ ‫‪2‬‬
‫‪ -1‬ﺇﻥ ﻤﺠﻤﻭﻋﺔ ﺍﻟﻘﻭﺍﺴﻡ ﺍﻟﻤﺸﺘﺭﻜﺔ ﻟﻠﻌﺩﺩﻴﻥ ﺍﻟﺼﺤﻴﺤﻴﻥ‬
‫ﺘﺤﻭﻱ ﺃﻜﺒﺭ ﻋﻨﺼﺭﹰﺍ ﻭﻨﺭﻤﺯ ﻟﻪ ﺒـ )‪ δ = gcd(a, b‬ﻭﻨﺴﻤﻴﻪ ﺍﻟﻘﺎﺴﻡ ﺍﻟﻤﺸﺘﺭﻙ ﺍﻷﻋﻅﻤﻲ‬
‫ﻟـ )‪. (a, b‬‬

‫ﺘﺤﻭﻱ ﺍﺼﻐﺭ‬ ‫*‬

‫∈ ) ‪ (a, b‬ﻭﺍﻟﻤﺤﺘﻭﺍﺓ ﻓﻲ‬ ‫‪2‬‬
‫‪ -2‬ﻤﺠﻤﻭﻋﺔ ﺍﻟﻤﻀﺎﻋﻔﺎﺕ ﺍﻟﻤﺸﺘﺭﻜﺔ ﻟﻠﻌﺩﺩﻴﻥ‬
‫ﻋﻨﺼﺭ ﻨﺭﻤﺯ ﻟﻪ ﺒـ ) ‪ µ = LCM (a, b‬ﻭﻨﺩﻋﻭﻩ ﺍﻟﻤﻀﺎﻋﻑ ﺍﻟﻤﺸﺘﺭﻙ ﺍﻷﺼﻐﺭ ﻟـ )‪. (a, b‬‬

‫ﻤﺒﺭﻫﻨﺔ )‪(10‬‬

‫∈ ) ‪ (a, b‬ﺤﻴﺙ ) ‪ δ = gcd (a, b‬ﻭ ) ‪ µ = lcm (a, b‬ﻋﻨﺩﺌ ٍﺫ‪:‬‬ ‫‪*2‬‬
‫ﻟﻴﻜﻥ‬

‫∈ ) ‪ δ = a + b = {au + bv ; (u ,v‬ﻭ ‪µ = a ∩ b‬‬ ‫‪2‬‬

‫}‬

‫‪11‬‬
 ‫ﻤﺒﺭﻫﻨﺔ )‪(11‬‬

‫ﻟﻴﻜﻥ ‪ . (a, b) ∈ Z *2‬ﺃﺜﺒﺕ ﻤﺎ ﻴﻠﻲ ﻤﻥ ﺃﺠل ﺃﻱ ﻋﺩﺩ ﺼﺤﻴﺢ * ‪ k ∈ Z‬ﻓﺈﻥ‪:‬‬

‫)‪ gcd(ka, kb) = k gcd(a, b‬ﻭ ) ‪lcm (am , kb ) = k lcm (a , b‬‬

‫ﺍﻟﺤل‪:‬‬

‫ﻟﻨﻔﺭﺽ ﺃﻥ )‪ δ `= gcd(ka, kb‬ﻓﺈﻥ‬

‫; ‪δ ` = (ka ) + (kb ) = {(ka )u + (kb )v‬‬ ‫∈ ) ‪(u ,v‬‬ ‫‪2‬‬
‫}‬
‫{‬
‫∈ ) ‪= k (au ) + k (bv ); (u ,v‬‬ ‫‪2‬‬
‫}‬
‫{‬
‫∈ ) ‪= k au + bv ; (u ,v‬‬ ‫‪2‬‬
‫}‬
‫‪= kδ‬‬

‫‪ δ = a + b‬ﺇﺫﻥ ‪δ `= k δ‬‬ ‫ﺤﻴﺙ ) ‪and δ = gcd(a , b‬‬

‫ﻤﺒﺭﻫﻨﺔ ﺇﻗﻠﻴﺩﺱ )‪(12‬‬

‫‪⎧⎪a = bq + r ,‬‬
‫⎨ ; ‪∃ !(a, r ) ∈ N 2‬‬ ‫ﻟﻴﻜﻥ ‪ (a, b) ∈ Z *2‬ﻋﻨﺩﺌ ٍﺫ ﺇﺫﺍ ﺘﺤﻘﻕ ﺍﻟﺸﺭﻁ ﺍﻟﺘﺎﻟﻲ‬
‫‪⎪⎩ 0 ≤ r < b‬‬

‫ﻓﺈﻥ‪gcd (a , b ) = gcd (b , r ) :‬‬

‫ﻤﻼﺤﻅﺔ‬

‫ﺇﻥ ﻤﺒﺭﻫﻨﺔ ﺇﻗﻠﻴﺩﺱ ﺘﻤﻜﻨﻨﺎ ﻤﻥ ﺇﻴﺠﺎﺩ ﺨﻭﺍﺭﺯﻤﻴﺔ ﺇﻗﻠﻴﺩﺱ ﻟﺤـﺴﺎﺏ ﺍﻟﻘﺎﺴـﻡ ﺍﻟﻤـﺸﺘﺭﻙ ﻟﻠﻌـﺩﺩﻴﻥ‬
‫∈ ) ‪ (a, b‬ﺤﻴﺙ ‪ 0 < a < b‬ﻭﺫﻟﻙ ﺩﻭﻥ ﺍﻹﺨﻼل ﺒﻌﻤﻭﻤﻴﺔ ﺍﻟﻤﺴﺄﻟﺔ ﻷﻥ‪:‬‬ ‫‪*2‬‬

‫) ‪gcd ( a, b ) = gcd ( a , b ) = gcd ( b , a‬‬

‫‪ -3‬ﺨﻭﺍﺭﺯﻤﻴﺔ ﺇﻗﻠﻴﺩﺱ )‪(Euclidean Algorithm‬‬

‫ﻨﻌﺭﻑ ﺍﻟﻤﺘﺘﺎﻟﻴﺔ ‪ (rk ) k ≥0‬ﺘﺩﺭﻴﺠﻴﹰﺎ ﻜﻤﺎ ﻴﻠﻲ‪:‬‬

‫ﻨﻀﻊ ‪ r0 = a‬ﻭ ‪ r1 = b‬ﻭﻤﻥ ﺜﻡ ﻨﻌﺭﻑ ‪ rk +1‬ﻋﻠﻰ ﺃﻨـﻪ ﺒـﺎﻗﻲ ﻗـﺴﻤﺔ ‪ rk −1‬ﻋﻠـﻰ ‪ rk ≠ 0‬ﺃﻱ‬
‫ﺒﺎﻻﻋﺘﻤﺎﺩ ﻋﻠﻰ ﻤﺒﺭﻫﻨﺔ ﺇﻗﻠﻴﺩﺱ‪:‬‬

‫∈ ) ‪∃ !(q k , rk +1‬‬ ‫‪2‬‬

‫‪; rk −1 = q k rk + rk +1 ; 0 ≤ rk +1 < rk‬‬

‫ﺇﻥ ﺍﻟﺴﻠﺴﻠﺔ ‪ (rk ) k ≥0‬ﻤﺘﻨﺎﻗﺼﺔ ﺘﻤﺎﻤﹰﺎ‪ .‬ﻋﻨﺩﺌﺫ ﻴﻭﺠﺩ ﺭﺘﺒﺔ ‪ n ≥ 1‬ﺒﺤﻴـﺙ ﻴﻜـﻭﻥ ‪ rn ≠ 0‬ﻭﻟﻜـﻥ‬
‫‪ . rn +1 = 0‬ﺇﺫﻥ ﺤﺴﺏ ﻨﻅﺭﻴﺔ ﺇﻗﻠﻴﺩﺱ ﻓﺈﻥ ) ‪∀ k ∈ N n−1 , gcd(a, b) = gcd(rk , rk +1‬‬

‫‪12‬‬
‫ﺒﻤﺎ ﺃﻥ ‪ rn‬ﺘﻘﺴﻡ ‪ rn−1‬ﻓﺈﻥ ‪ gcd(rn , rn−1 ) = rn‬ﻭﺒﺎﻟﺘﺎﻟﻲ ‪ rn‬ﻫﻭ )‪ gcd(a, b‬ﻭﻨﻤﺜل ﺫﻟﻙ ﺒﺎﻟﺠـﺩﻭل‬
‫ﺍﻟﺘﺎﻟﻲ‪:‬‬

‫‪k‬‬ ‫‪1‬‬ ‫‪2‬‬ ‫…‬ ‫‪n −1‬‬ ‫‪n‬‬

‫‪rk −1‬‬ ‫‪a‬‬ ‫‪b‬‬ ‫…‬ ‫‪rn − 2‬‬ ‫‪rn −1‬‬

‫‪rk‬‬ ‫‪b‬‬ ‫‪r2‬‬ ‫…‬ ‫‪rn −1‬‬ ‫‪rn = d‬‬

‫‪rk +1‬‬ ‫‪r2‬‬ ‫‪r3‬‬ ‫…‬ ‫‪rn‬‬ ‫‪0‬‬

‫ﻤﺜﺎل‬

‫ﺃﻭﺠﺩ ﺍﻟﻘﺎﺴﻡ ﺍﻟﻤﺸﺘﺭﻙ ﻟﻠﻌﺩﺩﻴﻥ ‪ b = 2047‬ﻭ ‪. a = 5313‬‬

‫‪k‬‬ ‫‪1‬‬ ‫‪2‬‬ ‫‪3‬‬ ‫‪4‬‬ ‫‪5‬‬ ‫‪6‬‬

‫‪rk −1‬‬ ‫‪5313‬‬ ‫‪2047‬‬ ‫‪1219‬‬ ‫‪828‬‬ ‫‪391‬‬ ‫‪46‬‬

‫‪rk‬‬ ‫‪2047‬‬ ‫‪1219‬‬ ‫‪828‬‬ ‫‪391‬‬ ‫‪46‬‬ ‫‪23‬‬

‫‪rk +1‬‬ ‫‪1219‬‬ ‫‪828‬‬ ‫‪391‬‬ ‫‪46‬‬ ‫‪23‬‬ ‫‪0‬‬

‫ﻨﻼﺤﻅ ﺃﻥ ﻋﻨﺩﻤﺎ ‪ k = 1‬ﻓﺈﻥ ‪ r0 = 5313‬ﻭ ‪r1 = 2047‬‬

‫ﻭ ‪ r2 = 2047 × 2 + 1219‬ﺃﻱ ﺃﻥ ‪ 1216‬ﻫﻭ ﺒﺎﻗﻲ ﻗﺴﻤﺔ ‪ r0‬ﻋﻠـﻰ ‪ r1‬ﻭ ﻨﺘـﺎﺒﻊ ﻟﻨﺤـﺼل ﻋﻠـﻰ‬
‫‪. d = gcd(5313, 2047) = 23‬‬

‫‪ -4‬ﺍﻷﻋﺩﺍﺩ ﺍﻷﻭﻟﻴﺔ )‪(Prime numbers‬‬

‫∈ ) ‪ (x 1 , x 2 ,… , x n‬ﻋﻨﺩﺌ ٍﺫ‪:‬‬ ‫‪*n‬‬

‫∈ ‪ n‬ﻋﺩﺩ ﻁﺒﻴﻌﻲ ﻏﻴﺭ ﻤﻌﺩﻭﻡ ﻭﻟﻴﻜﻥ‬ ‫*‬
‫ﻟﻴﻜﻥ‬

‫‪ y‬ﻨﻘﻭل ﺃﻥ ﺍﻷﻋﺩﺍﺩ ﺍﻟﺼﺤﻴﺤﺔ ) ‪ ( x1 , x2 ,…, xn‬ﺃﻭﻟﻴﺔ ﻓﻴﻤﺎ ﺒﻴﻨﻬﺎ ﺇﺫﺍ ﻭﻓﻘﻁ ﺇﺫﺍ ﻜﺎﻥ‬
‫‪. gcd( x1 , x2 ,…, xn ) = 1‬‬

‫‪ y‬ﻨﻘﻭل ﺃﻥ ﺍﻷﻋﺩﺍﺩ ﺍﻟﺼﺤﻴﺤﺔ ﺃﻭﻟﻴﺔ ﻓﻴﻤﺎ ﺒﻴﻨﻬﺎ ﻤﺜﻨﻰ ﻤﺜﻨﻰ ﺇﺫﺍ ﻭﻓﻘﻁ ﺇﺫﺍ ﻜﺎﻥ‪:‬‬

‫∈ ) ‪∀ (i . j‬‬ ‫‪2‬‬
‫‪n‬‬ ‫‪; i ≠ j ⇒ gcd (x i , x j ) = 1‬‬

‫ﻤﻼﺤﻅﺔ‬

‫ﻨﻘﻭﻡ ﺒﺘﻌﻤﻴﻡ ﺘﻌﺭﻴﻑ ﺍﻟﻘﺎﺴﻡ ﺍﻟﻤﺸﺘﺭﻙ ﺍﻷﻜﺒﺭ ﻭﺍﻟﻤﻀﺎﻋﻑ ﺍﻟﻤﺸﺘﺭﻙ ﺍﻷﺼﻐﺭ ﻜﻤﺎ ﻴﻠﻲ‪:‬‬

‫‪13‬‬
 ‫‪d‬‬ ‫‪= x1 + x 2 +‬‬ ‫‪+‬‬ ‫‪xn‬‬ ‫∈ ‪ d‬ﻴﺤﻘﻕ‬ ‫‪ y‬ﻨﻌﺭﻑ ) ‪ d = gcd( x1 ,…, xn‬ﺒﺄﻨﻪ ﻋﻨﺼﺭ‬
‫‪n‬‬
‫‪m‬‬ ‫‪= ∩(x i‬‬ ‫ﻴﺤﻘﻕ )‬ ‫∈‪m‬‬ ‫‪ y‬ﻭﻨﻌﺭﻑ ) ‪ m = lcm ( x 1 , , x n‬ﺒﺄﻨﻪ ﺍﻟﻌﻨﺼﺭ‬
‫‪i =1‬‬

‫ﻤﻼﺤﻅﺔ‬

‫ﻻﺤﻅ ﺃﻥ ﺍﻷﻋﺩﺍﺩ ﺍﻟﺼﺤﻴﺤﺔ ‪ 3,6,7‬ﺃﻭﻟﻴﺔ ﻓﻴﻤﺎ ﺒﻴﻨﻬﺎ ﻭﻟﻜﻨﻬﺎ ﻟﻴﺴﺕ ﺃﻭﻟﻴﺔ ﻓﻴﻤﺎ ﺒﻴﻨﻬﺎ ﻤﺜﻨـﻰ ﻤﺜﻨـﻰ‬
‫ﻷﻥ ‪. 3 | 6‬‬

‫ﺇﺫﻥ ﺇﺫﺍ ﻜﺎﻨﺕ ) ‪ ( x1 ,…, xn‬ﺃﻭﻟﻴﺔ ﻤﺜﻨﻰ ﻤﺜﻨﻰ ﻓﺈﻨﻬﺎ ﺃﻭﻟﻴﺔ ﻓﻴﻤﺎ ﺒﻴﻨﻬﺎ ﻭﻟﻜﻥ ﺍﻟﻌﻜﺱ ﻏﻴـﺭ ﺼـﺤﻴﺢ‬
‫ﺒﺎﻟﻀﺭﻭﺭﺓ‪.‬‬

‫ﻤﺒﺭﻫﻨﺔ)‪ (13‬ﺒﻴﺯﻭ)‪(Bezout’s theorem‬‬

‫∈ ) ‪ . (a, b‬ﺇﻥ ﺍﻟﺘﻜﺎﻓﺅ ﺍﻟﺘﺎﻟﻲ ﻤﺤﻘﻕ‪:‬‬ ‫‪*2‬‬

‫ﻟﺘﻜﻥ‬

‫)‪gcd(a, b) = 1 ⇔ (∃ (u, v) ∈ Z 2 ; au + bv = 1‬‬

‫ﺍﻹﺜﺒﺎﺕ‪:‬‬

‫‪ (gcd(a, b )) = a + b‬ﻭﻟﻜــﻥ‬ ‫ﺇﻥ ﺍﻹﺜﺒــﺎﺕ ﻭﺍﻀــﺢ ﺒﺎﺴــﺘﺨﺩﺍﻡ ﺍﻟﻤﺒﺭﻫﻨــﺔ )‪ .(10‬ﺇﻥ‬

‫‪ gcd(a, b) = 1‬ﺃﻱ‬
‫‪= a + b ⇔ 1∈ a + b‬‬
‫‪⇔ ∃ (u ,v ) ∈ Z 2 ; au + bv = 1‬‬

‫ﺍﺴﺘﺨﺩﺍﻡ ﺨﻭﺍﺭﺯﻤﻴﺔ ﺇﻗﻠﻴﺩﺱ ﻹﻴﺠﺎﺩ ﺜﻨﺎﺌﻴﺔ ﺒﻴﺯﻭ‪:‬‬

‫∈ ) ‪ (a, b‬ﺍﻷﻭﻟﻴﻴﻥ ﻓﻴﻤﺎ ﺒﻴﻨﻬﻤﺎ‪ .‬ﺇﻥ ﺨﻭﺍﺭﺯﻤﻴﺔ ﺇﻗﻠﻴﺩﺱ ﺘﻤﻜﻨﻨﺎ ﻤﻥ ﺇﻴﺠـﺎﺩ‬ ‫‪*2‬‬
‫ﻟﻴﻜﻥ ﻟﺩﻴﻨﺎ ﺍﻟﻌﺩﺩﻴﻥ‬
‫∈ ) ‪ (u ,v‬ﺤﻴﺙ ‪ au + bv = 1‬ﻜﻤﺎ ﻴﻠﻲ‪:‬‬ ‫ﺜﻨﺎﺌﻴﺔ ﺒﻴﺯﻭ‬

‫ﻨﻭﺤﺩ ﺍﻟﻤﺘﺘﺎﻟﻴﺘﻴﻥ ‪ ( rk )k ≥0 , (q k )k ≥0‬ﺍﻟﻤﻌﺭﻓﺘﻴﻥ ﻓﻲ ﺨﻭﺍﺭﺯﻤﻴﺔ ﺇﻗﻠﻴﺩﺱ‪.‬‬

‫ﻻﺤﻅ ﺃﻥ ‪ . gcd(a, b) = rn = 1‬ﻨﻀﻊ )‪ (r0 = a) ∧ (r1 = b‬ﻭﻨﻌﺭﻑ ﺒﺎﻟﺘﺩﺭﻴﺞ ﺍﻟﻤﺘﺘﺎﻟﻴـﺔ ‪(rk ) k >0‬‬
‫ﻜﻤــﺎﻴﻠﻲ‪ ∀ k ≥ 1; rk −1 = q k rk + rk +1 :‬ﺤﻴــﺙ ‪ ; 0 < rk +1 ≤ rk‬ﻭﻨﻌــﺭﻑ ﺍﻟﻤﺘﺘــﺎﻟﻴﺘﻴﻥ‬
‫∈‪∀ k‬‬ ‫‪n‬‬ ‫) ‪ (u k ), (v k‬ﻜﻤﺎ ﻴﻠﻲ‪, rk = u k a + v k b :‬‬

‫ﻨﺜﺒﺕ ﺼﺤﺔ ﻫﺫﻩ ﺍﻟﻌﻼﻗﺔ ﺒﺎﻟﺘﺩﺭﻴﺞ ﺤﻴﺙ ﻨﻀﻊ )‪ (u 0 ,v 0 ) = (1, 0), (u1 ,v 1 ) = (0,1‬ﻭ ﺒﺎﻟﺘﺎﻟﻲ ‪:‬‬

‫‪14‬‬
 ‫‪⎧⎪u k +1 = u k −1 − q k u k‬‬
‫∈ ‪∀k‬‬ ‫⎨ ; }‪\ {1‬‬
‫‪⎪⎩v k +1 = v k −1 − q qv k‬‬
‫‪n‬‬

‫ﻭﻨﺤﺼل ﻋﻠﻰ ‪ . 1 = au n + bvn‬ﺃﻱ ﻨﺤﺼل ﻋﻠﻰ ﺍﻟﺠﺩﻭل ﺍﻟﺘﺎﻟﻲ‪:‬‬

‫‪rk‬‬ ‫‪r0 = a‬‬ ‫‪r1 = b‬‬ ‫‪r2‬‬ ‫…‬ ‫‪rn = 1‬‬

‫‪qk‬‬ ‫‪-‬‬ ‫‪q1‬‬ ‫‪q2‬‬ ‫…‬ ‫‪qn‬‬

‫‪uk‬‬ ‫‪1‬‬ ‫‪0‬‬ ‫‪u2‬‬ ‫…‬ ‫‪un = u‬‬

‫‪vk‬‬ ‫‪0‬‬ ‫‪1‬‬ ‫‪v2‬‬ ‫…‬ ‫‪vn = v‬‬

‫ﻤﺜﺎل‬

‫ﺤل ﺍﻟﻤﻌﺎﺩﻟﺔ ﺍﻟﺘﺎﻟﻴﺔ‪22 x + 7 y = 1 :‬‬

‫ﺍﻟﺤل‪:‬‬

‫ﻨﻼﺤﻅ ﺃﻥ ‪ 7‬ﻭ ‪ 22‬ﺃﻭﻟﻴﺎﻥ ﻓﻴﻤﺎ ﺒﻴﻨﻬﻤﺎ ﺇﺫﻥ ﻨﺒﺤﺙ ﻋﻥ * ‪ (u, v) ∈ Z‬ﺤﻴﺙ‪:‬‬

‫‪22u + 7v = 1‬‬

‫ﺒﺘﻁﺒﻴﻕ ﺨﻭﺍﺭﺯﻤﻴﺔ ﺇﻗﻠﻴﺩﺱ‪:‬‬

‫‪k‬‬ ‫‪rk‬‬ ‫‪qk‬‬ ‫‪uk‬‬ ‫‪vk‬‬

‫‪0‬‬ ‫‪22‬‬ ‫‪-‬‬ ‫‪1‬‬ ‫‪0‬‬

‫‪1‬‬ ‫‪7‬‬ ‫‪3‬‬ ‫‪0‬‬ ‫‪1‬‬
‫‪2‬‬ ‫‪1‬‬ ‫‪q2 = 7‬‬ ‫‪1‬‬ ‫‪-3‬‬

‫ﻭﺃﻥ ‪ r1 = b = 7‬ﻭ ‪ r2 = 22 − 3 × 7 = 1‬ﻭﻤﻨﻪ‪q1 = 3 :‬‬ ‫ﻻﺤﻅ‪r0 = a = 22 :‬‬

‫ﻭﻤﻨﻪ ‪. q 2 = 7‬‬
‫‪r1‬‬
‫‪= 7 ⇒ r1 = 7r2 + 0‬‬
‫‪r2‬‬

‫ﺇﻥ ‪ u k +1 = u k −1 − q k u k ⇒ u 2 = u 0 − q1u1 = 1 − 7 × 0 = 1‬ﻭﻜﺫﻟﻙ‬

‫‪ v k +1 = v k −1 − q k v k ⇒ v 2 = v 0 − q1v 1 = 0 − 3 × 1 = −3‬ﺃﻱ ﺃﻥ )‪. (u = 1) ∧ (v = −3‬‬

‫‪15‬‬
 ‫ﺘﻌﺭﻴﻑ‬

‫ﺃﻱ ﺃﻥ ﻗﻭﺍﺴﻡ ‪ n‬ﻫﻲ ‪1‬‬ ‫ﺇﺫﺍ ﻜﺎﻥ ﻏﻴﺭ ﺨﺯﻭل ﻓﻲ‬ ‫∈ ‪ n‬ﺃﻨﻪ ﺃﻭﻟﻴﹰﺎ ﻓﻲ ﺍﻟﺤﻠﻘﺔ‬ ‫ﻨﻘﻭل ﺍﻟﻌﺩﺩ‬
‫ﻭ ‪ n‬ﻓﻘﻁ‪ .‬ﻨﺭﻤﺯ ﻟﻤﺠﻤﻭﻋﺔ ﺍﻷﻋﺩﺍﺩ ﺍﻷﻭﻟﻴﺔ ﺒـ ‪. P‬‬

‫ﺨﻭﺍﺹ ﺍﻷﻋﺩﺍﺩ ﺍﻷﻭﻟﻴﺔ‬

‫∈ ‪ n‬ﻓﺈﻤﺎ ‪ p‬ﻴﻘﺴﻡ ‪ n‬ﺃﻭ ﻴﻜﻭﻥ ‪gcd(n, p) = 1‬‬ ‫‪ -1‬ﺇﺫﺍ ﻜﺎﻥ ‪ p‬ﻋﺩﺩ ﺃﻭﻟﻴﹰﺎ ﻭ‬

‫∈ ) ‪ (a, b‬ﻓﺈﻥ )‪P ab ⇒ ( P a ) ∨ ( P b‬‬ ‫‪2‬‬

‫‪ -2‬ﺇﺫﺍ ﻜﺎﻥ ‪ p‬ﻋﺩﺩﹰﺍ ﺃﻭﻟﻴﹰﺎ ﻭ‬

‫∈‪k‬‬ ‫‪r‬‬ ‫‪ -3‬ﺇﺫﺍ ﻜﺎﻨﺕ ‪ p‬ﻭ ‪ q1 , q 2 ,…, qr‬ﺃﻋﺩﺍﺩﹰﺍ ﺃﻭﻟﻴﺔ ﻭﻜﺎﻥ ‪ p q1q 2 …q r‬ﻋﻨﺩﺌـ ٍﺫ ﻴﻭﺠـﺩ‬
‫ﺒﺤﻴﺙ ﻴﻜﻭﻥ ‪. p = q k‬‬

‫ﺍﻹﺜﺒﺎﺕ‪:‬‬

‫‪ -1‬ﺇﻥ ﺍﻟﻌﺩﺩﻴﻥ ‪ n, p‬ﺇﻤﺎ ﺃﻥ ﻴﻜﻭﻨﺎ ﺃﻭﻟﻴﺎﻥ ﻓﻴﻤﺎ ﺒﻴﻨﻬﻤﺎ ﻭﺒﺎﻟﺘﺎﻟﻲ ‪ gcd(n , p ) = 1‬ﻭﺇﻤﺎ ﺃﻥ ﻴﻜﻭﻨـﺎ‬
‫ﻏﻴﺭ ﺃﻭﻟﻴﻴﻥ ﻭﺒﺎﻟﺘﺎﻟﻲ ﻟﻴﻜﻥ )‪ . δ = gcd(n, p‬ﺒﻤﺎ ﺃﻥ ‪ p‬ﺃﻭﻟﻲ ﺃﻱ ﻏﻴﺭ ﺨﺯﻭل ﻓﺈﻥ ‪ δ = p‬ﻭﻤﻨﻪ‬
‫‪. pn‬‬

‫‪ p -2‬ﺃﻭﻟﻲ ﻭﻟﺩﻴﻨﺎ ‪ p ab‬ﻋﻨﺩﺌﺫ ) ‪ p‬ﻴﻘﺴﻡ ‪ ( a‬ﺃﻭ ) ‪ p‬ﻴﻘﺴﻡ ‪ ( b‬ﻭﺫﻟـﻙ ﺒﺎﺴـﺘﺨﺩﺍﻡ ﺍﻟﺨﺎﺼـﺔ‬

‫ﺍﻷﻭﻟﻰ ﻜﻤﺎ ﻴﻠﻲ‪:‬‬

‫ﻼ ‪ p‬و ‪ a‬ﻓﺈﻤﺎ ‪ p‬ﻭ ‪ a‬ﺃﻭﻟﻴﺎﻥ ﻓﻴﻤﺎ ﺒﻴﻨﻬﻤـﺎ ﺃﻭ ﺃﻥ ‪ . p a‬ﺇﺫﺍ ﻜـﺎﻥ ‪ p a‬ﻴﻜـﻭﻥ ﺘـﻡ‬
‫ﻟﻨﺄﺨﺫ ﻤﺜ ﹰ‬
‫ﺍﻟﻤﻁﻠﻭﺏ‪ .‬ﺃﻤﺎ ﺇﺫﺍ ﻜﺎﻥ ‪ a, p‬ﺃﻭﻟﻴﺎﻥ ﻭ ‪ p ab‬ﻓﺈﻥ ‪) p b‬ﺃﺜﺒﺙ ﺫﻟﻙ(‪.‬‬

‫‪ -3‬ﻴﺘﻡ ﺍﻹﺜﺒﺎﺕ ﺒﺴﻬﻭﻟﺔ ﺒﺎﻻﻋﺘﻤﺎﺩ ﻋﻠﻰ ﺍﻟﺨﺎﺼﺘﻴﻥ ﺍﻟﺴﺎﺒﻘﺘﻴﻥ‪.‬‬

‫ﻤﺒﺭﻫﻨﺔ )‪(14‬‬

‫ﻟﻴﻜﻥ }‪ . n ∈ \{0,1‬ﻋﻨﺩﺌ ٍﺫ ‪ n‬ﻴﻜﺘﺏ ﺒﺸﻜل ﻭﺤﻴﺩ ﻜﻤﺎ ﻴﻠﻲ‪:‬‬

‫‪ n = ∏ p ν‬ﺤﻴﺙ ) ‪ ν p (n‬ﻭﻨﺼﻁﻠﺢ ﺃﻥ ‪ ν p (n ) = 0‬ﻋﻨﺩﻤﺎ ‪ p‬ﻋﺩﺩ ﺃﻭﻟﻲ ﻭ ﻴﻘﺴﻡ ‪. n‬‬ ‫‪p‬‬ ‫) ‪(n‬‬

‫‪p ∈P‬‬

‫ﻤﻼﺤﻅﺔ‬

‫‪n = ±∏ p‬‬
‫) ‪ν p (n‬‬
‫∈ ‪ n‬ﻏﻴﺭ ﻤﻌﺩﻭﻡ ﻴﻜﺘﺏ ﺒﺸﻜل ﻭﺤﻴﺩ ﻜﻤﺎ ﻴﻠﻲ‪:‬‬ ‫ﻜل ﻋﺩﺩ‬
‫‪p ∈P‬‬

‫‪100 = 10.10‬‬ ‫ﻤﺜﺎل‬

‫‪16‬‬
 ‫‪= ( 2 × 5 ) × ( 2 × 5 ) = 2 2 × 52‬‬

‫ﺇﺫﻥ ‪ 100‬ﻜﺘﺏ ﺒﺸﻜل ﺠﺩﺍﺀ ﺒﻭﺍﺴﻁﺔ ﺍﻟﻌﺩﺩﻴﻥ ﺍﻷﻭﻟﻴﻴﻥ ‪. 2 and 5‬‬

‫ﻤﺒﺭﻫﻨﺔ )‪(15‬‬

‫ﺃﻴﺎ ﻜﺎﻥ ‪ (a, b) ∈ N *2‬ﻓﻌﻨﺩﺌ ٍﺫ‪:‬‬

‫( ‪1 - gcd(a, b ) = ∏ p‬‬ ‫)‬

‫‪min ν‬‬ ‫‪p‬‬ ‫) ‪( a ),ν p (b‬‬

‫‪p ∈P‬‬

‫( ‪2 - lcm (a, b ) = ∏ p‬‬ ‫)‬

‫‪max ν‬‬ ‫‪p‬‬ ‫) ‪( a ),ν p (b‬‬

‫‪p ∈P‬‬

‫ﻤﺜﺎل‬

‫ﺃﻭﺠﺩ ﺍﻟﻘﺎﺴﻡ ﺍﻟﻤﺸﺘﺭﻙ ﺍﻷﻜﺒﺭ ﻭﺍﻟﻤﻀﺎﻋﻑ ﺍﻟﻤﺸﺘﺭﻙ ﺍﻷﺼﻐﺭ ﻟﻠﻌﺩﺩﻴﻥ‪:‬‬

‫‪ a = 100‬ﻭ ‪b = 73‬‬

‫ﺍﻟﺤل‪:‬‬

‫ﻨﻼﺤﻅ ﺃﻥ ‪ 100 = 2 2.5 2 = 30.2 2..5 2‬ﻭﺃﻥ ‪75 = 25.3 = 3.5 2 = 3.2 0.5 2‬‬

‫ﻭﻤﻨﻪ‪:‬‬
‫‪gcd(100, 75) = ∏ p‬‬
‫)) ‪min(ν p ( a ),ν p (b‬‬
‫‪= 52.20.30 = 25‬‬
‫‪p ∈P‬‬

‫‪lcd (100, 75) = ∏ p‬‬

‫)) ‪max(ν p ( a ),ν p (b‬‬
‫‪= 52.22.3 = 300‬‬
‫‪p ∈P‬‬

‫‪17‬‬
 ‫‪ .8‬ﺍﻟﺤﻘﻭل )‪(Fields‬‬

‫ﺘﻌﺭﻴﻑ‬

‫ﻟﺘﻜﻥ ‪ k‬ﻤﺠﻤﻭﻋﺔ ﻤﺯﻭﺩﺓ ﺒﻘﺎﻨﻭﻨﻲ ﺘﺸﻜﻴل ﺩﺍﺨﻠﻴﻴﻥ )‪ (+‬ﻭ )×( ﻨﻘﻭل ﺃﻥ ﺍﻟﺒﻨﻴﺔ )× ‪ (k, +,‬ﻫﻲ ﺤﻘل‬
‫ﺇﺫﺍ ﻭﻓﻘﻁ ﺇﺫﺍ ﺘﺤﻘﻕ‪:‬‬

‫‪ (k, +, ×) -1‬ﻫﻲ ﺤﻠﻘﺔ‪.‬‬

‫‪ -2‬ﻜل ﻋﻨﺼﺭ ﻏﻴﺭ ﻤﻌﺩﻭﻡ ﻤﻥ ‪ k‬ﻟﻪ ﻤﻘﻠﻭﺏ ﻓﻲ ‪ k‬ﺒﺎﻟﻨﺴﺒﺔ ﻟﻠﻘﺎﻨﻭﻥ )×( ﺃﻱ‪:‬‬

‫‪ (∀ x ∈ k; x ≠ 0) ⇒ x −1 ∈ k‬ﺃﻭ ﺒﺸﻜل ﺁﺨﺭ )‪k \ {0} = U (k‬‬

‫ﺇﺫﺍ ﻜﺎﻥ )×( ﺘﺒﺩﻴﻠﻲ ﻗﻠﻨﺎ ﺃﻥ ‪ k‬ﺤﻘل ﺘﺒﺩﻴﻠﻲ ⇔ )‪ U (k‬ﺯﻤﺭﺓ ﺘﺒﺩﻴﻠﻴﺔ‪.‬‬

‫ﻤﻼﺤﻅﺔ‬

‫ﺇﻥ ‪ 0 = 0k‬ﻫﻭ ﺍﻟﻌﻨﺼﺭ ﺍﻟﺤﻴﺎﺩﻱ ﺒﺎﻟﻨﺴﺒﺔ ﻟﻠﻘﺎﻨﻭﻥ )‪ (+‬ﻓﻲ ‪. k‬‬

‫ﻤﺜﺎل‬

‫ﺇﻥ ﺍﻟﺒﻨﻰ ﺍﻟﺘﺎﻟﻴﺔ )× ‪ ( , +, ×), ( , +, ×), ( , +,‬ﻫﻲ ﺤﻘﻭل ﻭﻟﻜﻥ ﺍﻟﺒﻨﻴﺔ )× ‪ ( , +,‬ﻟﻴﺴﺕ ﺤﻘ ﹰ‬
‫ﻼ‬
‫ﻷﻥ ﺍﻟﻌﻨﺎﺼﺭ ﺍﻟﻭﺤﻴﺩﺓ ﺍﻟﻘﺎﺒﻠﺔ ﻟﻠﻘﻠﺏ ﻫﻲ ‪ − 1‬ﻭ ‪. + 1‬‬

‫ﻤﺒﺭﻫﻨﺔ )‪(16‬‬

‫ﺇﻥ ﻗﺎﻨﻭﻥ ﺍﻻﺨﺘﺯﺍل ﻤﺤﻘﻕ ﻓﻲ ﺍﻟﺤﻘل )× ‪ (k, +,‬ﺃﻱ ﺃﻥ‪:‬‬

‫‪∀ (a, x , y ) ∈ k3 , a ≠ o k , a × x = a × y ⇒ x = y‬‬

‫ﺍﻟﺤﻘﻭل ﺍﻟﺠﺯﺌﻴﺔ‬

‫ﻟﻴﻜﻥ ‪ k′ ⊂ k‬ﺤﻴﺙ )× ‪ (k, +,‬ﺤﻘل‪ .‬ﻨﻘﻭل ﺃﻥ ‪ k′‬ﺤﻘل ﺠﺯﺌﻲ ﻤـﻥ ‪ k‬ﺇﺫﺍ ﻭﻓﻘـﻁ ﺇﺫﺍ ﺘﺤﻘﻘـﺕ‬
‫ﺍﻟﺸﺭﻭﻁ‪:‬‬

‫‪ k′ -1‬ﻫﻭ ﺤﻠﻘﺔ ﺠﺯﺌﻴﺔ ﻤﻥ ﺍﻟﺤﻠﻘﺔ )× ‪. (k, +,‬‬

‫‪k′ = U (k′) -2‬‬

‫‪18‬‬
 ‫ﺘﺸﺎﻜﻼﺕ ﺍﻟﺤﻘﻭل‬

‫ﻟﻴﻜﻥ )× ‪ f : (k, +, ×) → (k′, +,‬ﺤﻴﺙ ‪ k′, k‬ﺤﻘﻠﻴﻥ‪ .‬ﻨﻘﻭل ﻋﻥ ‪ f‬ﺃﻨﻪ ﺘﺸﺎﻜل ﺤﻘﻠﻲ ﺇﺫﺍ ﻭﻓﻘﻁ ﺇﺫﺍ‬
‫ﻼ ﺤﻠﻘﻴﹰﺎ‪.‬‬
‫ﻜﺎﻥ ﺘﺸﺎﻜ ﹰ‬

‫ﻤﺒﺭﻫﻨﺔ )‪(17‬‬

‫ﻟﻴﻜﻥ ‪ k ∈ k‬ﺤﻴﺙ )× ‪ (k, +,‬ﺤﻘل‪ .‬ﻋﻨﺩﺌ ٍﺫ‪:‬‬

‫‪n‬‬ ‫‪⎧(1 − k ) −1 (1 − k n +1 ); k ≠ 1‬‬
‫‪∑k‬‬ ‫‪i‬‬
‫‪= 1+ k + k +‬‬
‫‪2‬‬
‫⎨= ‪+k‬‬
‫‪n‬‬

‫‪i =0‬‬ ‫; ‪⎩(n + 1)1k‬‬ ‫‪k =1‬‬

‫ﻭﺤﻴﺙ ‪ 1k‬ﻫﻭ ﺍﻟﺤﻴﺎﺩﻱ ﺒﺎﻟﻨﺴﺒﺔ ﻟﻠﻘﺎﻨﻭﻥ )×( ﻓﻲ ﺍﻟﺤﻘل ‪. k‬‬

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

‫ﻟﺘﻜﻥ )× ‪ (A , +,‬ﺤﻠﻘﺔ ﺘﺤﻘﻕ ﺍﻟﺸﺭﻁ ﺍﻟﺘﺎﻟﻲ‪:‬‬

‫‪∀x ∈ A ; x 2 = x‬‬

‫‪ -1‬ﺃﺜﺒﺕ ﺃﻥ‪∀ (x , y ) ∈ A 2 ; x × y + y × x = 0 :‬‬

‫‪ -2‬ﺍﺜﺒﺕ ﺃﻥ‪∀ x ∈ A; 2 x = 0 :‬‬

‫‪ -‬ﺒﻴﻥ ﺃﻥ ‪ A‬ﻫﻲ ﺤﻠﻘﺔ ﺘﺒﺩﻴﻠﻴﺔ‪.‬‬

‫ﺍﻟﺤل‪:‬‬

‫‪ -1‬ﻟﻴﻜﻥ ‪ ( x, y ) ∈ A 2‬ﻓﺈﻥ ‪ x + y ∈ A‬ﻷﻥ )‪ (+‬ﻗﺎﻨﻭﻥ ﺘﺸﻜﻴل ﺩﺍﺨﻠﻲ‪ .‬ﺤﺴﺏ ﺘﻌﺭﻴﻑ ‪ A‬ﻓـﺈﻥ‬

‫) ‪ ( x + y ) 2 = ( x + y‬ﻭﺒﺎﻟﺘﺎﻟﻲ‪:‬‬

‫) ‪x + y = (x + y ) × (x + y‬‬

‫‪= (x + y ) × z + (x + y ) × y‬‬ ‫ﺤﺴﺏ ﺨﺎﺼﺔ ﺍﻟﺘﻭﺯﻴﻊ‬

‫‪= x ×x + y ×x + x × y + y × y‬‬ ‫) ‪ ( +‬ﺘﺒﺩﻴﻠﻲ‬

‫‪= x 2 + xy + yx + y 2‬‬

‫‪19‬‬
 ‫ﻭ ﺒﺎﻟﺘﺎﻟﻲ ‪xy + yx = 0‬‬ ‫‪x + y = x + xy + yx + y‬‬ ‫ﻭﺒﺎﺴﺘﺨﺩﺍﻡ ﺘﻌﺭﻴﻑ ‪ A‬ﻨﺠﺩ ﺃﻥ‬

‫‪ ∀x ∈ A -2‬ﻓﺈﻥ‪:‬‬

‫)ﺤﺴﺏ ﺍﻟﻁﻠﺏ ﺍﻷﻭل( ‪2x = x + x = x ×1A + 1A × x = 0‬‬

‫ﺤﻴﺙ ‪ 1A ∈ A‬ﻫﻭ ﺍﻟﺤﻴﺎﺩﻱ ﺒﺎﻟﻨﺴﺒﺔ ﻟﻠﻘﺎﻨﻭﻥ )×( ‪.‬‬

‫‪ -3‬ﻤﻥ ﺍﻟﻁﻠﺏ ﺍﻟﺜﺎﻨﻲ ﺃﻥ ‪ ∀x ∈ A‬ﻓﺈﻥ ‪x = − x‬‬

‫ﻭﺒﺎﻟﺘﺎﻟﻲ ‪ xy = − xy‬ﺒﺎﺴﺘﺨﺩﺍﻡ ﺍﻟﻌﻼﻗﺔ‬

‫‪xy + yx = 0 ⇒ − xy + yx = 0‬‬

‫ﻭﻤﻨﻪ ‪ xy = yx‬ﺃﻱ ﺃﻥ ﺍﻟﻘﺎﻨﻭﻥ )×( ﺘﺒﺩﻴﻠﻲ‪.‬‬

‫ﻨﺴﻤﻲ ﻜل ﺤﻠﻘﺔ )× ‪ (A , +,‬ﺤﻴﺙ ‪ ∀x ∈ A‬ﻓﺈﻥ ‪ x 2 = x‬ﺒﺎﻟﺤﻠﻘﺔ ﺍﻟﺒﻭﻟﻴﺎﻨﻴﺔ‪ .‬ﺃﻱ ﺍﻟﺤﻠﻘﺔ ﺍﻟﺒﻭﻟﻴﺎﻨﻴـﺔ‬

‫ﻫﻲ ﺤﻠﻘﺔ ﺘﺒﺩﻴﻠﻴﺔ ﻭﻨﻅﻴﺭ ﻜل ﻋﻨﺼﺭ ﺒﺎﻟﻨﺴﺒﺔ ﻟﻠﻘﺎﻨﻭﻥ ﻫﻲ ﺍﻟﻌﻨﺼﺭ ﻨﻔﺴﻪ‪.‬‬

‫ﺍﻟﺘﻤﺭﻴﻥ ﺍﻟﺜﺎﻨﻲ‪:‬‬

‫ﺃﺜﺒﺕ ﺃﻨﻪ ﺇﺫﺍ ﻜﺎﻨﺕ ‪ E‬ﻤﺠﻤﻭﻋﺔ ﻤﺎ ﻓﺈﻥ )∩‪ ( P( E ), ∆,‬ﻫﻲ ﺤﻠﻘﺔ ﺒﻭﻟﻴﺎﻨﻴﺔ‪.‬‬

‫ﺍﻟﺤل‪:‬‬

‫ﺇﻥ )∆ ‪ ( P( E ),‬ﻫﻲ ﺯﻤﺭﺓ ﺘﺒﺩﻴﻠﻴﺔ‪ .‬ﻷﻥ ∆ ﺍﻟﻔﺭﻕ ﺍﻟﺘﻨﺎﻅﺭﻱ ﻫﻭ ﺘﺠﻤﻴﻌﻲ ﻭﺘﺒﺩﻴﻠﻲ )ﺃﺜﺒﺕ ﺫﻟـﻙ(‬
‫ﻭﻤﻥ ﺜﻡ ﺃﻥ ﺍﻟﻤﺠﻤﻭﻋﺔ ∅ ﺘﺸﻜل ﺍﻟﻌﻨﺼﺭ ﺍﻟﺤﻴﺎﺩﻱ ﺒﺎﻟﻨﺴﺒﺔ ﻟﻠﻘﺎﻨﻭﻥ ∆ ﻷﻥ‪:‬‬

‫‪∀A ∈ P (E ); A ∆∅ = (A \ ∅) ∪ (∅ \ A ) = A ∪ ∅ = A‬‬

‫ﻭ ‪∅∆A = (∅ \ A ) ∪ (A \ ∅) = ∅ ∪ A = A‬‬

‫‪ y‬ﻨﻅﻴﺭ ﻜل ﻋﻨﺼﺭ ﺒﺎﻟﻨﺴﺒﺔ ﻟـ ∆ ﻫﻭ ﺍﻟﻌﻨﺼﺭ ﻨﻔﺴﻪ ﺃﻱ ﺇﺫﺍ ﻜﺎﻨﺕ ) ‪ A ∈ P( E‬ﻓﺈﻥ‪:‬‬

‫∅ = ∅ ∪ ∅ = ) ‪A ∆A = (A \ A ) ∪ (A \ A‬‬

‫‪ y‬ﺍﻟﻘﺎﻨﻭﻥ )∩( ﻫﻭ ﺘﺠﻤﻴﻌﻲ ﻷﻥ ﻋﻤﻠﻴﺔ ﺍﻟﺘﻘﺎﻁﻊ ﻋﻤﻠﻴﻪ ﺘﺠﻤﻴﻌﻴﺔ )ﺃﺜﺒﺕ ﺫﻟﻙ(‬

‫‪ y‬ﺍﻟﻘﺎﻨﻭﻥ )∩( ﺘﻭﺯﻴﻌﻲ ﻋﻠﻰ )∆( ﻷﻥ‪:‬‬

‫‪20‬‬
‫]) ‪A ∩ (B ∆C ) = A ∩ [(B \ C ) ∪ (C \ B‬‬
‫]) ‪= A ∩ [(B ∩ C ) ∪ (C ∩ B‬‬
‫] ‪= [( A ∩ B ) ∩ C ) ∪ [( A ∩ C ) ∩ B‬‬ ‫ﺤﺴﺏ ﺘﻭﺯﻴﻊ ∩ ﻋﻠﻰ ∪‬

‫] ‪= [( A ∩ B ) \ C ] ∪ [( A ∩ C ) \ B‬‬
‫]) ‪= [( A ∩ B ) \ ( A ∩ C )] ∪ [( A ∩ C ) \ ( A ∩ B‬‬
‫) ‪= ( A ∩ B )∆( A ∩ C‬‬

‫)ﺍﻨﻅﺭ ﻤﺨﻁﻁ ﻓﻥ(‬

‫ﻥ‪A∩ A = A‬‬
‫‪ ∀A ∈ A y‬ﻓﺈ ِ‬

‫‪ y‬ﺇﻥ ﺍﻟﺤﻴﺎﺩﻱ ﺒﺎﻟﻨﺴﺒﺔ ﻟﻠﺘﻘﺎﻁﻊ ﻫﻭ ‪ E‬ﻷﻥ‪:‬‬

‫∀‬ ‫;) ‪A ∈ P( E‬‬ ‫‪A∩ E = E ∩ A = A‬‬

‫‪ y‬ﺍﻟﺘﻘﺎﻁﻊ ﻋﻤﻠﻴﺔ ﺘﺒﺩﻴﻠﻴﺔ ﻭ ﺒﺎﻟﺘﺎﻟﻲ )∩‪ ( A , ∆,‬ﻫﻲ ﺤﻠﻘﺔ ﺒﻭﻟﻴﺎﻨﻴﺔ‪.‬‬

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

‫∈ ) ‪ A = {a + b 2;(a, b‬ﻤﺯﻭﺩﺓ ﺒﺠﻤﻊ ﻭﻀﺭﺏ ﺍﻷﻋﺩﺍﺩ ﺍﻟﺤﻘﻴﻘﻴﺔ‪:‬‬ ‫‪2‬‬

‫ﻟﺘﻜﻥ }‬
‫‪ -1‬ﺒﻴﻥ ﺃﻥ ‪ A‬ﺤﻠﻘﺔ ﺘﺎﻤﺔ‪.‬‬

‫‪ -2‬ﺇﺫﺍ ﻜﺎﻥ ‪ x = a + b 2‬ﻓﺈﻨﻨﺎ ﻨﻌﺭﻑ ﻤﺭﺍﻓـﻕ ‪ x‬ﻭﻨﺭﻤـﺯ ﻟـﻪ ﺒــ ‪ x‬ﺒﺎﻟـﺸﻜل ﺍﻟﺘـﺎﻟﻲ‬
‫‪x −x‬‬ ‫‪x +x‬‬
‫= ) ‪ I (x‬ﻭﺃﺨﻴﺭ ‪N (x ) = x × x‬‬ ‫= ) ‪ R (x‬ﻭ‬ ‫‪ x = a −b 2‬ﻭ‬
‫‪2 2‬‬ ‫‪2‬‬

‫ﺃﺜﺒﺕ ﺃﻥ ﺍﻟﻤﻘﺎﺩﻴﺭ ﺍﻟﺴﺎﺒﻘﺔ ﻫﻲ ﺃﻋﺩﺍﺩ ﺼﺤﻴﺤﺔ ‪ ∀x ∈ A‬ﻭﺃﻥ‬

‫) ‪∀(x , y ) ∈ A 2 ; x × y = x × y , N (x × y ) = N (x )N ( y‬‬

‫‪21‬‬
 ‫‪ -3‬ﺃﺜﺒﺕ ﺃﻥ }}‪U (A ) = {x ∈ A : N (x ) ∈ {−1, +1‬‬

‫‪ -4‬ﺇﺫﺍ ﻜﺎﻥ ‪ ω = 1 + 2‬ﺃﺜﺒﺕ ﺃﻥ‪:‬‬

‫) ‪∀ε ∈ {−1, +1}, ∀n ∈ ; εω 2 ∈U ( A‬‬

‫ﺍﻟﺤل‪:‬‬

‫‪ ( A,+) -1‬ﻫﻲ ﺯﻤﺭﺓ ﺘﺒﺩﻴﻠﻴﺔ ﻭﻨﺘﺤﻘﻕ ﻋﻥ ﺫﻟﻙ ﺒﺴﻬﻭﻟﺔ‪.‬‬

‫‪∀x , y ∈ A ; x = a + b 2, y = a′ + b ′ 2‬‬ ‫‪y‬‬
‫‪x + y = (a + a′) + (b + b ′) 2 = (a′ + a ) + (b ′ + b ) 2‬‬ ‫ﻋﻨﺩﺌﺫ‬
‫‪∀ (x , y , z ) ∈ A 3 ; x = a + b 2, y = a′ + b ′ 2, z = a′′ + b ′′ 2 y‬‬

‫(‬ ‫)‬
‫‪⇒ (x + y ) + z = (a + a′) + (b + b ′) 2 + a′′ + b ′′ 2‬‬

‫‪= (a + a ′ + a′′) + (b + b ′ + b ′′) 2‬‬

‫‪= a + b 2 + (a′ + a′′) + +(b ′ + b ′′) 2‬‬
‫) ‪= x + (y + z‬‬

‫‪ y‬ﺇﻥ ‪ 0 ∈ A‬ﻷﻥ ‪ 0 = 0 + 0 2‬ﻭﻜﺫﻟﻙ ‪∀x ∈ A ; 0 + x = 0 + 0 2 + a + b 2 = x + 0 = x‬‬

‫‪∀ x ∈ A ; − x = −a − b 2 ⇒ x + (− x ) = (− x ) + x = 0 y‬‬

‫ﺇﺫﻥ )‪ ( A,+‬ﺯﻤﺭﺓ ﺘﺒﺩﻴﻠﻴﺔ‪.‬‬

‫‪ y‬ﺍﻟﻘﺎﻨﻭﻥ )×( ﻫﻭ ﺘﺠﻤﻴﻌﻲ‪.‬‬

‫(‬ ‫)‬
‫)‪∀ (x , y , z ) ∈ A 3 ; (x × y ) × z = (a + b 2) × (a ′ + b ′ 2) × (a ′′ + b ′′ 2‬‬

‫(‬ ‫)‬
‫)‪= aa ′ + (ab ′ + ba ′) 2 + 2bb ′ × (a′′ + b ′′ 2‬‬

‫ﺃﺜﺒﺕ ﺃﻥ ﻫﺫﺍ ﺍﻟﻤﻘﺩﺍﺭ ﻴﺴﺎﻭﻱ ) ‪x × ( y × z‬‬

‫‪ y‬ﺘﺤﻘﻕ ﺃﻥ )×( ﺘﻭﺯﻴﻌﻲ ﻋﻠﻰ ﺍﻟﺠﻤﻊ‪..‬‬

‫‪ y‬ﺇﻥ ‪ 1 = 1 + 0 2 ∈ A‬ﻭ ‪∀x ∈ A; x − 1 = 1 − x = x‬‬

‫ﺇﺫﻥ ‪ 1‬ﻫﻭ ﺍﻟﺤﻴﺎﺩﻱ ﺒﺎﻟﻨﺴﺒﺔ ﻟـ ‪. A‬‬

‫‪ y‬ﺍﻟﺤﻠﻘﺔ )× ‪ (A , +,‬ﺘﺒﺩﻴﻠﻴﺔ ﻷﻥ )×( ﺍﻟﻀﺭﺏ ﺍﻟﺘﺒﺩﻴﻠﻲ‪.‬‬

‫‪22‬‬
 x × y = aa′ + (ab ′ + ba′) 2 + 2bb ′
= a′a + (b ′a + a′b ) 2 + 2b ′b
= y ×x

(a + b 2) × (a′ + b ′ 2) = 0 ‫ ﻓﺈﻥ‬x × y = 0 ‫ﻜﺫﻟﻙ ﺇﺫﺍ ﻜﺎﻥ‬

a = b = 0 ‫ ﺃﻱ‬a + b 2 = 0 ‫ ﺃﻭ‬a ′ = b ′ = 0 ‫ ﺃﻱ‬a ′ + b ′ 2 = 0 ‫ﺇﺫﻥ ﺇﻤﺎ‬

.‫ ﺤﻠﻘﺔ ﺘﺎﻤﺔ‬A ‫ﺇﺫﻥ‬

x + x a +b 2 + a −b 2
∀ x ∈ A ; x = a + b 2 ⇒ R (x ) = = = a∈ -2
2 2

R (x ) ∈ ‫ﺇﺫﻥ‬
x − x a +b 2 −a +b 2 2 2
I (x ) ∈ ‫ ﺇﺫﻥ‬I (x ) = = = b =b ∈ ‫ﻭﻜﺫﻟﻙ‬
2 2 2 2 2 2

N (x ) = x × x = (a + b 2) × (a − b 2) = a 2 − ab 2 + ab 2 − 2b 2 = a 2 − 2b 2 ∈

. N (x ) ∈ ‫ﺇﺫﻥ‬
∀(x , y ) ∈ A 2 ⇒ x × y = (a + b 2) × (a′ + b ′ 2)
= aa ′ + ab ′ 2 + a ′b 2 + 2bb ′
= aa′ + 2bb ′ + (ab ′ + a ′b ) 2

x × y = aa′ + 2bb ′ − (ab ′ + a′b ) 2 ‫ ﻭﺒﺎﻟﺘﺎﻟﻲ‬x × y ∈ A ‫ﻻﺤﻅ ﺃﻥ‬

x × y = (a − b 2)(a ′ + b ′ 2)
= aa`−ab ` 2 − ba` 2 + 2bb `
= aa′ + 2bb ′ − (ab ′ + a′b ) 2
=x ×y

:‫ ﺃﺜﺒﺕ ﺃﻥ‬. N (x × y ) = (x × y )(x × y ) = (aa`+2bb `) 2 − 2(ab `+a`b )2 ‫ﻭﻜﺫﻟﻙ‬

N (x )N ( y ) = (aa `+2bb `) 2 − 2(ab `+a `b ) 2 = N (x × y )

‫ ﻴﻜﻔﻲ ﺃﻥ‬x ′ × x = x × x ′ = 1 ‫ ﺒﺤﻴﺙ‬A ∋ x ′ ‫ ﻴﻜﻭﻥ ﻗﻠﻭﺒﹰﺎ ﺇﺫﺍ ﻭﺠﺩ‬x ‫ ﻓﺈﻥ‬0 ≠ x ∈ A ‫ ﻟﻴﻜﻥ‬-3

:‫ ﻷﻥ ﺍﻟﻘﺎﻨﻭﻥ )×( ﺘﺒﺩﻴﻠﻲ‬x ′ × x = 1 ‫ﻴﻜﻔﻲ ﺍﺴﺘﺨﺩﺍﻡ ﺍﻟﻌﻼﻗﺔ‬

x ′ × N (x ) = x ‫ ﻭﻤﻨﻪ‬x ′ × x = 1 ⇒ x ′ × x × x = x ‫ﺇﻥ‬

23
 ‫‪a −b 2‬‬
‫∈ ) ‪( N (x‬‬ ‫= ‪ ) x ′‬ﺘﺫﻜﺭ ﺃﻥ‬ ‫ﺇﺫﺍ ﻜﺎﻥ ‪ x = a + b 2‬ﻓﺈﻥ‬
‫‪x‬‬
‫=‬
‫) ‪N (x‬‬ ‫) ‪N (x‬‬
‫‪1‬‬ ‫) ‪N (x‬‬ ‫‪1‬‬
‫= )‪N (x ′‬‬ ‫‪2‬‬
‫‪x .x = 2‬‬ ‫=‬ ‫∉‬ ‫ﻻﺤﻅ ﺃﻨﻪ ﻓﻲ ﺤﺎل }‪ N (x ) ∉{−1, +1‬ﻓﺈﻥ‬
‫]) ‪[N (x‬‬ ‫) ‪N (x ) N (x‬‬

‫ﺃﻱ ﺃﻥ ‪ x ′‬ﻻ ﻴﻨﺘﻤﻲ ﺇﻟﻰ ‪ A‬ﺇﻻ ﻓﻲ ﺤﺎﻟﺔ }‪ N ( x) ∈ {−1,+1‬ﻭﻨﺴﺘﻨﺘﺞ ﺃﻥ‬

‫}}‪U (A ) = {x ∈ A ; N (x ) ∈ {−1, +1‬‬

‫‪ ω = 1 + 2 -4‬ﻭ }‪ ε ∈ {−1,+1‬ﺇﺫﻥ ‪) εω n = ±(1 + 2) n = ±ω n ∈ A‬ﺃﺜﺒﺕ ﺫﻟﻙ(‬

‫ﻻﺤﻅ ﺃﻥ ‪ N (ω ) = 1 − 2 = −1‬ﻭﺒﺎﻟﺘﺎﻟﻲ ) ‪ . ω ∈U (A‬ﺘﺴﺘﻁﻴﻊ ﺒﺎﻻﻋﺘﻤﺎﺩ ﻋﻠﻰ ﺍﻟﻁﻠﺏ ﺍﻟﺜﺎﻨﻲ ﻤـﻥ‬

‫ﻫﺫﺍ ﺍﻟﺘﻤﺭﻴﻥ ﻭ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺍﻟﺨﺎﺼﺔ ) ‪ ∀(x , y ) ∈ A 2 ; N (x × y ) = N (x ) × N ( y‬ﺃﻥ ﺘﺜﺒـﺕ ﺃﻥ‬
‫‪ N (ω n ) = (N (ω )) n‬ﺃﻱ ﺃﻥ ‪ N (ω n ) = (−1)n‬ﻭﻤﻨﻪ ‪ N (εω n ) = ± N (ω n ) = ±(1) n = ±1‬ﺃﻱ ﺃﻥ‬
‫}‪ N (εω n ) ∈ {−1, +1‬ﻭﻜﺫﻟﻙ ‪ εω n ∈ A‬ﺇﺫﻥ ) ‪. εω n ∈U ( A‬‬

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

‫ﺇﻥ ﺠﻤﻴﻊ ﺍﻟﻤﺜﺎﻟﻴﺎﺕ ﻓﻲ ﺤﻠﻘﺔ ﺍﻷﻋﺩﺍﺩ ﺍﻟﺼﺤﻴﺤﺔ )‪ ( , +,.‬ﻫﻲ ﻤﻥ ﺍﻟﻨﻤﻁ ‪. n‬‬

‫ﺍﻟﺤل‪:‬‬

‫‪n‬‬ ‫∈ ‪ ∀n‬ﻓـﺈﻥ‬ ‫‪ n‬ﻟﻨﺜﺒﺕ ﺃﻥ‬ ‫ﻟﻘﺩ ﺃﺜﺒﺘﻨﺎ ﺃﻥ ﺃﻱ ﺯﻤﺭﺓ ﺠﺯﺌﻴﺔ ﻤﻥ )‪ ( , +,.‬ﻫﻲ ﻤﻥ ﺍﻟﻨﻤﻁ‬
‫‪.‬‬ ‫ﻫﻲ ﻤﺜﺎﻟﻲ ﻓﻲ‬

‫)•( ﺘﺠﻤﻴﻌﻲ‬ ‫ﺇﻥ ﺍﻟﺸﺭﻁ ﺍﻷﻭل ﻤﺤﻘﻕ‪.‬‬

‫‪∀ x ∈ n ; ∃z ∈ ; x = nz‬‬
‫; ∈ ‪⇒ ∀p‬‬ ‫) ‪p .x = x . p = (n .z ). p = n (z . p‬‬ ‫)•( ﺩﺍﺨﻠﻲ‬
‫∈ ‪= nq ; q = z . p‬‬

‫ﺤﻠﻘﺔ ﺘﺒﺩﻴﻠﻴﺔ‬ ‫‪ n‬ﻫﻲ ﻤﺜﺎﻟﻲ ﻓﻲ‬ ‫‪ ∀ x ∈ n‬ﺇﺫﻥ‬ ‫; ∈‪p‬‬ ‫‪p .x ∈ n‬‬ ‫ﺇﺫﻥ‬

‫ﺍﻟﺘﻤﺭﻴﻥ ﺍﻟﺨﺎﻤﺱ‪:‬‬

‫ﻟﺘﻜﻥ ‪ H 1 , H 2‬ﺯﻤﺭﺘﻴﻥ ﺠﺯﺌﻴﺘﻴﻥ ﻤﻥ ﺍﻟﺯﻤﺭﺓ )‪ ( , +‬ﻭﻟﻨﻌﺭﻑ‪:‬‬

‫‪24‬‬
 ‫}) ‪H = H 1 + H 2 = {h1 , h2 ; (h1 ∈ H 1 ) ∧ (h2 ∈ H 2‬‬

‫‪ -1‬ﺃﺜﺒﺕ ﺃﻥ ‪ H‬ﻫﻲ ﺃﺼﻐﺭ ﺯﻤﺭﺓ ﺠﺯﺌﻴﺔ ﻤﻥ ) ‪( , +‬‬

‫ﺘﺤﻭﻱ ﺍﻟﻤﺠﻤﻭﻋﺔ ﺍﻟﺠﺯﺌﻴﺔ ‪. H 1 ∪ H 2‬‬

‫‪.4 +6‬‬ ‫‪ -2‬ﻤﺎ ﻫﻭ ﺸﻜل ﺍﻟﻤﺠﻤﻭﻋﺔ ﺍﻟﺠﺯﺌﻴﺔ‬

‫‪ a ∪ b ⊂ c‬ﺒﺎﺴﺘﺨﺩﺍﻡ ﻗﺎﺒﻠﻴﺔ ﺍﻟﻘﺴﻤﺔ؟‬ ‫‪ -3‬ﻜﻴﻑ ﺘﻔﺴﺭ ﺍﻻﺤﺘﻭﺍﺀ‬

‫ﺍﻟﺤل‪:‬‬

‫ﻭﻴﻨﺘﻤﻲ ﺇﻟﻰ ﻜل ﻤﻥ ‪ H 2‬و ‪ H 1‬ﺇﺫﻥ ‪0 ∈ H‬‬ ‫‪ -1‬ﺇﻥ ‪ 0‬ﺍﻟﺫﻱ ﻫﻭ ﺍﻟﺤﻴﺎﺩﻱ ﺒﺎﻟﻨﺴﺒﺔ ﻟﻠﺠﻤﻊ ﻓﻲ‬

‫ﻟﻴﻜﻥ ‪ h1 , h1′ ∈ H 1‬ﻭ ‪ h2 , h2′ ∈ H 2‬ﻓﺈﻥ ‪ . h2 − h2′ ∈ H 2 , h1 − h1′ ∈ H 1‬ﺤﺴﺏ ﺘﻌﺭﻴﻑ ﺍﻟﺯﻤـﺭ‬
‫ﺍﻟﺠﺯﺌﻴﺔ ﻓﺈﻥ ‪ h1 + h2 − h1′ − h2′ = h1 − h1′ + h2 − h2′ ∈ H‬ﺃﻱ ﺃﻥ ‪ H‬ﺯﻤﺭﺓ ﺠﺯﺌﻴﺔ‪.‬‬

‫ﻻﺤﻅ ﺃﻥ‪ H 1 ∪ H 2 ⊂ H :‬ﻷﻥ ‪ ∀h ∈ H 1 ∪ H 2‬ﻓﺈﻥ ) ‪(h1 ∈ H ) ∨ (h ∈ H 2‬‬

‫ﺇﺫﻥ ﻨﺴﺘﻁﻴﻊ ﺃﻥ ﻨﻜﺘﺏ ‪ h‬ﻜﻤﺎ ﻴﻠﻲ ‪ h = h + 0 = 0 + h‬ﺃﻱ ‪h ∈ H 1 + H 2 = H‬‬

‫ﺇﺫﻥ ‪ H‬ﻴﻨﺘﻤﻲ ﺇﻟﻰ ﻤﺠﻤﻭﻋﺔ ﺍﻟﺯﻤﺭ ﺍﻟﺠﺯﺌﻴﺔ ﺍﻟﺘﻲ ﺘﺤﻭﻱ ‪ . H 1 ∪ H 2‬ﻭﻟﻨﺭﻤﺯ ﻟﻬﺫﻩ ﺍﻟﻤﺠﻤﻭﻋـﺔ‬
‫ﺒـ } ‪G = {G i ⊂ ; H 1 ∪ H 2 ∈G i , i ∈ I‬‬

‫ﻫﻲ ﺃﺼﻐﺭ ﺯﻤﺭﺓ ﺠﺯﺌﻴﺔ ﺘﺤـﻭﻱ ‪. H 1 ∪ H 2‬‬ ‫‪∩G‬‬ ‫‪i‬‬ ‫ﺤﺴﺏ ﺍﻟﻤﺒﺭﻫﻨﺔ )‪ (4‬ﻤﻥ ﺍﻟﻔﺼل ﺍﻟﺜﺎﻟﺙ ﻓﺈﻥ‬
‫‪i∈I‬‬

‫ﻭﻟﻨﺜﺒﺕ ﺃﻥ ‪. H ⊂ ∩ Gi‬‬ ‫‪∩G‬‬ ‫‪i‬‬ ‫ﻨﻼﺤﻅ ﺃﻥ ‪ H ∈ G‬ﻭﺒﺎﻟﺘﺎﻟﻲ ‪⊂ H‬‬

‫‪i∈I‬‬ ‫∈‪i‬‬

‫‪∩G‬‬ ‫‪i‬‬ ‫ﺤﺴﺏ ﺍﻟﻤﺒﺭﻫﻨﺔ )‪ (5‬ﻤﻥ ﺍﻟﻔﺼل ﺍﻟﺜﺎﻟﺙ ﺃﻴﻀ ﹰﺎ ﻨﺠﺩ ﺃﻥ > ‪=< H 1 ∨ H 2‬‬
‫‪i∈I‬‬

‫{‬
‫∈ ‪⇒ ∩G i = g 1 + g 2 + … + g n ; ∀ i‬‬
‫‪i ∈I‬‬
‫‪n‬‬ ‫) ‪; gi ∈ (H1 ∪ H 2 ) ∪ (H1 ∪ H 2‬‬
‫‪−1‬‬
‫}‬
‫ﺣ ﻴ ﺚ ‪( h1 , h2 ) ∈ H 1 × H 2‬‬ ‫ﻨﻼﺤﻅ ﺃﻨﻪ‪ ∀ h ∈ H :‬ﻓﺈﻥ‪h = h1 + h2 :‬‬

‫ﺇﻥ ‪ h1 ∈ H 1 ⊂ H 1 ∪ H 2‬ﻭ ‪ h2 ∈ H 2 ⊂ H 1 ∪ H 2‬ﺇﺫﻥ‪:‬‬

‫‪h1 + h2 ∈ ( H 1 ∪ H 2 ) ∪ ( H 1 ∪ H 2 ) −1 ⇒ h ∈ ∩ Gi‬‬
‫‪i∈I‬‬

‫ﻭ ﻨﺴﺘﻨﺘﺞ ﺃﻥ ‪ H 1 + H 2 = ∩ Gi‬ﺃﻱ ‪ H 1 + H 2‬ﻫﻲ ﺃﺼﻐﺭ ﺯﻤﺭﺓ ﺠﺯﺌﻴﺔ ﻤـﻥ )‪ ( Z ,+‬ﺘﺤـﻭﻱ‬

‫‪i∈I‬‬

‫‪. H1 ∪ H 2‬‬

‫‪25‬‬
 ‫∈ ‪ n‬ﻭﺒﺎﻟﺘﺎﻟﻲ‪:‬‬ ‫‪ n‬ﺤﻴﺙ‬ ‫ﻫﻲ ﻤﻥ ﺍﻟﺸﻜل‬ ‫‪ -2‬ﺘﻌﻠﻡ ﺃﻥ ﺃﻱ ﻤﺠﻤﻭﻋﺔ ﺠﺯﺌﻴﺔ ﻤﻥ‬
‫‪4 + 6 = {h1 + h2 ; (h1 , h2 ) ∈ 4 × 6‬‬ ‫}‬
‫{‬
‫∈ ) ‪= 4 k + 6l ; ( k , l‬‬ ‫‪2‬‬
‫}‬
‫} ∈ ) ‪= { 4 k + 4l + 2 l ; ( k , l‬‬ ‫‪2‬‬

‫} ∈ ) ‪= {4(k + l ) + 2l ; (k , l‬‬ ‫‪2‬‬

‫} ∈ ) ‪= {4m + 2l ; (m , l‬‬ ‫‪2‬‬

‫} ∈ ) ‪= {2.2m + 2l ; (m , l‬‬ ‫‪2‬‬

‫} ∈ ) ‪= {2 p + 2l ; ( p , l‬‬ ‫‪2‬‬

‫;) ‪= {2( p + l‬‬ ‫∈ ‪p +l‬‬ ‫‪}= 2‬‬

‫‪ 4 + 6 = 2‬ﻻﺤﻅ ﺃﻥ ‪ 2‬ﻫﻭ ﺍﻟﻘﺎﺴﻡ ﺍﻟﻤﺸﺘﺭﻙ ﺍﻷﻜﺒﺭ ﻟـ )‪ (4,6‬ﺃﻱ )‪. 2 = gcd(4,6‬‬ ‫ﺇﺫﻥ‪:‬‬

‫‪ -3‬ﻻﺤﻅ ﺃﻥ ﺍﻟﻘﺴﻡ ﺍﻷﻭل ﻤﻥ ﻫﺫﺍ ﺍﻟﺘﻤﺭﻴﻥ ﻴﻤﻜﻨﻨﺎ ﻤﻥ ﺍﻟﻜﺘﺎﺒﺔ ﺍﻟﺘﺎﻟﻴﺔ‪:‬‬

‫‪ a + b‬ﻫـﻲ‬ ‫‪ a + b ⊆ c‬ﻷﻥ‬ ‫‪ a ∪ b ⊂ c‬ﻓﺈﻥ‬ ‫‪ a ∪ b ⊂ a + b‬ﺇﺫﹰﺍ ﺇﺫﺍ ﻜﺎﻨﺕ‬

‫‪ a ∪ b‬ﺃﻱ ﻴﻤﻜﻨﻨـﺎ ﺃﻥ ﻨﻘـﻭل ﺃﻥ ‪ c‬ﻫـﻭ ﻗﺎﺴـﻡ ﻤـﺸﺘﺭﻙ‬ ‫ﺃﺼﻐﺭ ﻤﺠﻤﻭﻋﺔ ﺠﺯﺌﻴﺔ ﺘﺤﻭﻱ‬
‫ﻟـ )‪. (a, b‬‬

‫ﺍﻟﺘﻤﺭﻴﻥ ﺍﻟﺴﺎﺩﺱ‪:‬‬

‫∈ ) ‪ ، (a, b‬ﺃﺜﺒﺕ ﻤﺎ ﻴﻠﻲ‪:‬‬ ‫‪*2‬‬

‫ﻟﻴﻜﻥ‬

‫∈ ‪ a‬ﺤﻴﺙ )‪ (d a ) ∧ (d b‬ﻓﺈﻥ )‪d gcd(a, b‬‬ ‫‪ -1‬ﺇﺫﺍ ﻜﺎﻥ‬

‫∈ ‪ m‬ﺤﻴﺙ )‪ (a m) ∧ (b m‬ﻓﺈﻥ ‪lcm(a, b) m‬‬ ‫‪ -2‬ﺇﺫﺍ ﻜﺎﻥ‬

‫ﺍﻟﺤل‪:‬‬

‫‪ (a ∪ b ) ⊂ d‬ﻭﻟﻜـﻥ‬ ‫‪ -1‬ﺒﻤﺎ ﺃﻥ )‪ (d a) ∧ (d b‬ﻓﺈﻥ ) ‪ (a ⊂ d ) ∧ (b ⊂ d‬ﺃﻱ ﺃﻥ‬

‫‪a ∪b ⊂ a + b = δ‬‬ ‫ﺤﺴﺏ ﺍﻟﺘﻤﺭﻴﻥ ﺍﻟﺴﺎﺒﻕ ﻭﺍﻟﻤﺒﺭﻫﻨﺔ ‪ 10‬ﻓﺈﻥ ) ‪⊂ d ; δ = gcd(a , b‬‬

‫ﻨﺴﺘﻨﺘﺞ ﺒﺎﺴﺘﺨﺩﺍﻡ ﺍﻟﻤﺒﺭﻫﻨﺔ ‪ 6‬ﻤﻥ ﺍﻟﻔﺼل ﺍﻟﺜﺎﻟﺙ ﺃﻥ ‪. d δ‬‬

‫‪ -2‬ﻟﻴﻜﻥ )‪ µ = lcm(a, b‬ﺍﻟﻤﻀﺎﻋﻑ ﺍﻟﻤﺸﺘﺭﻙ ﺍﻷﺼﻐﺭ ﻟـ ‪. b, a‬‬

‫‪26‬‬
‫∈ ‪ m‬ﻭ ﺤﺴﺏ ﺍﻟﻤﺒﺭﻫﻨﺔ ‪ 6‬ﻤـﻥ ﺍﻟﻔـﺼل ﺍﻟﺜﺎﻟـﺙ ﻴﻨـﺘﺞ ﺃﻥ‪:‬‬ ‫ﺇﺫﺍ ﻜﺎﻥ )‪ (a m) ∧ (b m‬ﺤﻴﺙ‬
‫‪ m ⊂ µ‬ﻭﺫﻟﻙ ﺤﺴﺏ ﺍﻟﻤﺒﺭﻫﻨـﺔ‬ ‫‪ m ⊂ a ∩ b‬ﺃﻱ‬ ‫) ‪ (m ⊂ a ) ∧ (m ⊂ b‬ﺃﻱ ﺃﻥ‬
‫‪ ،10‬ﺇﺫﻥ ‪. µ m‬‬

‫ﺍﻟﺘﻤﺭﻴﻥ ﺍﻟﺴﺎﺒﻊ‪:‬‬

‫ﺃﻭﺠﺩﺍﻟﻘﺎﺴﻡ ﺍﻟﻤﺸﺘﺭﻙ ﺍﻷﺼﻐﺭ ﻟﻠﻌﺩﺩﻴﻥ )‪(366, 43‬‬

‫ﺍﻟﺤل‪:‬‬

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

‫‪rk −1‬‬ ‫‪366‬‬ ‫‪43‬‬ ‫‪22‬‬ ‫‪21‬‬

‫‪rk‬‬ ‫‪43‬‬ ‫‪22‬‬ ‫‪21‬‬ ‫‪1= d‬‬

‫‪rk +1‬‬ ‫‪0‬‬

‫‪22‬‬ ‫‪21‬‬ ‫‪1‬‬

‫ﺇﺫًﹰﺍ )‪. d = gcd(366,43‬‬

‫ﺍﻟﺘﻤﺭﻴﻥ ﺍﻟﺜﺎﻤﻥ‪:‬‬

‫ﺃﻭﺠﺩ ﺍﻟﻌﺩﺩﻴﻥ ﺍﻟﺼﺤﻴﺤﻴﻥ ‪ x‬ﻭ ‪ y‬ﺒﺤﻴﺙ‪5313x + 2047 y = 23 :‬‬

‫ﺍﻟﺤل‪:‬‬

‫‪27‬‬
 ‫ﻟﻘﺩ ﻭﺠﺩﻨﺎ ﻓﻲ ﻤﺜﺎل ﺴﺎﺒﻕ ﺇﻥ ‪ gcd(a, b) = 23‬ﺤﻴﺙ ‪ a = 5313‬ﻭ ‪b = 2047‬‬

‫ﻋﻨﺩﺌ ٍﺫ ﻨﺤﺼل ﻋﻠﻰ ﺍﻟﺠﺩﻭل ﺍﻟﺘﺎﻟﻲ ﺍﻟﺫﻱ ﻴﻌﻁﻲ ﻗﻴﻤﺔ ‪. y, x‬‬

‫‪k‬‬ ‫‪rk‬‬ ‫‪qk‬‬ ‫‪uk‬‬ ‫‪vk‬‬

‫‪0‬‬ ‫‪5313‬‬ ‫‪-‬‬ ‫‪1‬‬ ‫‪0‬‬

‫‪1‬‬ ‫‪2047‬‬ ‫‪2‬‬ ‫‪0‬‬ ‫‪1‬‬
‫‪2‬‬ ‫‪1219‬‬ ‫‪1‬‬ ‫‪1‬‬ ‫‪-2‬‬
‫‪3‬‬ ‫‪828‬‬ ‫‪1‬‬ ‫‪-1‬‬ ‫‪3‬‬
‫‪4‬‬ ‫‪391‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪-5‬‬
‫‪5‬‬ ‫‪46‬‬ ‫‪8‬‬ ‫‪-5‬‬ ‫‪13‬‬
‫‪6‬‬ ‫‪23‬‬ ‫‪42‬‬ ‫‪-109‬‬

‫‪7‬‬ ‫‪0‬‬

‫ﻼ‪ u 2 = u 0 − q1u1 = 1 − 2 × 0 = 1 :‬ﻭﻤﻥ ﺜﻡ ﻨﻭﺠﺩ ﺍﻟﺒﻘﻴﺔ ﺒﻨﻔﺱ ﺍﻟﻁﺭﻴﻘﺔ‪.‬‬

‫ﻓﻤﺜ ﹰ‬

‫‪ v 2 = v 0 − q1v 1 = 0 − 2 ×1 = −2‬ﻭﻤﻨﻪ‪. x = u 6 = 42, y = v 6 = −109 :‬‬

‫‪28‬‬
 ‫‪ .9‬ﺍﻟﻔﻀﺎﺀﺍﺕ ﺍﻟﺸﻌﺎﻋﻴﺔ ﻭﺍﻟﺠﺒﻭﺭﻋﻠﻰ ﺤﻘل‬
‫ﺘﻌﺭﻴﻑ ﺍﻟﻔﻀﺎﺀ ﺍﻟﺸﻌﺎﻋﻲ )‪(Vector space‬‬

‫ﻟﻴﻜﻥ ‪ K‬ﺤﻘ ﹰ‬
‫ﻼ ﺘﺒﺩﻴﻠﻴﺎﹰ‪ ،‬ﺘﺴﻤﻰ ﻓﻀﺎﺀ ﺸﻌﺎﻋﻲ ﻋﻠﻰ ﺍﻟﺤﻘل ‪ ، K‬ﻜل ﺒﻨﻴﺔ ﺠﺒﺭﻴـﺔ )‪ ( E ,+,.‬ﺘﺤﻘـﻕ‬
‫ﺍﻟﺸﺭﻭﻁ ﺍﻟﺘﺎﻟﻴﺔ‪:‬‬

‫‪ y‬ﺍﻟﺒﻨﻴﺔ )‪ ( E ,+‬ﺯﻤﺭﺓ ﺘﺒﺩﻴﻠﻴﺔ‪.‬‬

‫‪ y‬ﺍﻟﻘﺎﻨﻭﻥ )‪ (.‬ﻫﻭ ﻗﺎﻨﻭﻥ ﺘﺸﻜﻴل ﺨﺎﺭﺠﻲ ﻋﻠﻰ ‪ E‬ﻤﺠﻤﻭﻉ ﻤﺅﺜﺭﺍﺘـﻪ ﺍﻟﺤﻘـل ‪ K‬ﻭﻴﺤﻘـﻕ‬
‫ﺍﻟﺨﻭﺍﺹ ﺍﻟﺘﺎﻟﻴﺔ‪:‬‬
‫‪∀a ∈ K , ∀(a, y ) ∈ E 2 ; a(x + y ) = ax + a.y‬‬

‫‪⎧(a + b ).x = a.x + b .x‬‬

‫⎨ ; ‪∀(a, b ) ∈ K , ∀x ∈ E‬‬
‫) ‪⎩(a.b ).x = a.(b .x‬‬
‫‪∀x ∈ E ; 1K .x = x‬‬

‫ﺘﻌﺭﻴﻑ‬

‫ﻟﻴﻜﻥ ‪ K‬ﺤﻘ ﹰ‬
‫ﻼ ﺘﺒﺩﻴﻠﻴﹰﺎ‪ .‬ﻨﹸﺴﻤﻲ ﺠﺒﺭﹰﺍ ﻋﻠﻰ ﺍﻟﺤﻘل ‪ . K‬ﻜل ﺒﻨﻴﺔ ﺠﺒﺭﻴﺔ )•‪ ( E ,+,×,‬ﺘﺤﻘﻕ ﺍﻟـﺸﺭﻭﻁ‬
‫ﺍﻟﺘﺎﻟﻴﺔ‪:‬‬

‫ﺍﻟﺒﻨﻴﺔ )•‪ ( E ,+,‬ﻓﻀﺎﺀ ﺸﻌﺎﻋﻲ ﻋﻠﻰ ﺍﻟﺤﻘل ‪. K‬‬

‫ﺍﻟﺒﻨﻴﺔ )×‪ ( E ,+,‬ﺤﻠﻘﺔ‪.‬‬

‫) ‪∀a ∈ K , ∀(x , y ) ∈ E 2 ; (a.x ) × y = a.(x × y‬‬

‫‪29‬‬