Search Results for ""

A Saunders graphic is a plot of the dth base-b digits of a function f(x,y) as a function of x and y. The plots above show Saunders graphics for the functions ...

An algorithm for multiplying two 32-bit integers modulo a 32-bit constant without using any intermediates larger than 32 bits. It is also useful in certain types of random ...

The sign of a real number, also called sgn or signum, is -1 for a negative number (i.e., one with a minus sign "-"), 0 for the number zero, or +1 for a positive number (i.e., ...

A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...

Let G be Gauss's constant and M=1/G be its multiplicative inverse. Then M/sqrt(2)=0.8472130... (OEIS A097057) is sometimes known as the ubiquitous constant (Spanier and ...

A unique factorization domain, called UFD for short, is any integral domain in which every nonzero noninvertible element has a unique factorization, i.e., an essentially ...

Following Yates (1980), a prime p such that 1/p is a repeating decimal with decimal period shared with no other prime is called a unique prime. For example, 3, 11, 37, and ...

A unit fraction is a fraction with numerator 1. Examples of unit fractions include 1/2, 1/3, 1/12, and 1/123456. The famous Rhind papyrus, dated to around 1650 BC, discusses ...

Pre-Algebra

Chebyshev noticed that the remainder upon dividing the primes by 4 gives 3 more often than 1, as plotted above in the left figure. Similarly, dividing the primes by 3 gives 2 ...