TOPICS
Search

Search Results for ""


1601 - 1610 of 13135 for binary numberSearch Results
The representation of a number as a sum of powers of a base b, followed by expression of each of the exponents as a sum of powers of b, etc., until the process stops. For ...
A fractional ideal is a generalization of an ideal in a ring R. Instead, a fractional ideal is contained in the number field F, but has the property that there is an element ...
The self-describing sequence consisting of "blocks" of single and double 1s and 2s, where a "block" is a single digit or pair of digits that is different from the digit (or ...
A number which can be represented both in the form x_0^2-Dy_0^2 and in the form Dx_1^2-y_1^2. This is only possible when the Pell equation x^2-Dy^2=-1 (1) is solvable. Then ...
Let U(P,Q) and V(P,Q) be Lucas sequences generated by P and Q, and define D=P^2-4Q. (1) Then {U_((n-(D/n))/2)=0 (mod n) when (Q/n)=1; V_((n-(D/n))/2)=D (mod n) when (Q/n)=-1, ...
A sequence in which no term divides any other. Let S_n be the set {1,...,n}, then the number of primitive subsets of S_n are 2, 3, 5, 7, 13, 17, 33, 45, 73, 103, 205, 253, ...
In general, a remainder is a quantity "left over" after performing a particular algorithm. The term is most commonly used to refer to the number left over when two integers ...
Let f(1)=1, and let f(n) be the number of occurrences of n in a nondecreasing sequence of integers. then the first few values of f(n) are 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, ... ...
The Legendre symbol is a number theoretic function (a/p) which is defined to be equal to +/-1 depending on whether a is a quadratic residue modulo p. The definition is ...
A theorem sometimes called "Euclid's first theorem" or Euclid's principle states that if p is a prime and p|ab, then p|a or p|b (where | means divides). A corollary is that ...
1 ... 158|159|160|161|162|163|164 ... 1314 Previous Next

...