Search Results for ""
271 - 280 of 587 for Modular ArithmeticSearch Results
An additive function is an arithmetic function such that whenever positive integers a and b are relatively prime, f(ab)=f(a)+f(b). An example of an additive function is ...
A series s_1,s_2,... for which s_1>=s_2>=....
The reciprocal of the arithmetic-geometric mean of 1 and sqrt(2), G = 2/piint_0^11/(sqrt(1-x^4))dx (1) = 2/piint_0^(pi/2)(dtheta)/(sqrt(1+sin^2theta)) (2) = L/pi (3) = ...
An algorithm for computing an Egyptian fraction.
The set R union {infty}, obtained by adjoining one improper element to the set R of real numbers, is the set of projectively extended real numbers. Although notation is not ...
The combining of two or more quantities using the plus operator. The individual numbers being combined are called addends, and the total is called the sum. The first of ...
If C_1, C_2, ...C_r are sets of positive integers and union _(i=1)^rC_i=Z^+, then some C_i contains arbitrarily long arithmetic progressions. The conjecture was proved by van ...
A binary plot of an integer sequence is a plot of the binary representations of successive terms where each term is represented as a column of bits with 1s colored black and ...
A method for verifying the correctness of an arithmetical operation on natural numbers, based on the same principle as casting out nines. The methods of sevens takes ...
Decimal is the base-10 notational system for representing real numbers. The expression of a number using the decimal system is called its decimal expansion, examples of which ...
...
View search results from all Wolfram sites (9930 matches)

