Search Results for ""
2141 - 2150 of 2617 for Prime Generating PolynomialSearch Results
Let p={a_1,a_2,...,a_n} be a permutation. Then i is a permutation ascent if a_i<a_(i+1). For example, the permutation {1,2,3,4} is composed of three ascents, namely {1,2}, ...
Pickover's sequence gives the starting positions in the decimal expansion of pi (ignoring the leading 3) in which the first n digits of e occur (counting the leading 2). So, ...
The partial differential equation (1+u_y^2)u_(xx)-2u_xu_yu_(xy)+(1+u_x^2)u_(yy)=0 (correcting a typo in Zwillinger 1997, p. 134).
The theorem in set theory and logic that for all sets A and B, B=(A intersection B^_) union (B intersection A^_)<=>A=emptyset, (1) where A^_ denotes complement set of A and ...
The principal value of an analytic multivalued function is the single value chosen by convention to be returned for a given argument. Complex multivalued functions have ...
The term "product" refers to the result of one or more multiplications. For example, the mathematical statement a×b=c would be read "a times b equals c," where a is called ...
Proper covers are defined as covers of a set X which do not contain the entire set X itself as a subset (Macula 1994). Of the five covers of {1,2}, namely {{1},{2}}, {{1,2}}, ...
A Proth number is a number of the form N=k·2^n+1 for odd k, n a positive integer, and 2^n>k. The 2^n>k condition is needed since otherwise, every odd number >1 would be a ...
The pseudosmarandache function Z(n) is the smallest integer such that sum_(k=1)^(Z(n))k=1/2Z(n)[Z(n)+1] is divisible by n. The values for n=1, 2, ... are 1, 3, 2, 7, 4, 3, 6, ...
The Pythagoras tree is a fractal constructed iteratively from a right triangle with squares erected on each of the sides. Subsequent iterations add additional similar right ...
...
View search results from all Wolfram sites (24574 matches)

