TOPICS
Search

Search Results for ""


991 - 1000 of 1587 for P_versus_ NP_problemSearch Results
If a number fails Miller's primality test for some base a, it is not a prime. If the number passes, it may be a prime. A composite number passing Miller's test is called a ...
Mills' constant can be defined as the least theta such that f_n=|_theta^(3^n)_| is prime for all positive integers n (Caldwell and Cheng 2005). The first few f_n for n=1, 2, ...
The Mills ratio is defined as m(x) = 1/(h(x)) (1) = (S(x))/(P(x)) (2) = (1-D(x))/(P(x)), (3) where h(x) is the hazard function, S(x) is the survival function, P(x) is the ...
An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...
Let five circles with concyclic centers be drawn such that each intersects its neighbors in two points, with one of these intersections lying itself on the circle of centers. ...
Let any finite or infinite set of points having no finite limit point be prescribed and associate with each of its points a principal part, i.e., a rational function of the ...
Given an m×n matrix B, the Moore-Penrose generalized matrix inverse is a unique n×m matrix pseudoinverse B^+. This matrix was independently defined by Moore in 1920 and ...
There are several results known as the Morgado identity. The first is (1) where F_n is a Fibonacci number and L_n is a Lucas number (Morgado 1987, Dujella 1995). A second ...
In number theory (e.g., Ivić 2003), the symbol log_kx is commonly used to mean the nested logarithm (also called the repeated logarithm or iterated logarithm) ...
A proof which indirectly shows a mathematical object exists without providing a specific example or algorithm for producing an example. Nonconstructive proofs are also called ...
1 ... 97|98|99|100|101|102|103 ... 159 Previous Next

...