Search Results for ""
1041 - 1050 of 1340 for Root Finding AlgorithmSearch Results
The nearest integer function, also called nint or the round function, is defined such that nint(x) is the integer closest to x. While the notation |_x] is sometimes used to ...
In the technical combinatorial sense, an a-ary necklace of length n is a string of n characters, each of a possible types. Rotation is ignored, in the sense that b_1b_2...b_n ...
A pseudoprime is a composite number that passes a test or sequence of tests that fail for most composite numbers. Unfortunately, some authors drop the "composite" ...
The Rhind papyrus is a famous document from the Egyptian Middle Kingdom that dates to 1650 BC. It was purchased by Henry Rhind in Egypt in 1858, and placed in the British ...
Somos's quadratic recurrence constant is defined via the sequence g_n=ng_(n-1)^2 (1) with g_0=1. This has closed-form solution ...
The problem of finding the curve down which a bead placed anywhere will fall to the bottom in the same amount of time. The solution is a cycloid, a fact first discovered and ...
The best known packings of equilateral triangles into an equilateral triangle are illustrated above for the first few cases (Friedman). The best known packings of equilateral ...
The problem of finding the mean triangle area of a triangle with vertices picked inside a triangle with unit area was proposed by Watson (1865) and solved by Sylvester. It ...
For an integer n>=2, let lpf(n) denote the least prime factor of n. A pair of integers (x,y) is called a twin peak if 1. x<y, 2. lpf(x)=lpf(y), 3. For all z, x<z<y implies ...
Wang's conjecture states that if a set of tiles can tile the plane, then they can always be arranged to do so periodically (Wang 1961). The conjecture was refuted when Berger ...
...
View search results from all Wolfram sites (23349 matches)

