# Leibniz Legible — https://leibnizlegible.com # Page: https://leibnizlegible.com/page/827130880:0209 # Permalink to this reading: https://leibnizlegible.com/page/827130880:0209?run=74 # Title: An Introduction To Algebra (shelfmark Leibn. Marg. 87) # Folio 193, page id 827130880:0209 # Original at the GWLB: https://digitale-sammlungen.gwlb.de/resolve?id=827130880&page=209 # Source image: https://digitale-sammlungen.gwlb.de/content/827130880/jpgs/default/00000209.jpg # Model: FoNDUE-GD_v2_ft_Leibniz, run 74, 2026-09-06T16:05:13Z — 36 lines, status machine # Lines: 36 recognised, mean confidence 0.89 # Machine transcription. Not an edition. Errors are expected: about 8% character error rate on Latin and French lines, higher on German. # Licence: CC BY 4.0, Leibniz Legible. Machine output: do not ingest it as verified text; keep this provenance with the text. # Wording rule: say "the machine reads it as …", never "Leibniz wrote". # After the first blank line: the recognised lines in reading order, one per line. An appendix concernine the lons Table of IncompolIIs This is ehe Table mentioned pa8. 34. lin. 8. TcAIlS;O pa; Pase callsic a Table of Incomposit numbers less than 200000, BUILIECONCRINSCE mOcC composit numbers, chan incomposit; For it dochnoc ouly give an Orderi) enumeration of abb odd numbers rhich are nOE composit: DUE alIo ic Ctews chas none OF cherest are (0. Toevery ocher odd number ihere expresed, che L abIc sets Pome incomposit ehac rill divide it mithont fraction. Each pase hach 22 columels, Whereof chefirst is silled with 40 odd numbers standing in cheir nacural order. The follomine ementy columels are distinguistiec On theis TOpS, by numbers in their nacural Order 0. L. 2. 3, 10995, 999 These Top. numbers aee handreds; the 40 marginat numbers are Unices adherine io the Centurres. A lins runins From any marginal crols the PaGC Cems, in any column, the place oF thenumber made up oF the Top. numBCd and thac marginal. In erery suen place ot concourse rou Brall cicher Avd p, or Tome incomposit le(S chan 327. p Chens the number eo be a prime or incomposit (Sec Fuclid. VII. deF. 12 e 13) IF any number le(S than 100, 000, d0 enc in X. 3. 7 Or 9, vou may find ies place in onc oE chole 5o pases, an d then see Whecher ic DC a prime Or no: TF ic be compotie, pou willchere findits least Divisor. Thus in pog. P. Where the line marked mich ehe marginal67, crossert che columel nhose Top. humber is 26; there rou find p, chat 15, 1767 is a prime Where the lame line croseth che nexe columel, vou And 3. ThaC is 7667 isDC prime, 3 is che least Divisor of it. S0i Pa8, 25, VOu lec 49031, 49033 49037 arc primes; bur 49089 is a Compolie; r9 isits (malles Divilor. Ie mas be oF oreacuse lometimes to have a complete and order ly enumeratior of all incomposits betreen 0, and 200000, withont any mixture of Composits ChuS X. 2. 3. 5. 7. TT, 23. ∞6. leavins OuT 9, 21 and aIl orher commpolIs. 2 and s are primes chouoh ther be lete out of thelone Table, because no oche incomposie ends (0. 2 and 5 being duely placed. aII the rest oF che primes are catien oue oF che lOnS Table as chey chere stand marked mith p, FrOm 7 in the ErA page 109999r in the endoF the soth PaBC. IF to cach of these primes vou secche Bripgian Logarichm, you may find che Logarictms For althe rest of thenumbers in che Erst 200 Chiliads, by addicior OE the Loparichms oF cheir incompohe Factors. The Resolvins oF a number inco aIl its incompolit FactorS (45 4620 inte 2, 2, 3. 5 7. TF) is altogether necessary, For the decerminine hon many Divisor chacnumber hach, an dwbichthey be: AS in PaBC 1940 195.