<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.universitas.ro/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Ghetie+Gabriela+Claudia</id>
	<title>Bitnami MediaWiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.universitas.ro/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Ghetie+Gabriela+Claudia"/>
	<link rel="alternate" type="text/html" href="https://wiki.universitas.ro/wiki/Special:Contributions/Ghetie_Gabriela_Claudia"/>
	<updated>2026-06-17T02:44:17Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.42.1</generator>
	<entry>
		<id>https://wiki.universitas.ro/index.php?title=28250&amp;diff=7070</id>
		<title>28250</title>
		<link rel="alternate" type="text/html" href="https://wiki.universitas.ro/index.php?title=28250&amp;diff=7070"/>
		<updated>2023-10-28T14:07:48Z</updated>

		<summary type="html">&lt;p&gt;Ghetie Gabriela Claudia: Pagină nouă: &amp;lt;sub&amp;gt;&amp;#039;&amp;#039;&amp;#039;&amp;lt;big&amp;gt;28250 (Codruț-Sorin Zmicală)&amp;lt;/big&amp;gt;&amp;#039;&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;  &amp;#039;&amp;#039;Calculați&amp;#039;&amp;#039;  &amp;#039;&amp;#039;&amp;lt;math&amp;gt;\lim_{n \to \infty}\sqrt[n]{\int_{0}^{1} (\sqrt{x}+x^n})^ndx&amp;lt;/math&amp;gt;.&amp;#039;&amp;#039;  &amp;#039;&amp;#039;&amp;#039;Soluție:&amp;#039;&amp;#039;&amp;#039;  Fie &amp;lt;math&amp;gt;a_n=\int_{0}^{1} (\sqrt{x}+x^n)^ndx&amp;lt;/math&amp;gt;, n&amp;lt;math&amp;gt;\in\Nu^*&amp;lt;/math&amp;gt;. Cu binomul lui Newton avem &amp;lt;math&amp;gt;(\sqrt{x}+x^n)^n=\sum_{k=0}^n\binom{n}{k}x^\tfrac{(2n-1)k+n}{2}&amp;lt;/math&amp;gt;, iar prin integrare pe [0,1] obținem &amp;lt;math&amp;gt;a_n=\sum_{k=0}^n\binom{n}{k}\cdot\frac{2}{(2n-1)k+n+2}&amp;lt;/math&amp;gt;.   Pentru orice &amp;lt;ma...&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;sub&amp;gt;&#039;&#039;&#039;&amp;lt;big&amp;gt;28250 (Codruț-Sorin Zmicală)&amp;lt;/big&amp;gt;&#039;&#039;&#039;&amp;lt;/sub&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Calculați&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&amp;lt;math&amp;gt;\lim_{n \to \infty}\sqrt[n]{\int_{0}^{1} (\sqrt{x}+x^n})^ndx&amp;lt;/math&amp;gt;.&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Soluție:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Fie &amp;lt;math&amp;gt;a_n=\int_{0}^{1} (\sqrt{x}+x^n)^ndx&amp;lt;/math&amp;gt;, n&amp;lt;math&amp;gt;\in\Nu^*&amp;lt;/math&amp;gt;. Cu binomul lui Newton avem &amp;lt;math&amp;gt;(\sqrt{x}+x^n)^n=\sum_{k=0}^n\binom{n}{k}x^\tfrac{(2n-1)k+n}{2}&amp;lt;/math&amp;gt;, iar prin integrare pe [0,1] obținem &amp;lt;math&amp;gt;a_n=\sum_{k=0}^n\binom{n}{k}\cdot\frac{2}{(2n-1)k+n+2}&amp;lt;/math&amp;gt;. &lt;br /&gt;
&lt;br /&gt;
Pentru orice &amp;lt;math&amp;gt;k\in\{0,1,...,n\}&amp;lt;/math&amp;gt; avem &amp;lt;math&amp;gt;\binom{n}{k}\cdot\frac{1}{n^2+1}\leqslant\binom{n}{k}\cdot\frac{2}{(2n-1)k+n+2}\leqslant\binom{n}{k}&amp;lt;/math&amp;gt;, iar prin însumarea acestor inegalități obținem &amp;lt;math&amp;gt;\frac{2^n}{n^2+1}\leqslant a_n\leqslant 2^n&amp;lt;/math&amp;gt;. &lt;br /&gt;
&lt;br /&gt;
Rezultă &amp;lt;math&amp;gt;\frac{2}{\sqrt[n]{n^2+1}}\leqslant{\sqrt[n]{a_n}}\leqslant2&amp;lt;/math&amp;gt;, pentru orice &amp;lt;math&amp;gt;n\geqslant2&amp;lt;/math&amp;gt;. Cum &amp;lt;math&amp;gt;\lim_{n \to \infty}\sqrt[n]{n^2+1}=1&amp;lt;/math&amp;gt;, din teorema cleștelui obținem &amp;lt;math&amp;gt;\lim_{n \to \infty}\sqrt[n]{a_n}=2&amp;lt;/math&amp;gt;.&lt;/div&gt;</summary>
		<author><name>Ghetie Gabriela Claudia</name></author>
	</entry>
</feed>