Amfani da Ka'idar Sauran a Lissafi
Sauran ka'idar ra'ayi ne na lissafi wanda galibi ginshiƙi ne mai mahimmanci a fannoni daban-daban na lissafi, gami da algebra, ka'idar lamba, da lissafi daban-daban. Wannan ra'ayi ba wai kawai yana da mahimmanci a matakin farko ba, har ma yana da amfani mai mahimmanci a cikin ci gaba da bincike da haɓaka lissafi. Wannan labarin zai bincika sauran ka'idar a cikin zurfin, yana rufe ma'anarta, aikace-aikacenta, da misalai da yawa don fahimtar yadda take aiki a cikin yanayi daban-daban.
Fahimtar Sauran Ka'idar
Sauran ka'idar ka'ida ce a cikin algebra ta polynomial. Wannan ka'idar ta bayyana cewa idan aka raba polynomial \( P(x) \) ta hanyar binomial \( (x - c) \), to sauran shine \( P(c) \). Wato, ga polynomial \( P(x) \) idan muka raba \( P(x) \) ta \( x - c \), za mu sami wannan siffar:
\[ P(x) = (x – c)Q(x) + R \]
inda \( Q(x) \) shine adadin polynomial kuma \( R \) shine sauran. A cewar Ka'idar Remainder, \( R \) shine ƙimar aikin polynomial lokacin da \( x = c \), ko a cikin bayanin lissafi:
\[ R = P(c) \]
Shaidar Ka'idar Sauran
Domin mu fahimci wannan ka'idar sosai, bari mu tabbatar da ita a takaice. A ce muna da polynomial \( P(x) \) kuma muka raba ta da \( (x - c) \). Sannan za mu iya rubuta cewa:
\[ P(x) = (x – c)Q(x) + R \]
inda \( R \) shine ragowar rabon. Tunda \( (x – c) \) shine binomial na digiri na farko, ragowar \( R \) dole ne ya zama mai daidaito (saboda matakin sauran dole ne ya zama ƙasa da matakin mai rabawa). Bari mu maye gurbin \( x = c \):
\[ P(c) = (c – c)Q(c) + R \]
\[ P(c) = 0 \cdot Q(c) + R \]
\[ P(c) = R \]
Saboda haka, an tabbatar da cewa sauran \( R \) daidai yake da \( P(c) \).
Misali na Amfani da Ka'idar Sauran
Bari mu dubi wani misali na musamman na sauran ka'idar domin mu fahimci aikace-aikacenta.
Misali na 1:
A ce muna da polynomial \( P(x) = x^3 – 4x^2 + 6x – 24 \). Muna son raba wannan polynomial da \( x – 2 \).
Mataki na farko shine a nemo ƙimar \( P(2) \):
\[ P(2) = 2^3 – 4 \cdot 2^2 + 6 \cdot 2 – 24 \]
\[ P(2) = 8 – 16 + 12 – 24 \]
\[ P(2) = -20 \]
Don haka, ragowar raba \(P(x) \) da \(x – 2 \) shine -20.
Misali na 2:
A ce muna da polynomial \( P(x) = 2x^4 + 3x^3 – x + 5 \). Muna son raba wannan polynomial da \( x + 1 \).
Mataki na farko shine a nemo ƙimar \( P(-1) \):
\[ P(-1) = 2(-1)^4 + 3(-1)^3 – (-1) + 5 \]
\[ P(-1) = 2(1) + 3(-1) + 1 + 5 \]
\[ P(-1) = 2 – 3 + 1 + 5 \]
\[ P(-1) = 5 \]
Saboda haka, ragowar raba \(P(x) \) da \(x + 1 \) shine 5.
Aikace-aikacen Ka'idar Sauran
Sauran ka'idar tana da aikace-aikace da yawa a fannoni daban-daban na lissafi. Wasu daga cikin manyan aikace-aikacen sun haɗa da:
1. Abubuwan da suka shafi Polynomial:
Idan \( P(c) = 0 \), to \( x – c \) factor ne na \( P(x) \). Wannan yana taimakawa wajen ƙididdige manyan polynomials masu rikitarwa.
2. Kimantawar Polynomial:
Ta amfani da sauran ka'idar, za mu iya kimanta ƙimar polynomial cikin sauri a wani wuri ba tare da yin dogon rabawa ba.
3. Tsarin Ragewa:
A cikin ka'idar lamba da algorithms, ana amfani da sauran ka'idar don samun ragowar cikin sauri, wanda ke da amfani a cikin ragewa da lissafin da suka haɗa da lambobi masu yawa.
4. Gwajin Tushen:
Ana amfani da wannan ka'idar wajen gwada tushen polynomials, wanda shine tushen algorithms na lambobi da dama a cikin lissafin kimiyya.
Ka'idar Sauran Sinanci
Baya ga sauran ka'idar da ke cikin mahallin polynomials, akwai kuma "Ka'idar Sauran Sinanci" wadda ke da fa'ida sosai a cikin ka'idar lambobi.
A ce muna da wasu daidaiton daidaito:
\[ x \equiv a_1 \ (\text{mod} \n_1) \]
\[ x \equiv a_2 \ (\text{mod} \n_2) \]
\[ \vdots \]
\[ x \equiv a_k \ (\text{mod} \n_k) \]
Inda \(n_1, n_2, \ldots, n_k \) lambobi ne guda biyu masu kwafi biyu (lambobi biyu waɗanda ba su da abubuwan da suka zama ruwan dare banda 1), Ka'idar Sauran Sinawa ta tabbatar da wanzuwar wani mafita na musamman modulo \(N \), inda \(N \) samfurin \(n_1, n_2, \ldots, n_k \).
Misalan Amfani da Ka'idar Sauran Sinanci
A ce muna da tsarin daidaitawa mai zuwa:
\[ x \equiv 2 \ (\text{mod} \ 3) \]
\[ x \equiv 3 \ (\text{mod} \ 5) \]
\[ x \equiv 2 \ (\text{mod} \ 7) \]
Muna buƙatar nemo ƙimar x wadda ta cika dukkan waɗannan daidaito. Tunda 3, 5, da 7 sune coprime, zamu iya amfani da Ka'idar Sauran Sinanci.
Mataki na farko shine a lissafta \( N \):
\[ N = sau 3 sau 5 sau 7 = 105 \]
Mataki na biyu shine a lissafa \( N_i \) ga kowane module:
\[ N_1 = \frac{N}{3} = 35 \]
\[ N_2 = \frac{N}{5} = 21 \]
\[ N_3 = \frac{N}{7} = 15 \]
Mataki na uku shine a nemo juyi mai yawa na \( N_i \) modulo module ɗin da ya dace:
\[ 35x \equiv 1 \ (\text{mod} \ 3) \yana nufin x = 2 \]
\[ 21x \equiv 1 \ (\text{mod} \ 5) \yana nufin x = 1 \]
\[ 15x \equiv 1 \ (\text{mod} \ 7) \yana nufin x = 1 \]
Sai a haɗa duka:
\[ x = a_1N_1x_1 + a_2N_2x_2 + a_3N_3x_3 \]
\[ x = 2 \cdot 35 \cdot 2 + 3 \cdot 21 \cdot 1 + 2 \cdot 15 \cdot 1 \]
\[ x = 140 + 63 + 30 = 233 \]
A ƙarshe, muna ɗaukar modulo N:
\[ x \equiv 233 \ (\text{mod} \ 105) \]
\[ x = 233 – 2 \cdot 105 \]
\[x = 23 \]
Don haka mafita ga tsarin daidaitawa shine \( x = 23 \).
Kammalawa
Sauran ka'idar kayan aiki ne mai ƙarfi da amfani a cikin ka'idar aljabra da lambobi. Da kyakkyawar fahimta, tana iya hanzarta lissafin rikitarwa da kuma share hanyar ƙarin bincike a cikin lissafi. Aikace-aikacenta sun haɗa da kimanta polynomial, factorization, algorithms na lamba, da kuma warware tsarin daidaitawa, kamar yadda aka gani a cikin Ka'idar Remainder ta China. Ta hanyar nazarin wannan ka'idar, za mu iya inganta ikonmu na magance matsalolin lissafi daban-daban cikin inganci da inganci.
