Ithiyori Yezinombolo Eziyinhloko
Izinombolo eziyinhloko zingenye yezinto ezilula kodwa eziyimfihlakalo kakhulu kwizibalo. Kulula ngoba incazelo yazo iqondile: inombolo eyinhloko iyinombolo ephelele enkulu kuno-1 enezahlukanisi ezimbili ezinhle kuphela: u-1 kanye nayo uqobo. Kuyimfihlakalo ngoba, naphezu kokufundwa iminyaka eyizinkulungwane, imibuzo eminingi eyisisekelo mayelana nezinombolo eziyinhloko ayikaphendulwa kuze kube namuhla. Igatsha lezibalo elifunda izakhiwo, amaphethini, kanye nokusatshalaliswa kwezinombolo eziyinhloko livame ukuxoxwa ngalo ku-theory yezinombolo, futhi lesi sihloko saziwa kabanzi ngokuthi i-theory yenombolo eyinhloko.
Incazelo kanye nezibonelo zezinombolo eziyinhloko
Izinombolo eziyinhloko ziqala ngo-2, 3, 5, 7, 11, 13, 17, 19, njalo njalo. Kulolu hlu, singabona ukuthi u-2 uwukuphela kwenombolo elinganayo eyinhloko. Zonke ezinye izinombolo ezilinganayo zihlukaniswa ngo-2, ngakho-ke zinama-divisor angaphezu kwamabili futhi azikwazi ukubizwa ngokuthi ama-prime.
Okuphambene nenombolo eyinhloko yinombolo ehlanganisiwe, okuyinombolo ephelele enkulu kuno-1 enama-divisor angaphezu kwamabili. Isibonelo, u-4 unezihlukanisi 1, 2, no-4; u-12 unezihlukanisi 1, 2, 3, 4, 6, no-12. Inombolo 1 ayiyona eyinhloko futhi ayihlanganisiwe, ngoba ine-divisor eyodwa kuphela, u-1.
Ukuqonda izinombolo eziyinhloko kubalulekile ngoba zivame ukubizwa ngokuthi “izitini zokwakha” zezinombolo eziphelele. Izinombolo eziphelele zonke ezingaphezu kuka-1 zingahlukaniswa zibe umkhiqizo wezinombolo eziyinhloko.
Imibono Eyisisekelo Yezibalo
Omunye wemiphumela ebaluleke kakhulu ku-prime number theory yi-Fundamental Theorem of Arithmetic. Le theorem ithi yonke inombolo enkulu kuno-1 ingabhalwa njengomkhiqizo oyingqayizivele wezinombolo eziyinhloko, kuze kufike ku-factor yayo.
Ngokwesibonelo:
– 60 = 2 × 2 × 3 × 5 = 2² × 3 × 5
– 84 = 2 × 2 × 3 × 7 = 2² × 3 × 7
Lokhu kuhluka kwe-prime factorization kuyisisekelo semiqondo eminingi yezibalo, kusukela ekuhlukaniseni, i-least common multiple (LCM), i-greatest common factor (GCF), kuya kuma-algorithms ahlukahlukene kwisayensi yekhompyutha.
Indlela Yokuthola Izinombolo Eziyinhloko
Kunezindlela eziningana zokunquma ukuthi inombolo iyi-prime. Indlela eyisisekelo kakhulu ukuhlola ukuthi inombolo iyahlukaniswa yini nganoma iyiphi inombolo ngaphandle kuka-1 kanye nayo ngokwayo. Kodwa-ke, le ndlela ayisebenzi kahle ezinambeni ezinkulu.
Indlela ephumelela kakhulu ukuhlola abahlukanisi kuze kufike empandeni yesikwele yenombolo. Uma inombolo u-n inezici ezingaphandle kuka-1 no-n, okungenani enye yezici ayidluli u-√n. Isibonelo, ukuhlola ukuthi u-97 uyinhloko yini, mane uyivivinye ukuze ubone ukuthi uyahlukaniswa yini ngezinombolo eziyinhloko ≤ √97 (cishe u-9,8), okungu-2, 3, 5, kanye no-7. Njengoba u-97 engahlukaniswa yinoma iyiphi yalezi ezine, uyiyinhloko.
Ngaphezu kwalokho, kunezindlela zakudala ezifana ne-Sieve of Eratosthenes, ezisebenza kahle ekutholeni zonke izinombolo eziyinhloko kuze kufike emkhawulweni othile. Le ndlela ihilela ukufaka ohlwini zonke izinombolo kusukela ku-2 kuya ku-N, bese uphawula izinombolo eziphindaphindayo zika-2, izinombolo eziphindaphindayo zika-3, izinombolo eziphindaphindayo zika-5, njalo njalo. Izinombolo ezingaphawulwanga ziyizinombolo eziyinhloko.
Amaphethini Nokusatshalaliswa Kwezinombolo Eziyinhloko
Enye yezinto ezenza izinombolo eziyinhloko zibe mnandi ukusatshalaliswa kwazo okubonakala kungahleliwe. Ayikho iphethini elula ekhiqiza wonke ama-prime ngokushesha. Ngezinye izikhathi ama-prime abonakala esondelene, njengo-11 no-13, noma u-17 no-19, kodwa ibanga eliphakathi kwawo lingakhula.
Umbuzo obalulekile ku-prime number theory uthi: “Zivela kangaki izinombolo eziyinhloko?” Ukuze baphendule lokhu, izazi zezibalo zakha i-Prime Number Theorem. Le theorem ithi inani lama-prime angaphansi noma alingana no-n, abhalwe njengo-π(n), cishe alingana no-n / ln(n). Lokhu kusho ukuthi njengoba u-n ekhula, ama-prime aba mancane, kodwa ayaqhubeka nokuvela unomphela.
Isibonelo, ku-n omkhulu kakhulu, amathuba okuthi inombolo engahleliwe ezungeze u-n ibe yi-prime cishe i-1/ln(n). Lokhu kunikeza umbono jikelele wezibalo wokusatshalaliswa kwezinombolo ze-prime.
Izinombolo Ezimbili Eziyinhloko kanye Nezibikezelo Ezidumile
Ama-prime amabili angama-pair of prime numbers umehluko wawo ungu-2, njengo-(3, 5), (11, 13), (17, 19), njalo njalo. Umbuzo omkhulu osavulekile nanamuhla yi-Twin Prime Conjecture: “Ingabe kukhona ama-pair amaningi kakhulu ama-prime amabili?” Naphezu kobufakazi obuningi obusekelayo kanye nentuthuko ebalulekile emashumini eminyaka amuva nje, lokhu kuqagela akukafakazelwa ngokugcwele.
Ngaphezu kwalokho, kukhona i-Goldbach Conjecture, ethi inombolo ngayinye elingana nengaphezulu kuka-2 ingabhalwa njengesamba sezinombolo ezimbili eziyinhloko. Isibonelo:
– 10 = 3 + 7
– 28 = 11 + 17
– 100 = 47 + 53
Lokhu kuqagela kuhlolwe ngamanani amakhulu kakhulu futhi kuhlale kuyiqiniso ngaphansi kwalezi zivivinyo, kodwa akukabikho bufakazi obuphelele obusemthethweni.
Indima Yezinombolo Eziyinhloko Ku-Cryptography Yanamuhla
Ngale kwezibalo ezimsulwa, izinombolo eziyinhloko zidlala indima ebalulekile empilweni yanamuhla, ikakhulukazi ekuphepheni kolwazi. I-RSA cryptosystem, enye yezindlela zokubethela ezaziwa kakhulu, incike ebunzimeni bokuhlanganisa izinombolo ezinkulu zibe yizici eziyinhloko. Ku-RSA, ukhiye womphakathi ungakhiqizwa ngomkhiqizo wezinombolo ezimbili ezinkulu eziyinhloko. Ukunciphisa lo mkhiqizo ube yizici zawo ezimbili zokuqala kuyinkinga enzima kakhulu uma izinombolo zinkulu ngokwanele, ngaleyo ndlela kuhlinzeke ngesisekelo sokuphepha.
Ngamanye amazwi, ubuhle bezinombolo eziyinhloko abugcini nje ngokuba yiqiniso kodwa futhi buwusizo, njengoba kusiza ekugcineni ukuphepha kokuthengiselana kwedijithali, ukuxhumana okubethelwe, kanye nokushintshana kwedatha eyimfihlo kwi-inthanethi.
I-Penutup
Ithiyori yenombolo ye-Prime ingenye yezinkambu ezicebile kakhulu kwizibalo. Kusukela encazelweni elula yenombolo ye-prime, sifinyelela imiqondo ejulile njenge-factorization eyingqayizivele, i-prime distribution theorem, ngisho nezibikezelo ezingaxazululiwe. Izinombolo ze-Prime ziyaqhubeka nokusithakazelisa ngoba zidlula umngcele phakathi kokuhleleka nokungahleliwe: zibonakala zingenamaphethini, kodwa zilalela imithetho yezibalo ejulile.
Ukufunda izinombolo eziyinhloko akukhona nje ukuthola ukuthi yiziphi izinombolo eziyinhloko nokuthi yiziphi ezingezona eziyinhloko, kodwa futhi nokuqonda ukuthi "zisatshalaliswa kanjani" phakathi kwezinombolo eziphelele, ukuthi kungani zidlala indima ebaluleke kangaka, nokuthi zithonya kanjani ubuchwepheshe besimanje. Ngenxa yalesi sizathu, inkolelo-mbono yezinombolo eziyinhloko isalokhu ingenye yezihloko ezicwaningwe kakhulu futhi ezithakazelisayo kubafundi bezibalo, othisha, kanye nabacwaningi kuze kube namuhla.
