Steps / Historical AI

Leonhard Euler · 1748 · Internet Archive

Introductio in analysin infinitorum

All 320 leaves · leaf 293

Transcription

NUMERORUM. 265 secari potest, quot modis numerus $n + \frac{m(m-1)}{2}$ in $m$ partes CAP. XVI. inaequales dispertiri potest. 316. Per formationem autem Serierum recurrentium inveniri poterit, quot variis modis datus numerus $n$ per additionem produci possit ex numeris $1, 2, 3, . . . . . . . . m$. Ad hoc enim inveniendum evolvi debebit fractio $\frac{1}{(1-x)(1-x^2)(1-x^3) . . . . . . . . (1-x^m)}$ atque Series recurrens continuari debebit usque ad terminum $Nx^n$, cujus coëfficiens $N$ indicabit, quot modis numerus $n$ per additionem produci possit ex numeris $1, 2, 3, 4, . . . . . . m$. At vero hic solvendi modus non parum habebit difficultatis, si numeri $m$ & $n$ sint modice magni; scala enim relationis, quam praebet denominator per multiplicationem evolutus, ex pluribus terminis constat, unde operosum erit Seriem ad plures terminos continuare. 317. Haec autem disquisitio minus erit molesta, si casus simpliciores primum expediantur, ex his enim facile erit ad casus magis compositos progredi. Sit Seriei, quae ex hac fractione oritur, $\frac{1}{(1-x)(1-x^2)(1-x^3) . . . . . . . . (1-x^m)}$ terminus generalis = $Nx^n$; at Seriei ex hac forma $\frac{x^m}{(1-x)(1-x^2)(1-x^3) . . . . . . . . (1-x^m)}$ ortae terminus generalis fit $Mx^n$, ubi coëfficiens $M$ indicabit quot variis modis numerus $n-m$ per additionem produci possit. Euleri Introduct. in Anal. infin. parv. L l possit
confidence 0.75 17 expressions source scan at the Internet Archive

This text was produced by machine and has not been corrected by hand. Where it matters, read the scan. Confidence is the model's own, not an external check.