TOPICS
Search

Search Results for ""


171 - 180 of 600 for Quadratic ProgrammingSearch Results
Sarnak's constant is the constant C_(Sarnak) = product_(p>=3)(1-(p+2)/(p^3)) (1) = 0.7236484022... (2) (OEIS A065476), where the product is over the odd primes.
In general, an unresolved nth root, commonly involving a radical symbol RadicalBox[x, n], is known as a surd. However, the term surd or "surd expression" (e.g., Hardy 1967, ...
Taniguchi's constant is defined as C_(Taniguchi) = product_(p)[1-3/(p^3)+2/(p^4)+1/(p^5)-1/(p^6)] (1) = 0.6782344... (2) (OEIS A175639), where the product is over the primes ...
An invariant of an elliptic curve given in the form y^2=x^3+ax+b which is closely related to the elliptic discriminant and defined by j(E)=(2^83^3a^3)/(4a^3+27b^2). The ...
A (k,l)-multigrade equation is a Diophantine equation of the form sum_(i=1)^ln_i^j=sum_(i=1)^lm_i^j (1) for j=1, ..., k, where m and n are l-vectors. Multigrade identities ...
A quartic equation is a fourth-order polynomial equation of the form z^4+a_3z^3+a_2z^2+a_1z+a_0=0. (1) While some authors (Beyer 1987b, p. 34) use the term "biquadratic ...
The nesting of two or more functions to form a single new function is known as composition. The composition of two functions f and g is denoted f degreesg, where f is a ...
Let R(z) be a rational function R(z)=(P(z))/(Q(z)), (1) where z in C^*, C^* is the Riemann sphere C union {infty}, and P and Q are polynomials without common divisors. The ...
A linear recurrence equation is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a first-degree polynomial in x_k with k<n. For example ...
Number Theory
1 ... 15|16|17|18|19|20|21 ... 60 Previous Next

...