Scribd Logo
Upload

Welcome to Scribd!

  • CFRusCmbntlArthmtc PDF

    Uploaded by

    Mathew Love
    16 views16 pages

    Original Title

    CFRusCmbntlArthmtc.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    16 views16 pages

    CFRusCmbntlArthmtc PDF

    Uploaded by

    Mathew Love

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 16
    SOM 5 INATIOONATL LT HME TIS e_F, RUSSELL Loe Ancolos 1948 HARVARD UNIVERSITY LIBRARY Copyright, 1944, by Gc. F, RUSSELL First Edition coureurs Introduction . 4p ee eee ee ee eee ed Definition . 6 ee ee ee ee ee ee ee ED How to calculate the number of combinations ITI Combinations as pelysramp ., .. 1. 6 ea 4 IV Polyerans in consecutive sequence... ... ¥ How to calculate the # of any polygram 4. V1 The Plus-One Algorithm applied to comba.. . VII The Direct Method to get the # of a comb, ,VIII The Quick Way to enumerate any combination 1% To find the comb, when its # ta given. 2... X AGULION Sw ee ee ee eee ee Subtraction see eee ee eee ee ee HIT Multiplication . 6 eee ee ee ee ey » RTE Divisions see ee eee ee ee ee WV Equere Root ee ee ee ee te ee ee Qube Root sw we ee ee ee ee MT Concerning Decimals +e eee ee ee ee eXVIT Test Problems- with Answers... 6... XVIII Beginning of a useful tabulation. .... XIX Gonclusion » 6 eee ee eee ee KH Tllustrations . . 6 6 ee ee ee ee (iv) & 12 (is) Major Paramwetar see z= i F 2 atx of ei z Tes DICHOTOMY +t = sey = TT Hes Le jij} 1 i nay HT rT | 7 9 Yt j2z : “TF Lt i 2, [ ri CTP. ia t_[E i i Ti 38 | ay ri Tt 23h t i i pit pole : ror Tose | ACCT loL bt Lt i T +7 ! i | i 2a, ‘| pe t é i { 128 I c | ve j jolt it rT mica eye Ed TT 234 LISA TT EE qea4 pakos 66 77 77 6888 88 a8 miaor 66 566 TT TT eee uajor Fareasict *§ é SoNSEGUTI VELY. COMBINATIONAL ARITHMETIC I, INTROPUSTION - in earlier books we have presented the al- gorithme of Permutations, euch os the Plus-One aleorithn, the method of finding the number of a given pers, with 1ts re- verse which finds the perz corresponding to @ given number,In Book PIH, ss part of the analysis of point-sets in different @inensions we introduced Combinations, as ascribed to pointe of figures up to tne sixth dimension, Here, in this new book we shell study Combinations in sonerai, applying to fisures of all dimensions, 4 pet forth, for the first time the algorithms for perforaing all the operations of Arithmetic by means of combinations, Thus we ehall show how to determine the number of any particular combination, of any size or degree & con- versely, to discover its combination when there ie given any number of any magnitude, integral, fractional, or mixed, Then we efall explain how to-do addition, subtraction, tuliiplicat- jon, division, & extract roots, uaing combinations instead of thelr correspending numbers ag in somacn arithmetic. li, DEFINITION = Let N etand for any number of things, wlements, or points (#8); then we can select frou N a number, T, in various ways, euch that the value of T may = N, or any number lesa than N, or zero (0). Thon, N minus T, Net, may = 0,2, 2, ~ + + ete, up to N Ee., if No4, thon T may = 4, 3, 2, lor 6 & NaT cay =, respectively, 0, 1, 2, 3, oF ta Now, we can count the points of any eet,aseribing some number to that set euch thet the integers from i to N have a one-cne corresponience with the several #s of the set; thus,ir wo have a 4-# set (a5,e.8, with the cornere of a aquare), ite constituent #e may be called #1, #2, #3, #4. In the stuay of Permitationa we observe a variable aecript= ton of counters or digits, such that the N dicits, (from 1 to N), \ aay be applied to the #a of an N-# sot in Ni (N-Lactortal = 1x2x3x...X) different ways constivuting the Ri possible permutations of N #a, taken all at a time. But in the study of Combinstions we have the aecription invariable, such that the N digits may be applied to the N#s in only one way. Thus, while we cen have 1x 2x 5x 4 = 24 different permutations of 4 $e, we cam have only one combination of 4 #e if we take them all at one tims, Taking less than all we can get more than the one com bination, according to how many (I) we choose, sxcept when T=0, in which case we get alse but one combination, EVERY SET, OF T #s EACH, TAKEN FROM N #e,4ITH NO ATTENTION PAIS TO THE ORDER CF THE #a IN THE SET, 18 CALLED A COMBINATION FROM THE N #e. Thus, when N = 3, the auaber of #s is 3 - viz~ #1, #2,#3, & the possible combinations,in this instance, are eight, viz - 0, 1, 2, 12, 3, 13, 23, & 123, Mote that the combinations, 13 & 31, are identical,therefere we include but one of them in an exhauetive inventory; aimilarly, while 123,ltselr, can have six different permtations,1.¢.+ 123, 132, 213, 231, 312, 32h, all these efx are the same oné combination, 1.6.5 123. 2 Combinational Arithmetic For uniformity we shall usually write the terms of a combination in ascenting numerical sequence, without invere= tons, the lower number or digit preceding the higher, but if inversions should occur in our calculations they are not to de counted ag combinations differont from the number one permutation in the given case. III = HOW TO CALCULATE THE NUMBER CF COMBINATIONS POSSIBLE = The student should be familiar with thie frow ordinary arithmetic or algebra. Given Nas the number of things, T ap the number chosen from f, (2 as the factorial sign}, & C as the number of possible cogbinations of N #8 waken T at a tims, then, C = NL Suppose Ne5 é T=3,meaning we are choos- TYTN ST): ing fa froa a Sf sot, 5 nt a tiae,viae making 3-# sete outof a 5-# set, then, the application of the formila becomes + 5} a5xAx3x 2x1 _ 120_ stem: (Sx 2 x ijxte x 1)= te = 3 In practice, this can be simplified by carrying the numerator down only to T terma,while we carry the Genominstor up from 2 to 7, thus, sg. - 2x 4x3 _ 60 _ 45 This shows how to get the number of Lx2x3 = 6 > "+ combinations possible from any number of things taken any particular nuzbor st a tine. Now, to find the total number of possible combinations froa N #5 when T aay vary throughout ite range, the formule is found by adding together the values of 0 for all the values of 7, Thus, if N= 4, then T ney = 0, 1, 2, 3, &/or 4 & S, or the sua of all the combs. = C(Not,720)-0 (Nok, Tal}+O(Nob, T=) + O(No4, 753) + C(NoA,TO4) = ie 4-+ 6's & 4 1 = 16, or the aun of the coefficients in the expansion of (1 +1) to the Ath power ty the binozial theorem, wich is the same aa the ex- pension of 2 to the 4th power, Consequently, the forma for the total number of combinations trom N #a = oNth power.i.e.; let N= 7, then the total comba, = 27= 2x2x2xSx2x2x2 = 128, Here we diffor slightly from the reault taught 1n comon arithnetie or algebra, which neglects the combination where T =0; for, neglecting the combinstion where we take them one at a time, the formula for the total number is gM y, Our cwn work 1a of the utnost generality, hence we must te clude the value, T= 0, IV = COMBINATIONS AS POLYGRAMS - Now, we begin tc advance be- yond crainsry arithaetic & algebra & continue the invest- gations already originated in previous works of cure puch a6 Book PIH, T&-KHU, NoW, TROPERMIC CALCULUS, GRAMMAR OF CHANGES, etc. A polysram is a figure made up of grame,or atraight linos (unbroken & broken)piaced,one above the other, each srammic place,called a principal, representing a dimension of the geo- Rettroal figure of which the polygram,itself, stands for one point. when the geometrical figure is of the second degree, 4. ®., has two pol.s or aides in eech dimension, then, each gram muat have two forms,so that either pole or side aay be ade- quately represented, These two forus,in this cass, are called, respectively, YANG ) & YIN (_ —), algo expressed by the numberail & 2, We can have figures of any number of aimen- sions, so we can have polygrama of any number of prificipals. Consequently. (this beck considers only 2n4 degree polygrams), any polygram (in this beck) congiets of a heap of yange &/or wee ano Combinational Arithnetic 3 yins, or a series of the numbers, 1,2, etc, a8,e g..the nus ber 3, 1s represented by the Digram, —., or 12, tf we read up & 21, if we read down, The principals of @ polygram are ordered & counted from the boftom up, thus the first principal 1p representod by the bottom gram, the - Becomd by the one immediately above it & so on, Now, since only yongo & yins, or 1’s & 2's will occupy our attention in this connection, any polygram can be unique- ly represented simply by numbering ite principals which are yine & omitting the numbera of those principale which are filled with yange, Thue the above digran ‘zs © yin in the 2nd principal,hence can be uniquely represented by the nucber 2, whereaa tho following Trisram, — — , which has yins in all threa principal places can De uniquely represent od by the series of numbers,123. The tetragram, 1212, which 19 #11,can be adequately expressed by the combination of numbers 24, since ita 2nd & Jon principale are occupied by ying & it isto be understood that the principals not mentioned are filled with yangs, Similarly, any combinasion, of digits or nuabere, no two of which sre alike, stands uniquely for sane =~ polygran (of the second cesree) & any polygram of any nunber of principsla (2nd deg.} can be uniquely expressed-by some oe combination of numbers, Vi « POLYGRAMS 4/OR COMBINATIONS IN CONSECUTIVE SEQUENGE - The array of pointe which make up a geometrical figure, a8,¢,.g,, @ cube, tetrahedron, tetrak, etc, have a one-one corresponience with a set of polygrats, each # ascribed to = different polygram. We can arrange the #e in consecutive se~ quence, as 1, 2, 3, 4.,, similarly, with their polygrams,or combinations, This consecutive sequence has definite characte eristica auch that xe can construct 1t without considering specifically the ascrived numbers. This 1s done empirically vy a method of euccesaive dichotomy froa the highest principal down. L 2 The first # hae a yang(1) in ‘ 1 204 2 each principal ,rogardlesa of (Index) 1 22 22 2 1 2 the number of dimensions & ro. . el el 2121 21 21 2 4s ,here, 1111; the #2 changes wenden the first principal to a yin(2) pg Li211L 12 1222 22 22 2 & te thus(reading up) 2117 or Li l2 22 2111 12 22 #3 has e yin in the 2nd prine la 222 2112 2112 2112 2 cipal onty & hence te 1241 & ym 222 21 21 212i 21 21 2 the rensining #e have yins in se ~ the principgl or principals where you soe a 2; 6.g. the 12th, = #12, = 2212,(reading up). Study of this system reveals that in the first principal, the sex of the grams alternates, cr changes "one at a tine"= viz - 12.12 12 12, ste, Thus in a series of numbers consecutively, the odd nucbers ali begin with a yang & the evens with a yin. In the 2nd principal they(yange & yins}alternate by two's or two at a time,thus- 11 22 12 22 11 & ao on, In the 3rd principal they alternate by foura, or four at a time, thue - 1111 2222, In the 4th, they alternate by eights, as 111111)1 22222222, 0tc. In the Sth, thoy alternate by aixtesns, 1211111211111111 Beeez2ezavee2222, etc; in the 6th by thirty-twos & Bo ony as far as you may wish té carry it, Let the principal in order be wemntn 4 Conbinational Arithmetic represented by F, then the alternation formula = 2°"; t.o., if we raise 2 to the (P-1)th power we shall have the number of grans of one sex to put together to alternate with the saze number of the opposite sex in the F principal. Empirice ally, then, wea construct a consecutive sequence of polygrens & deternine the ordinal nuaber of each polygran or combinst- ton by using the above described scheme of dichotoay, VI - HOW TO CALCULATE THE # OF ANY POLYGRAH. There are many ways to Go this. There is, o.g., the tabular method,in which they are arrayed consecutively in coluans of a table, each particular polysrem (or particle)located at the junction of a major(file)row & a minor(rank)row, Such a table ig in- dexed by margina, acrose the top (or bottom) & down the sige (right or left), having a separate or individual index for each row, vertical or horizontal & the series of individual indices (major, or minor) is called a parameter. In such a table the total number or sum of particles tabulated must be a power of 2, auch, e, as 64 = 56th power, Then the number cf aajor rows, ap well as that of the minor rowa will also (must aleo) be a power of 2, auch that the sum of the major power plus the minor power = the total power; the distribut— ion may be any auch ag to fulfil this ruloje.g. with a table of 64 particles we aay have 25= 52 major rowe with pl= 2 minora; or wo may have ot. 16°majore with 92-4 1 nogei OF 3 majors with ,3 minoré; eta, Then, to ring the of any particle in the"table, giver ite major (or Mth row) & its Rinor(or mth row), 51 ST 1 OM THE MAJOR, MULTIPLY THE REMAINOER SY THE NUME: OF MINORS IN BACH MAJOR OF 1: TABLE, & ao TO THIS PRODUCT THS NUMZaR OF THE MINOR ROW WHICH GONe TALNS THE PARTICLE. Thus, the formula = (M-i)x the number of minor rows in the table, + a, To illustrate, with @ 64 = 8x8 table: let M = 2& m= 3; then, (2-1}x 8, + 3 = #11. Suppose we should redletribute the rows so as to ‘ave 64 = 4 x 16, then, (with 16 majors & 4 minore),#11 = (3-1)x 4,+3;1,e, #12 ig thet particle in the 35ré major « 3rd minor, In & table of thie sert where the particles are numbered consecutively, the out LvC t1el6 alu merarcle! £ the d: L5utso rn. Major £ minor rows £ also recarilesa of the size of the table, vize total number of particles. Rhus, the polygram, or combination which 1s #li in a 4 table, ich may be of any of the accve mentioned distributions,or sone other, will also be #11 in any other sizllarly con- stricted table, auch as one containing 128 particles, or 256, or 512, or any other power of 2, This eupirical method of counting can be rationalised into a formula, by dividing the polygram which ie to be counted or enumerated inte a series of sualler polygrams, but the sle involves some ex= septional clauses & 13 too complicated to be of universal interest, hecne we skip it & proceed to explain other rules which are simpler & more Interesting, VII - THE PLUS-ONE ALGORITHM APPLIED TO CCMBINATIONS = his has been thoroughly explained in our other bocka go ve shall touch upon it here, but lightly,go ap to link up with what follows. It treate the polysram as an imprimitive_ | Combinational Arithmetic 5 permutation, We will give an example; writing from the high- est principal down ve have the polygram, say, 1121112221, a decigram, to find ite #, This will be the combinstion,2348, {where the yin places are counted up). Let ua write the combination (or polygram) as a eeries 8 of yangs & yins, across from left to right com responding to the sequence from top to bottom— 2 Bb at 2 2 A F 2h 2 2 nop | | 47 (512 256128 64 32 16 8 4 2 1) * 22 2 EPare ~~ ee Go 2 9 oo @ 1iii2ao OR x Moa = 0404124040404 8s 442405 142 We see that only those terns corresponding to “als - yin places count in asking the final sum which obtains the correct number of the polygram. Trus the product of the ord= inal remainder x the modulus,respectively, gust always be 1 - x 2 (raised to a power 1 less than the place value of the yin, counting up), Therefore, to get the # of the polysram (or ite corresponding combination), all we have to do is to obtain @ series of powers of 2 ,6um then & add 1; this serics of ex- ponents 1s obtained by subtracting 1 from the place value of each yin. Zé. (see above), here, the combination = series of yin-place values (reading up) = 234 6, from whick we sub- tract 1 (from each term) & get 1237; then the # = ate oF 4 3 + of +1 = 244+ 8 +128 +1 = #143, donse ~ quently, Ne have the forgula, called the PERMIC METHOD = SUBTRACT 1 FROM EACH TERM CF THE COMBINATION; CCNSTRUCT A SERIES OF POWERS OF 2, USING THESE REMAINDERS RESPECTIVELY, 4S THE EXPONENTS, SUM THESE POWERS (after expansion) & ADD 1, VIII = THE DIRECT “METHOD TO GET THE # OF A COMBINATION - Now, we can eliminate the operation of subtracting 1 from each exponent, if we take simply the combinational terms {place values) themselves, as the exponents, then divice the sun ty 2 before we add 1, 2.g., to get the # of the comb 134; by the Permic Method (so-called) we get = —- 64 — 3 aml, 2e-h a eel gp ade de Be 1 = AI as By the Direct Method(soscalled) we get = —-1 ale 2 eat 248416. 2 245 ee gus 2 = @ = 2 = te = ae This letter method is to be preferred to the former because it involves lesa operations, but when large numbers are ine volved, We prefer to use a Dethod even aimpler which we shall aistinguish 2s the QUICK METHOD, IX = THE QUICK METHOD OF EXUMERATING ANY CCMBIXATION - For exanple - to find the # of the comb, 45, corresponding to a polygram whose 4th & 5th placea are filled with yins, the remaining places being cecupled, all, with yange:11122, 6 Combinational arithnetic 5 4 Now, we kmow from (V) that an odd-numbered com dination must have a yang for ite firet,or bot- tom gram,consequently noe ordinal number or term for the first place & conversely, if the terz,l, does not appear in the combination, the first gran muct be a yang. This fact is the clue which leate to the discovery of the Quick Hevhod (so-called), WRITE THE COMBINATION DOWN, LEAVING SFACES FOR THE YANGS,thus~ NEXT PUT 1 OPPOSITE THE FINAL PLACE(bottoa), then, 24 . for the next place above aultiply the occupant of wz. the immediately lower place by 2,but if a yin,t.e. 6. a term,cccupies this place add 1 to your doublins if the piace is unoccupied,thst ie, if a yang ie here 1 5 in the polygraz,leave the product even; then the # of the combination will be one more than ths top or final doubling. Evidently, where there are com>. terms the nusber will be odd & where they are absent 1t will de #25=24+1 sven, The lowest place will always have "1" to —— with, Teke another example: the comb, 1267, 12=6x2 vegin weit 0 = 99 +2 (the # of the combination) 6=3x2 1 19 49x2+1 (to make it odd) Balx2+1 2 49 Phx 2+1 (to make it odd) i=l + 24 = 12x 2 (oven) » 12 =6x2 {oven} , 8 33x 2 (oven) 6 3 1x2 +1 (to make it oda) L i 1 (oda) X= TO FIND THE OCMBINATION WHEN [TS ¥ 14 GIVEN - Tho formulas here will reverse the rules explained above. Ey the Puahl¢ method: subtract 1 from the #; then subtract successively the highest possible powere of 2,uhtil there is no remainger; then to the exponents of these powers used add l,respectively to get the terms of the combination required, E.g., given #14, 141-13. Ye 8 55; 4 = 1-2 =O; but 8 = p35; 4 = 32 eI .o;hence, (341), (241), (041) = 4 3.1, the comb, we By the DIRECT methods subtract 1 from the #; multiply the renaindsr by 2, then frex this product successively subtract the highest powers of 2 until there is8 no remaincer; then 18 exponents of these eubtrahends as powers of 2 are the terms of the required combination; e.g, with #14, 14-1 = 13, x 2 = 26 By the QUICK method: subtract 1 from the #, (4) 16 (144 — 1 =13); then divide auccessively by 2, disre- 10 garding the romaindera,coneidering only the succese- (3) _8 ive quotients; count them down, if they are odd,num %@ a ber the place (counting down), if even {1)_2 QQ) omit to mumber; thus,8.g» we do Mot count t 8 crewen--- 6, here,because it is an even number, Take an “3 &) other exemple, #63, (63 - 1) = 62, then divide aa (4) guccegaively by 2, getting - 31 (2), the first place (62) is even, so we 15 (3) do not count it, the remaining places are all odd, T (4) ao we ascribe their ordinals as places to them, 3 (5) getting as the required combimtion - 23 45 6 1 (6 ‘The student should work out several more examples by-al) three mthode so as thoroughly to understand them, ~ Combinational Arithmetic 7 XI - ADDITION - Raving learned how to resolve a combination inte ite number & conversely, the next operation 1a to acd combinations & get a combination wiose corresponding # will De the cum of the numbers which correapond to the combs added. E.g., #8 + #15 = #23, But #8 = comb 125 & #25 = 234; wherens #23 = 235; hence 123 + 234 = 235, The problem thes ie to find an algorithm which takea the two combs,123 & 234 & by some legitinate process,transforzs them inte 235 & Will work generally. This procesa can be discovered by re~ ducing the combs, (Using the direct aetho?) thus == #2 = gs os 2 was = 22 + 23 4 24 z +1 2 +1 hence #23 = 2. 22. 2 4 da ate 2 se sched 5 , Therefore, aince this 2 sun ts in the same fora as tho addends, it must correspond to the combinetion - 1232341, which pute the two addends together as one combination with the addition of the extra term, 1. Thies then conetitutes the method of addition, But in order that we may” avoid having duplicate terms we must invent a method of re= ducing the resuit, This is done by considering that Since the terns represent powers of 2 & whereas any two identical powers of 2 added together = a power Just one higher, two 2's make a 3, two 3's make a 4 & 20 on, Thie systex of combining dupli- gate powera or terme of the comb Ja called REDUCTION. Then, 4a the example above, 1232341 we say = 14 1 is 2, & 248 3, &3 io 4, & 418 5, This leaves, then 2 4 3 which are not dup- ligated which with the 5 make 235, the required sum, (Q.E.D. The rule, then = WRITE Dodi THE COMBINATIONS TO SE ADDED: PUT DOdN WITH THEM ALSO(tho term) 4, FOR EACH COMB 70 BE ADDED, =x- CEPT THE LAST ONE, THEN "REDUCE WHAT YOU HAVE TO GET RID CF DUPLICATES & THE FIKAL AZSULT 18 THE SUM REQUIRED AS ONE COMB, E.ge- to find the eum of #2 + #3 + #5; the combs are 1,2, 3; go their gum will be 112 22 3 {as one comb). Reduce this = "1 gl is 2, 424183, 4 348 4; leaving 14 the anower = #10, ELI - SUSTRACTION ~ Rule - WRITE THE COMES WITH A PLUS SIGN ONT, MINUEND & 4 NUS ON THE SUSTRAHEND, PUTTING AN SXTRA "1" IN THE SUBTRAHEND; THEN REDUCE, SUBTRACTING CR CANCEL- TKG WHERE POSSISLE ; thus, if a b is the ainuend & x y, the sub- trehend, then the recaindar = +a +b-2x-=-y - 1, 58 one comb, E.G, = #67 (= comb 27) = #22 (135) = #45 (346), thus — +27 Here, in the subtrahend, 14 1 to 2,whieh can- =i352 cele the 2 of the minuend, leaving + 7 How, since 7 = 66 & 66 = 555, we can cancel the -35 5 below & the 5,now, above, leaving = +65 , but,since 5 = 433, 5 from 435 = 43; hence the final remsinier will be 34 8 34 6, Again, to sub- tract the comb 1 from the comb 4,e.g., we have +4 = 11 (or 2), then 2 from 4 = 23, Proofrl = #2, 4 = #9; 9-2-#7= 23, the comb, In all this we give examples to clarify the miles; the student should invent & work out many more for practice, a Combinational Arithastic KLII ~ MULTIPLICATION + Huler- Set down the two factors as combs; add sach term of the multiplier to each tera of the miltiplicand,arithmetically,& subtract one from each sum,putting the rezeinters each in the product ae terms of one combination, to which as further terms of the same cont add gil the terme of both factors individualiy} then reduce fhe result. Example:- Comco- 123 x 245; whee #8 x #27 =r216 = comb, 123578. B45 nultiplicand XL multiplie (Piret Operation) (1=2-1) (lrte1) (+s-1)= (2x Fy (2e8e1) (245-1) (BH (Sebel) (345-1) (Second Operation) 5 Then reduce as follows: 2. 3. 24248 3,%3 184,44 ip 5,4 5 ts 6, & 37, & 7 18 8 545166, 46 te (7; 44 4 is 5; leaving L225 75. XIV - DIVISION - Rule:- Set down the divisor & the dividend as in love diviaion of ordinary erithmetic; then es- timate each term of the quotient {or partial quotient) ,euck that the hoghest term of the divisor minus 1 ehil be not more than the bichest tera of the divicend; then multip}y the quot jent term tices the divisor & subtregt the product from the Givigend; but in this multiplication Dring down the duplts; of the whole divisor only the firet time; after that bring down the duplicate of only the partial quotient; thue the re~ quirement that in a product the duplicates of both factors Shall be put in the product shall be fulfilled by putting the terms of the divisor down all at once & of the quotient a term at a tino. Also, when there is a fins] remainder less than the divisor, subtract the comb tern.1, from it,before making with it a fraction,with the divisor as denominator, 78 Example: ere we take las the firat term of the 1a Fe a quotient ,although we might try 2) £ 12556 Fils i2 then 1 x 134 = 134 134 1, whaen re~ wz T34T duces to 1245,which fron 12356 = B45. 345; then the next partial quotient x 2342 12h) the divisor = 134 1, for we co not ee bring down 134 the second tine; ther this 41 reduces to 234 & from 345 = 234; then, the last partial quotient brings down ancther 1341, which = 234 & leaves no reasinder, The 111 reduces to 12, the answer,which is the comb. of #4. EXAMPLEC OF DIVISION WHERE THERE IS A REMAINDER — gaz f F382 2002/1 * 153 1023/1; 213579 78 25 Tes as 25 2 Y= sf Gombinational Arithmetic 9 XV ~ SQUARE ROOT - Example - te_get the og. rt of #529 = the comb, 5 10 V5 107235 = #23 as (comb) 2x 2 = _4 3 23-5 4T5 x2s 23- Here wo try 4 € 224 Beat 2 es the first “EF 88 -45 7 ~67 tera of the =343 Toot, then squeré it (2x 2) for = t+ S74 9 ‘the first trial product; next we try 32 pet down the result of squaring 2 3, but minus the product of 2x 2; finally we have 23 5 to square, but Betting down onl 3 up 23 x 235 aren fe 7 40 12.13 1618 4 = ang x =335 2. : 3 x _HALS Bet x Be4 = BKB 7 oO AO 12 13 16 18 =H17O569 © B67 4 & 6 6-9 12 33 16 18 Ao5 x BAD - 34x34 aT STB EES 2 940 a1 43 16 18 BaS = 234/14, for 14.='#10, viz ~ #1,5 = 0-3/14, the comb, To get the sqrt. of #2 to two decimal places,using combs,then, tte Goabinational Arithnotic ve should multiply the comb for #2 which =1, by the comb for #10000 = 12 5 4910 11 14, then get the sq.rt. of the product which 18 1 234510 11 12 15, which would be 3.48 +, dee, #1.41 + carrying 1t to but two decimal points; or we would better multipay #2 by #10,000 getting #20,000; find the comb of that & extract its eq.rt,polnt off properly & bave the same reault. Similarly with other roots & all cociaala. EST PROBLEMS ~ WITH ANSWERS = Answer, NUMERATION » What ie the comb. which = #64? 123456, #2094 = 13 7 11 (Work it out by all three methods; #2,000,000 = 2.4 5 6 10 15 17 18 19 26. (Prove it, The comb, 12,67 = #1,00, 1 235 4 9, 10 11 14 = #10,000{Prove), XVIII = ADDITION - add the following combinations:- O+l+241243 +135 4 254123 +4414 Whatia the eum of a + b (as combs)? Ans = + a b 1. (one comb,) SUBTRACTICN + Subtract the comb, 247 fron 1568: ans = 2367. Subtract b from aj anst = +a = be i, (three a) & get 235 6 MULTIPLICATION - Multiply combs, 23 x 2345 & get 3747 16, Multiply combs a + bx coubs a> b& get (those in parentheses are arithmetical not combinational sums; those not, are,each, whole combinations)-1,2,(a+2),(b+2), (a+b), (20-1), (2b-15; Oabe if a sl & d=@,then (1+2)ee a comb =.121 =3 4 142 x 142 = BxRs45 512343136 3 DIVISION - Divide the comb 7 8 12 by 1 S98 get 321-56/ 159, " 236 910 by 6 & get 1235~ 234/6, SQUARE ROOT = Get the aq.rt, of #8 to four decimal places, using combs, Ans in comb = 1234567 10, 12 12 14 15, OTHER ROOTS ~ Get the cube rt, of #144,using comb, to three decimais- ans = 456.7 11 13. Find the stn rt, of #2 to two decimals,by combs,ans=135, WR eat) Gea) (esti tard) (Bort) (3022) (3ard) (aac) (4a-3) (Sa-4)1 ans = (a). Questiont Why do we oubtract the comb i from the last remain- der to make a fraction left over, in division? (Ana~ let the student answer thia question,without prompting. ) Finally, work out the combination for the number = one none illiont answer = 1 23.4567 89 1031 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 2B 29 50 34 36 38°39 40 41 43 44 46 47 48 51 53 54.55 5e 59 63 59 71 72 75 76 77 78 79 80 81 82 83 84 85 86 87 89 91 94 95 96 100, By the direct method this ehould take about tvo hours (or more) but by the quick method it can be dons in half an hour, XIX - HOW TO BEGIN A TABULATION WHICH WILL SERVE TO FIND COMBINATI“NS CORRESPONDING TO fa WHICH ARE INTEGRAL POWERS OF #20, Here, (see next page) the numbers in paren- theses are terms of the combination for the power of #10 reading across the top parameter ending at the coluan just. preceding the given combination read down the column, Combinational Arithmetic n #10 ° o 0 9@) ¢Q)9Q)90 9 (1) 9 (2) 9 (2) 9 4 9 (2) 9 (2} 9 (2) 9 (2) 9 (2) 9 (2) 9 (2) 9 2 A 9 (3) 9 (3) 9 (3 9 OB 2 By 8 8 oe 24) 2 4 9 4 9 A 8 SM 8 hah 2 ha 3 6 2 a 9 (5) 9 (5) 9 (5) 9 (5) 9 2 {6} 2 (8) 2 4 g (Oh 2 fey 3 tet 8 1(7)5 (76 2 4 9 (7) 9 (1) 9 7 (8p 8 1 (2 4 9 (8) 9 3 (9) 9 (9), 0 6 2 4 Es 1 ¢)9 (20) 5 (20) 3 (10)2 {20 2 4 Explanationt 9 (41) 7 41) 6 5 (11}6 2 first we subtract 4 8 8 i 2 from the # on 2 4 4 2 (13)4 ° the aajor parameter; 1 (14) 2 2 7 (14jo leaving a # all of whot 6 1 (15)0 3 5)5 digits are 9's as far ae 3 G6) 0 5 (16)2 (26)7 ery it, Then, we di- 2 (27) 5 (17)2 5 78 - vide succesaively by 2,treate 7. a 2 9 - - ing each rank as a whole ae far 3 (19)8 1 9)4 - . ae We can go, & 60 on = it is 1 (20)9 2038 e = merely a repetition of the quick 9 (21)5 (21)3 method, tabulated, Then for the combs. AC 7 (22)6 which go with the #e we put a term,viz~ 2 3 (23 count only the figurea which are odd, 2 (2491 (2409 not writing down the count of those which 5 (a5h9 are even, Thue,

    You might also like