Kulolu shicilelo, sizocubungula ukuthi yiziphi izici eziyinhloko nokuthi singabola kanjani noma iyiphi inombolo kuzo. Sizohambisana netiyori nezibonelo zokuqonda kangcono.
Okuqukethwe
I-algorithm yokubola inombolo ibe yizici eziyinhloko
Okokuqala, ake sikhumbule lokho elula inombolo engokwemvelo enkulu kunoziro ehlukaniseka ngokwayo futhi eyodwa (“1” ayiyona into eyinhloko).
Uma kunezihlukanisi ezingaphezu kwezimbili, inani liyabhekwa okuhlanganayo, futhi ingabola ibe umkhiqizo wezici eziyinhloko. Le nqubo ibizwa ngokuthi i-factorization, iqukethe izinyathelo ezilandelayo:
- Siqinisekisa ukuthi inombolo enikeziwe ayiyona eyinhloko. Uma kufika ku-1000, itafula elethulwe kwelinye elihlukile lingasisiza ngalokhu.
- Sihlunga zonke izinombolo eziyinhloko (kusukela kwencane kunazo zonke) ukuze sithole isihlukanisi.
- Senza ukuhlukanisa, futhi nge-quotient ewumphumela senza isinyathelo esingenhla. Uma kunesidingo, phinda lesi senzo izikhathi eziningana kuze kube yilapho sithola inombolo eyinhloko njengomphumela.
Izibonelo ze-Factorization
Isibonelo se-1
Ake sihlukanise ama-63 sibe yizici ezibalulekile.
Isinqumo:
- Inombolo enikeziwe iyinhlanganisela, ngakho-ke ungakwazi ukwenza izinto.
- I-prime divisor encane kunazo zonke ezintathu. I-quotient ka-63 ehlukaniswe ngo-3 ngu-21.
- Inombolo 21 iphinde ihlukaniseke ngo-3, okuholela ku-7.
- Isikhombisa inombolo eyinhloko, ngakho siyama kuyo.
Ngokuvamile, i-factorization ibonakala kanje:
Impendulo: 63 = 3 3 7.
Isibonelo se-2
Isibonelo se-3
