Leonhard Euler · 1744 · Internet Archive
Methodus inveniendi lineas curvas
All 336 leaves · leaf 77
Transcription
70 DE METHODO MAX. ET MIN.
tio praebebit $y = \frac{1}{\alpha} l(\alpha x + \beta) + \gamma x + \delta$. Quod ad casum $n=1$ attinet, ille in investigationem maximorum & minimorum nequidem incurrit; cum formula $\int q dx$ non fit indeterminata, sed determinatum valorem, puta $p$, ob $qdx = dp$, referat. Caterum patet, evanescente termino $\frac{(\alpha x + \beta)^{(2n-1)}}{n-1}$, lineam rectam quaesito satisfacere, ob $y = \gamma x + \delta$. Scilicet si quatuor puncta data, per quae curva quaesita transire debeat, sint in directum posita; tum ipsa linea recta, prae omnibus reliquis lineis per eadem quatuor puncta transeuntibus, quaesito satisfaciet.
EXEMPLUM VI.
55. Invenire curvam, in qua sit $\int \frac{xpdx}{yq}$ maximum vel minimum.
Quia est $Z = \frac{xp}{yq}$, erit $dZ = \frac{pdx}{yq} - \frac{xpdy}{y^2q} + \frac{xdp}{yq} - \frac{xpdq}{yq^2}$; ideoque $M = \frac{p}{
[TRUNCATED]
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.