Search Results for ""
101 - 110 of 562 for Computing with exponents and radicalsSearch Results
Highly composite numbers are numbers such that divisor function d(n)=sigma_0(n) (i.e., the number of divisors of n) is greater than for any smaller n. Superabundant numbers ...
In a 1847 talk to the Académie des Sciences in Paris, Gabriel Lamé (1795-1870) claimed to have proven Fermat's last theorem. However, Joseph Liouville immediately pointed out ...
LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...
Synthetic division is a shortcut method for dividing two polynomials which can be used in place of the standard long division algorithm. This method reduces the dividend and ...
Pre-Calculus
The Church-Turing thesis (formerly commonly known simply as Church's thesis) says that any real-world computation can be translated into an equivalent computation involving a ...
Heule graphs are a set of unit-distance graphs with chromatic number five derived by Marijn Heule in April 2018 to July 2918 from the 1581-vertex de Grey Graph (Heule 2018). ...
A statistic defined to improve the Kolmogorov-Smirnov test in the tail of a distribution.
The function psi(x)={sin(x/c) |x|<cpi; 0 |x|>cpi, (1) which occurs in estimation theory.
A generalization of the Bulirsch-Stoer algorithm for solving ordinary differential equations.
...
View search results from all Wolfram sites (206917 matches)

