Search Results for ""
91 - 100 of 3715 for One-step equationsSearch Results

A deletable prime is a prime number which has the property that deleting digits one at a time in some order gives a prime at each step. For example, 410256793 is a deletable ...
Let a_n>=0 and suppose sum_(n=1)^inftya_ne^(-an)∼1/a as a->0^+. Then sum_(n<=x)a_n∼x as x->infty. This theorem is a step in the proof of the prime number theorem, but has ...
A figure formed by taking a series of steps of length 1, 2, ..., n, with an angle theta turn after each step. The symbol for a spirolateral is ^(a_1,...,a_k)n_theta, where ...
A random walk is a sequence of discrete steps in which each step is randomly taken subject to some set of restrictions in allowed directions and step lengths. Random walks ...
The sequence a(n) given by the exponents of the highest power of 2 dividing n, i.e., the number of trailing 0s in the binary representation of n. For n=1, 2, ..., the first ...
T-integration, which stands for "tunable numerical integration," is a fast, accurate, and numerically stable numerical integration formula given by ...
The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...
Poker is a card game played with a normal deck of 52 cards. Sometimes, additional cards called "jokers" are also used. In straight or draw poker, each player is normally ...
A piecewise function is a function that is defined on a sequence of intervals. A common example is the absolute value, |x|={-x for x<0; 0 for x=0; x for x>0. (1) Piecewise ...
The ramp function is defined by R(x) = xH(x) (1) = int_(-infty)^xH(x^')dx^' (2) = int_(-infty)^inftyH(x^')H(x-x^')dx^' (3) = H(x)*H(x), (4) where H(x) is the Heaviside step ...

...
 
         
	    
	
    
 View search results from all Wolfram sites (201851 matches)
View search results from all Wolfram sites (201851 matches)

