S:E18.131

From Bitnami MediaWiki
Revision as of 09:44, 8 March 2023 by HMAndrei (talk | contribs)

S:E18.131 (Nicolae Mușuroia)

Determinați cel mai mic număr natural pătrat perfect care se poate scrie ca sumă de 2018 numere naturale consecutive.

Soluție

Fie Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle k} numărul căutat. Atunci

Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle x+\bigl(x+1\bigr) + \ldots +\bigl(x+2017\bigr)=k^2} ceea ce revine, în mod echivalent la

Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 1009 \cdot \bigl(2x+2017\bigr) = k^2}