Teste - Să ne obişnuim cu Forumul !

[Admin]

Un link rapid, pagină foarte utilă, aici :

http://en.wikipedia.org/wiki/Help:Displaying_a_formula#Larger_expressions

Using $LaTeX$

[Admin]

$\sideset{_1^2}{_3^4}\prod_a^b$


${}_1^2\!\Omega_3^4$

Code: Select all

$\sideset{_1^2}{_3^4}\prod_a^b$
${}_1^2\!\Omega_3^4$


$\dot{x}, \ddot{x}$

Code: Select all

$\dot{x}, \ddot{x}$

$\hat a ... \bar b ... \vec c ... \widehat{d e f}$

Code: Select all

$\hat a ... \bar b ... \vec c ... \widehat{d e f}$

Arc (workaround) : $\overset{\frown} {AB}$

Code: Select all

$\overset{\frown} {AB}$

$\overbrace{ 1+2+\cdots+100 }^{5050}$ and $\underbrace{ a+b+\cdots+z }_{26}$

Code: Select all

$\overbrace{ 1+2+\cdots+100 }^{5050}$ and $\underbrace{ a+b+\cdots+z }_{26}$

Large (nested) fractions : $\cfrac{2}{c + \cfrac{2}{d + \cfrac{2}{4}}} = a$

Code: Select all

$\cfrac{2}{c + \cfrac{2}{d + \cfrac{2}{4}}} = a$

$\dfrac{2}{c + \dfrac{2}{d + \dfrac{2}{4}}} = a$ (merge foarte bine în orice situaţie cu dfrac ...)

Cancellations in fractions : $\require{cancel}\cfrac{x}{1 + \cfrac{\cancel{y}}{\cancel{y}}} = \cfrac{x}{2}$

Code: Select all

$\require{cancel}\cfrac{x}{1 + \cfrac{\cancel{y}}{\cancel{y}}} = \cfrac{x}{2}$

Bad : $( \dfrac{1}{2} )$ --- Good : $\left ( \dfrac{1}{2} \right )$

Code: Select all

Bad : $( \dfrac{1}{2} )$ --- Good : $\left ( \dfrac{1}{2} \right )$

$\displaystyle \sum_{k=1}^n k^3 = \left [\frac{n(n+1)}{2} \right ]^2$

Code: Select all

$\displaystyle \sum_{k=1}^n k^3 = \left [\frac{n(n+1)}{2} \right ]^2$

Un link rapid, pagină foarte utilă, aici :
http://en.wikipedia.org/wiki/Help:Displaying_a_formula#Larger_expressions

[Georgy]

$a^2+b^2\geqslant 2ab$

[carmen.iulia]

$a^2+b^2+c^2 \geqslant ab+ac+bc$

[Marinela]

$a^3+b^3+c^3+d^3 \geqslant abc+abd+acd+bcd$

[Admin]

$a^2+b^2\geqslant 2ab$

Demonstraţia (simplă, cu formula "binom diferenţă la pătrat") foloseşte la următoarea :

$a^2+b^2+c^2 \geqslant ab+ac+bc$

Cât despre aceasta :

$a^3+b^3+c^3+d^3 \geqslant abc+abd+acd+bcd$

... dar mai bine vedeţi generalizarea (pe care am găsit-o acum vreo 5-6 ani) la adresa : Inegalităţi clasice

Condensat, pentru $a_1, a_2, ... , a_n \geqslant 0$ , formula ar arăta aşa :

$\displaystyle \sum_{i=1}^n a_i^{n-1} \geqslant \displaystyle \sum_{i=1}^{n} \displaystyle \prod_{\substack{k=1 \\ k \neq i}}^{n} a_k$

[Matt]

Test - "Registered User" (.. "simple user")

[Admin]

Updated Forum Groups ...

[Adm]

Forum Updated to the Latest version ...

[Utilizator]

Forum Updated to the Latest version ...

Azi -> Update la ultima versiune a forumului...