[permalink] [id link]
:: f ( x ) = a < sub > 0 </ sub > + a < sub > 1 </ sub > x + a < sub > 2 </ sub > x < sup > 2 </ sup >, where a < sub > 2 </ sub > ≠ 0
from
Wikipedia
Some Related Sentences
:: and f
:: To solve the uniform word problem for a class K of groups it is sufficient to find a recursive function f ( P, w ) that takes a finite presentation P for a group G and a word w in the generators of G such that whenever in G ∈ K:
:: See Committee Note to Interim Rule 8001 ( f ) (" Given the short time limit to file the petition with the circuit clerk, subdivision ( f )( 1 ) provides that entry of a certification on the docket does not occur until an effective appeal is taken under Rule 8003 ( a ) or ( b ).
:: For any open neighborhood N of A, there is a positive constant T such that f ( t, b ) ∈ N for all real t > T.
:: and x
Operating systems that supported Alpha included OpenVMS ( previously known as OpenVMS AXP ), Tru64 UNIX ( previously known as DEC OSF / 1 AXP and Digital UNIX ), Windows NT ( until 4. 0 SP6 and Windows 2000 RC1 ), GNU / Linux ( Debian GNU / Linux, Gentoo Linux and Red Hat Linux ), BSD UNIX ( NetBSD, OpenBSD and FreeBSD up to 6. x ), as well as the L4Ka :: Pistachio kernel.
:: " i. e., ' x is a member of the class determined by ( φẑ )' is equivalent to ' x satisfies ( φẑ ),' or to '( φx ) is true .'".
:: and =
:: 27 < sup > 5 </ sup > + 84 < sup > 5 </ sup > + 110 < sup > 5 </ sup > + 133 < sup > 5 </ sup > =
:: u < sup > 2 </ sup > = 22030 + 28849v − 56158v < sup > 2 </ sup >+ 36941v < sup > 3 </ sup >− 31790v < sup > 4 </ sup >.
0.438 seconds.