Search Results for ""
3231 - 3240 of 13135 for binary numberSearch Results
The Pell-Lucas polynomials Q(x) are the w-polynomials generated by the Lucas polynomial sequence using the generator p(x)=2x, q(x)=1. The first few are Q_1(x) = 2x (1) Q_2(x) ...
The use of percentages is a way of expressing ratios in terms of whole numbers. A ratio or fraction is converted to a percentage by multiplying by 100 and appending a ...
A sequence {a_i} is said to be periodic with period p with if it satisfies a_i=a_(i+np) for n=1, 2, .... For example, {1,2,1,2,1,2,1,2,1,2,1,2,1,2,...} is a periodic sequence ...
int_0^z(t^mu)/(1+t)dt=z/(mu+1+((mu+1)^2z)/((mu+2)-(mu+1)z+((mu+2)^2z)/((mu+3)-(mu+2)z+...))) for mu>-1 and -1<z<=1 (Perron 1954-1957, p. 18; Borwein et al. 2004, p. 35).
The addition of two quantities, i.e., a plus b. The operation is denoted a+b, and the symbol + is called the plus sign. Floating-point addition is sometimes denoted direct ...
Let p be an odd prime, k be an integer such that pk and 1<=k<=2(p+1), and N=2kp+1. Then the following are equivalent 1. N is prime. 2. There exists an a such that ...
f(z)=k/((cz+d)^r)f((az+b)/(cz+d)) where I[z]>0.
The quotient of two polynomials p(x) and q(x), discarding any polynomial remainder. Polynomial quotients are implemented in the Wolfram Language as PolynomialQuotient[p, q, ...
The remainder R(x) obtained when dividing a polynomial p(x) by another polynomial q(x). The polynomial remainder is implemented in the Wolfram Language as ...
A quantity x>0, which may be written with an explicit plus sign for emphasis, +x.
...