Steps / Historical AI

Leonhard Euler · 1748 · Internet Archive

Introductio in analysin infinitorum

All 320 leaves · leaf 230

Transcription

202 DE MULTIPLICATIONE LIB. I. EXEMPLUM III. Hoc modo, si ponamus $n = 2m+1$, erit $0 = \text{fin.} z + \text{fin.}(\frac{\varpi}{n} - z) - \text{fin.}(\frac{\varpi}{n} + z) - \text{fin.}(\frac{2\varpi}{n} - z) + \text{fin.}(\frac{2\varpi}{n} + z) + \text{fin.}(\frac{3\varpi}{n} - z) - \text{fin.}(\frac{3\varpi}{n} + z) - \dots \pm \text{fin.}(\frac{m\varpi}{n} - z) \mp \text{fin.}(\frac{m\varpi}{n} + z)$ ubi signa superiora valent si $m$ fit numerus impar, inferiora si fit par. Altera aequatio erit haec. $\frac{n}{\text{fin.} nz} = \frac{1}{\text{fin.} z} + \frac{1}{\text{fin.}(\frac{\varpi}{n} - z)} - \frac{1}{\text{fin.}(\frac{\varpi}{n} + z)} - \frac{1}{\text{fin.}(\frac{2\varpi}{n} [TRUNCATED]
confidence 0.43 3 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.