Search Results for ""
2921 - 2930 of 13135 for binary numberSearch Results
Let P, Q be integers satisfying D=P^2-4Q>0. (1) Then roots of x^2-Px+Q=0 (2) are a = 1/2(P+sqrt(D)) (3) b = 1/2(P-sqrt(D)), (4) so a+b = P (5) ab = 1/4(P^2-D) (6) = Q (7) a-b ...
The transform inverting the sequence g(n)=sum_(d|n)f(d) (1) into f(n)=sum_(d|n)mu(d)g(n/d), (2) where the sums are over all possible integers d that divide n and mu(d) is the ...
The integer sequence defined by the recurrence relation P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=P(1)=P(2)=1. This is the same recurrence relation as for the ...
Ramanujan's Dirichlet L-series is defined as f(s)=sum_(n=1)^infty(tau(n))/(n^s), (1) where tau(n) is the tau function. Note that the notation F(s) is sometimes used instead ...
A Wilson prime is a prime satisfying W(p)=0 (mod p), where W(p) is the Wilson quotient, or equivalently, (p-1)!=-1 (mod p^2). The first few Wilson primes are 5, 13, and 563 ...
The absolute difference of two numbers n_1 and n_2 is |n_1-n_2|, where the minus sign denotes subtraction and |x| denotes the absolute value.
A mathematical object S is said to be additively closed if a,b in S implies that a+b in S.
The first of several addends, or "the one to which the others are added," is sometimes called the augend. Therefore, while a, b, and c are addends in a+b+c, a is the augend.
The procedure used in subtraction to "borrow" 10 from the next higher digit column in order to obtain a positive difference in the column in question.
Solve the Pell equation x^2-92y^2=1 in integers. The smallest solution is x=1151, y=120.
...