Search Results for ""
491 - 500 of 569 for quantum computingSearch Results
The Mertens constant B_1, also known as the Hadamard-de la Vallee-Poussin constant, prime reciprocal constant (Bach and Shallit 1996, p. 234), or Kronecker's constant ...
Numerical integration is the approximate computation of an integral using numerical techniques. The numerical computation of an integral is sometimes called quadrature. ...
Assume that n numbered pancakes are stacked, and that a spatula can be used to reverse the order of the top k pancakes for 2<=k<=n. Then the pancake sorting problem asks how ...
A partial differential equation (PDE) is an equation involving functions and their partial derivatives; for example, the wave equation ...
Given a Poisson process, the probability of obtaining exactly n successes in N trials is given by the limit of a binomial distribution P_p(n|N)=(N!)/(n!(N-n)!)p^n(1-p)^(N-n). ...
A special function mostly commonly denoted psi_n(z), psi^((n))(z), or F_n(z-1) which is given by the (n+1)st derivative of the logarithm of the gamma function Gamma(z) (or, ...
An analog of the polyominoes and polyiamonds in which collections of regular hexagons are arranged with adjacent sides. They are also called hexes, hexas, or polyfrobs ...
There are two kinds of power sums commonly considered. The first is the sum of pth powers of a set of n variables x_k, S_p(x_1,...,x_n)=sum_(k=1)^nx_k^p, (1) and the second ...
Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...
Closed forms are known for the sums of reciprocals of even-indexed Fibonacci numbers P_F^((e)) = sum_(n=1)^(infty)1/(F_(2n)) (1) = ...
...
View search results from all Wolfram sites (186433 matches)

