Search Results for ""
9001 - 9010 of 13131 for booleanalgebra.htmlSearch Results

Let a>|b|, and write h(theta)=(acostheta+b)/(2sintheta). (1) Then define P_n(x;a,b) by the generating function f(x,w)=f(costheta,w)=sum_(n=0)^inftyP_n(x;a,b)w^n ...
A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...
A prime factorization algorithm which can be implemented in a single-step or double-step form. In the single-step version, a prime factor p of a number n can be found if p-1 ...
The conjecture due to Pollock (1850) that every number is the sum of at most five tetrahedral numbers (Dickson 2005, p. 23; incorrectly described as "pyramidal numbers" and ...
A divergenceless field can be partitioned into a toroidal and a poloidal part. This separation is important in geo- and heliophysics, and in particular in dynamo theory and ...
Let chi be a nonprincipal number theoretic character over Z/Zn. Then for any integer h, |sum_(x=1)^hchi(x)|<=2sqrt(n)lnn.
Let n be a positive integer and r(n) the number of (not necessarily distinct) prime factors of n (with r(1)=0). Let O(m) be the number of positive integers <=m with an odd ...
A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...
A Pólya plot is a plot of the vector field of (R[f(z)],-I[f(z)]) of a complex function f(z). Several examples are shown above. Pólya plots can be created in the Wolfram ...
The polynomial giving the number of colorings with m colors of a structure defined by a permutation group.

...