Logarithm TheoremPythagorean TheoremCombinatoricsQuadratic EquationsSequence and SeriesLinear AlgebraDiophantine EquationElliptic Curve FactorMultiplication, DivisionIndicesHighest Common Factor, Lower Common MultipleEquationsQuadratic EquationsSimultaneous EquationsRatio and ProportionArithemetical ProgressionGeometrical ProgressionHarmonical ProgressionPermutations, CombinationsSurdsBinomial TheoremMultinomial TheoremLogarithmExponential TheoremContinued Fractions and Convergents Draft for Information Only
ContentAlgebra
o
AlgebraIndeterminate EquationsEquation ππ₯+ππ¦=πGiven ππ₯+ππ¦=π free from fractions, and πΌ, π½ integral values of π₯ and π¦ which satisfy the equation, the complete integral solution is given byπ₯=πΌβππ‘
π¦=π½+ππ‘
where π‘ is any integer.188
ExamplesGiven 5π₯+3π¦=112 Then π₯=20, π¦=4 are values; β΄}The values of π₯ and π¦ may be exhibited as under: π‘β2β101234567 π₯262320171411852β1 π¦β6β149141924293439 For solutions in positive integers t must lie between 203=6 23and β 45; that is, t must be 0, 1, 2, 3, 4, 5, or 6, giving 7 positive integral solutions. Equation ππ₯βππ¦=πIf the equation be ππ₯βππ¦=π the solutions are given byπ₯=πΌ+ππ‘
π¦=π½+ππ‘
189
Examples4π₯β3π¦=19 Here π₯=10, π¦=7 satisfy the equation; β΄}furnish all the solutions. The simultaneous values of π‘, π₯, and π¦ will be as follows: π‘β5β4β3β2β10123 π₯β5β214710131619 π¦β13β9β5β137111519 The number of positive integral solutions is infinite, and the least positive integral values of π₯ and π¦ are given by the limiting value of π‘, viz., π‘>β 103and π‘>β 74; that is, π‘ must be β1, 0, 1, 2, 3, or greater. If Two Values cannot readily be found by InspectionIf two values, πΌ and π½, cannot readily be found by inspection, as, for example, in the equation 17π₯+13π¦=14900, divide by the least coefficient, and equate the remaining fractions to t, an integer; thus π¦+π₯+4π₯13=1146+ 2131 β΄4π₯β2=13π‘ Repeat the process; thus π₯β 24=3π‘+ π‘4, β΄ π‘+2=4π Put π=1, β΄ π‘=2, π₯= 13π‘+24=7=πΌ and π¦+π₯+π‘=1146, by [1] β΄ π¦=1146-7-2=1137=π½ The general solution will be π₯=7-13π‘ π¦=1137+17π‘ Or, changing the sign of π‘ for convenience, π₯=7+13π‘ π¦=1137-17π‘ Here the number of solutions in positive integers is equal to the number of integers lying between - 713and 113717or - 713and 66 1517; that is, 67 190 Otherwise Two Values may be foundOtherwise. Two values of π₯ and π¦ may be found in the following manner: Find the nearest converging fraction to1713by (160). This is 43. By (164), 17Γ3-13Γ4=-1 Multiple by 14900, and change the signs; β΄ 17(-44700)+13(59600)=14900; which shews that we may take { πΌ=-44700π½=59600and the general solution may be written π₯=-44700+13π‘ π¦=59600-17π‘ This method has the disadvantage of producing high values of πΌ and π½. 191 Arithmetic ProgressionsThe values of π₯ and π¦, in positive integers, which satisfy the equation ππ₯Β±ππ¦=π, form two Arithmetic Progressions, of which π and π are respectively the common differences. See examples (188) and (189). 192 Abbreviation of the method in (169). Example: 11π₯-18π¦=63 Put π₯=9π§, and divide by 9; then proceed as before.193To obtain Integral Solutions of ππ₯+ππ¦+ππ§=πWrite the equation thus ππ₯+ππ¦=π-ππ§ Put successive integers for π§, and solve for π₯, π¦ in each case. 194To Reduce a Quadratic Surd to a Continued FractionExampleβ29=5+β29-5=5+4β29+5 β29+54=2+ β29-34=2+ 4β29+3 β29+35=1+ β29-25=1+ 5β29+2 β29+25=1+ β29-35=1+ 4β29+3 β29+34=2+ β29-54=2+ 1β29+5β29+5=10+β29-5=10+ 4β29+5The quotients 5, 2, 1, 1, 2, 10 are the greatest integers contained in the quantities in the first column. The quotients now recur, an the surd β29 is equivalent to the continued fraction. 5+ 51, 112, 163, 275, 7013, 727135, 1524283, 2251418, 3775701, 98011820195 Note that the last quotient 10 is the greatest and twice the first, that the second is the first of the recurring ones, and that the recurring quotients, excluding the last, consist of pairs of equal terms, quotients equi-distant from the first and last being equal. These properties are universal. (See 204-210).196 To Form High Convergents RapidlySuppose π the number of recurring quotients, or any multiple of that number, and let the πth convergent to βπ be represented by πΉπ; then the 2πth convergent is given by the formula πΉ2π=12 πΉπ+by (203) and (210).197 For example, in approximating to β29 above, there are five recurring quotient. Take π=2Γ5=10; therefore, by πΉ20= 12 πΉ10+πΉ10= 98011820, the 10th convergent. Therefore, πΉ20= 12 = 19211920135675640the 20th convergent to β29; and the labour of calculating the intervening convergents is saved.198 General TheoryThe process of (174) may be exhibited as follow:
199
Then
βπ= π1 + 1π2+ 1π3+ 1π4+ β―The quotients π1, π2, π3, β― are the integral parts of the fractions on the left.200 The equations connecting the remaining quantities are : π1=0π1=1
π2=π1π1βπ1π2= 201
The πth convergent to βπ will be
ππππ= ππππβ1+ππβ2ππππβ1+ππβ2By Induction202 The true value of βπ is what this becomes when we substitute for ππ the complete quotient βπ+ππππ, of which ππ is only the integral part. This gives βπ= (βπ+ππ)ππβ1+ππππβ2(βπ+ππ)ππβ1+ππππβ2203 By the relations (199) to (203) the following theorems are demonstratd: All the quantities π, π, and π are positive integers. 204 The greatest π is π2, and π2=π1.205 No π or π can be greater than 2π1206 If ππ=1, then ππ=π1.207 For all values of π greater than 1, πβππ is<ππ.208 The number of quotients cannot be greater than 2π βπ+π2π2, and π2, π2, π2 commence each cycle of repeated terms.209 Let ππ, ππ, ππ be the last terms of the first cycle then ππβ1, ππβ1, ππβ1 are respectively equal to π2, π2, π2; ππβ2, ππβ2, ππβ2 are equal to π3, π3, π3, and so on.210 Sources and Referenceshttps://archive.org/details/synopsis-of-elementary-results-in-pure-and-applied-mathematics-pdfdriveΒ©sideway ID: 210600015 Last Updated: 6/15/2021 Revision: 0 Ref: References
Latest Updated Links
|
Home 5 Business Management HBR 3 Information Recreation Hobbies 8 Culture Chinese 1097 English 339 Travel 9 Reference 79 Computer Hardware 251 Software Application 213 Digitization 32 Latex 52 Manim 205 KB 1 Numeric 19 Programming Web 289 Unicode 504 HTML 66 CSS 65 SVG 46 ASP.NET 270 OS 431 DeskTop 7 Python 72 Knowledge Mathematics Formulas 8 Set 1 Logic 1 Algebra 84 Number Theory 206 Trigonometry 31 Geometry 34 Calculus 67 Engineering Tables 8 Mechanical Rigid Bodies Statics 92 Dynamics 37 Fluid 5 Control Acoustics 19 Natural Sciences Matter 1 Electric 27 Biology 1 |
Copyright © 2000-2025 Sideway . All rights reserved Disclaimers last modified on 06 September 2019