TOPICS
Search

Search Results for ""


511 - 520 of 1524 for Warings ProblemSearch Results
An identity in calculus of variations discovered in 1868 by Beltrami. The Euler-Lagrange differential equation is (partialf)/(partialy)-d/(dx)((partialf)/(partialy_x))=0. (1) ...
A Colbert number is any prime number with more than 1000000 decimal digits whose discovery contributes to the long-sought after proof that k=78557 is the smallest Sierpiński ...
A planar polygon is convex if it contains all the line segments connecting any pair of its points. Thus, for example, a regular pentagon is convex (left figure), while an ...
Defining p_0=2, p_n as the nth odd prime, and the nth prime gap as g_n=p_(n+1)-p_n, then the Cramér-Granville conjecture states that g_n<M(lnp_n)^2 for some constant M>1.
Let n points xi_1, ..., xi_n be randomly distributed on a domain S, and let H be some event that depends on the positions of the n points. Let S^' be a domain slightly ...
Differential algebra is a field of mathematics that attempts to use methods from abstract algebra to study solutions of systems of polynomial nonlinear ordinary and partial ...
An n-dimensional disk (sometimes spelled "disc") of radius r is the collection of points of distance <=r (closed disk) or <r (open disk) from a fixed point in Euclidean ...
A number n is called an economical number if the number of digits in the prime factorization of n (including powers) uses fewer digits than the number of digits in n. The ...
The Euler points are the midpoints E_A, E_B, E_C of the segments which join the vertices A, B, and C of a triangle DeltaABC and the orthocenter H. They are three of the nine ...
The Franel numbers are the numbers Fr_n=sum_(k=0)^n(n; k)^3, (1) where (n; k) is a binomial coefficient. The first few values for n=0, 1, ... are 1, 2, 10, 56, 346, ... (OEIS ...
1 ... 49|50|51|52|53|54|55 ... 153 Previous Next

...