Підтримка
www.wikidata.uk-ua.nina.az
V algebri dilennya mnogochleniv stovpchikom algoritm dilennya mnogochlena f x displaystyle f x na mnogochlen g x displaystyle g x stepin yakogo menshe abo dorivnyuye stepenyu mnogochlena f x displaystyle f x Algoritm yavlyaye soboyu uzagalnenu formu dilennya chisel stovpchikom legko realizuyetsya vruchnu Dlya bud yakih mnogochleniv f x displaystyle f x ta g x displaystyle g x g x 0 displaystyle g x neq 0 isnuyut yedini polinomi q x displaystyle q x ta r x displaystyle r x taki sho f x g x q x r x g x displaystyle frac f x g x q x frac r x g x prichomu r x displaystyle r x maye nizhchu stupin nizh g x displaystyle g x Metoyu algoritmu dilennya mnogochleniv v stovpchik ye znahodzhennya chastki q x displaystyle q x i ostachi r x displaystyle r x dlya zadanih dilenogo f x displaystyle f x ta nenulovogo dilnika g x displaystyle g x Dilennya mnogochleniv u stovpchikDiliti mnogochleni v stovpchik mozhna algoritmom analogichnim do togo yak dilyatsya naturalni chisla Spochatku treba pereviriti chi obidva mnogochleni vporyadkovani za spadnimi stepenyami tiyeyi samoyi zminnoyi yaksho ni to vporyadkuvati yih dopisuyuchi takozh ti chleni yakih nemaye napriklad zamist 1 x 3 displaystyle 1 x 3 pisatimetsya x 3 0 x 2 1 displaystyle x 3 0x 2 1 Pidgotuvati mnogochleni do dilennya Podiliti najstarshij chlen dilenogo na najstarshij chlen dilnika Pomnozhiti otrimanij odnochlen na dilnik Vidnyati otrimanij mnogochlen vid dilenogo Prodovzhuvati tak samo poki ne otrimayemo nul abo mnogochlen zi stepenem menshim za stepin dilnika Ce i ye ostacha danogo dilennya PrikladPokazhemo sho x 3 12 x 2 42 x 3 x 2 9 x 27 123 x 3 displaystyle frac x 3 12x 2 42 x 3 x 2 9x 27 frac 123 x 3 Chastka i ostacha vid dilennya mozhut buti znajdeni pri vikonanni nastupnih krokiv 1 Dilimo pershij element dilenogo na starshij element dilnika roztashovuyemo rezultat pid risoyu x 3 x x 2 displaystyle left x 3 x x 2 right x 3 12 x 2 0 x 42 x 3 x 2 displaystyle begin matrix x 3 12x 2 0x 42 underline vert x 3 qquad qquad qquad quad vert x 2 end matrix 2 Mnozhimo dilnik na otrimanij vishe rezultat dilennya na pershij element chastki Zapisuyemo rezultat pid pershimi dvoma elementami dilenogo x 2 x 3 x 3 3 x 2 displaystyle left x 2 cdot left x 3 right x 3 3x 2 right x 3 12 x 2 0 x 42 x 3 x 3 3 x 2 x 2 displaystyle begin matrix x 3 12x 2 0x 42 underline vert x 3 x 3 3x 2 qquad qquad vert x 2 quad end matrix 3 Vidnimayemo otrimanij pislya mnozhennya mnogochlen vid dilenogo zapisuyemo rezultat pid riskoyu x 3 12 x 2 0 x 42 x 3 3 x 2 9 x 2 0 x 42 displaystyle left x 3 12x 2 0x 42 left x 3 3x 2 right 9x 2 0x 42 right x 3 12 x 2 0 x 42 x 3 x 3 3 x 2 x 2 9 x 2 0 x 42 displaystyle begin matrix x 3 12x 2 0x 42 underline vert x 3 underline x 3 3x 2 qquad qquad vert x 2 quad 9x 2 0x 42 end matrix 4 Povtoryuyemo poperedni 3 kroki vikoristovuyuchi yak dilene mnogochlen zapisanij pid riskoyu x 3 12 x 2 0 x 42 x 3 x 3 3 x 2 x 2 9 x 9 x 2 0 x 42 9 x 2 27 x 27 x 42 displaystyle begin matrix x 3 12x 2 0x 42 vert x 3 quad underline x 3 3x 2 qquad qquad overline vert x 2 9x 9x 2 0x 42 quad underline 9x 2 27x qquad quad quad 27x 42 end matrix 5 Povtoryuyemo krok 4 x 3 12 x 2 0 x 42 x 3 x 3 3 x 2 x 2 9 x 27 9 x 2 0 x 42 9 x 2 27 x 27 x 42 27 x 81 123 displaystyle begin matrix x 3 12x 2 0x 42 vert x 3 qquad quad underline x 3 3x 2 qquad qquad overline vert x 2 9x 27 9x 2 0x 42 qquad quad underline 9x 2 27x qquad qquad quad 27x 42 quad underline 27x 81 quad quad 123 end matrix 6 Kinec algoritmu Takim chinom mnogochlen q x x 2 9 x 27 displaystyle q x x 2 9x 27 chastka vid dilennya a r x 123 displaystyle r x 123 ostacha Div takozhTeorema Bezu Pravilo Ruffini Evklidove kilceDzherelaMnogochleny 2 e Moskva MCNMO 2001 336 s ISBN 5 94057 077 1 ros
Топ