Gazeta matematică 2015

Gazeta Matematică 1/2015

27020 (Gheorghe Szöllösy)

Să se calculeze suma 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 \sum_{k=0}^{\left[\frac{n}{2}\right]} \frac{1}{4^k \cdot (k!)^2 (n-2k)!}, \quad n \geq 1. }

27022 (Guntter Gotha)

Fie $f:\left[a,b\right]\to \mathbb {R}$ o funcție cu proprietatea lui Darboux și cu 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 f\left(a\right) \cdot f\left( b \right) >0} . Mulțimea 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 M = \left\{ x \in \left[ a, b \right] \, | \, f\left(x\right) =0 \right\}} este finită și are un număr impar de elemente. Demonstrați că 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 f} are un punct de extrem local ce aparține mulțimii 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 M} .

27024 (Gheorghe Szöllösy)

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 I_n = \int_{0}^{\pi} \frac{\cos nx}{13-12\cos x}\,dx, n\ge0.} Să se calculeze 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 \lim_{n \to \infty}(I_0+I_1+I_2+\ldots+I_n).}