Search Results for ""

A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on ...

A general quadratic Diophantine equation in two variables x and y is given by ax^2+cy^2=k, (1) where a, c, and k are specified (positive or negative) integers and x and y are ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

A power is an exponent to which a given quantity is raised. The expression x^a is therefore known as "x to the ath power." A number of powers of x are plotted above (cf. ...

There exist a variety of formulas for either producing the nth prime as a function of n or taking on only prime values. However, all such formulas require either extremely ...

A primitive root of a prime p is an integer g such that g (mod p) has multiplicative order p-1 (Ribenboim 1996, p. 22). More generally, if GCD(g,n)=1 (g and n are relatively ...

A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...

A function tau(n) related to the divisor function sigma_k(n), also sometimes called Ramanujan's tau function. It is defined via the Fourier series of the modular discriminant ...

An abundant number, sometimes also called an excessive number, is a positive integer n for which s(n)=sigma(n)-n>n, (1) where sigma(n) is the divisor function and s(n) is the ...

If r is a root of a nonzero polynomial equation a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the a_is are integers (or equivalently, rational numbers) and r satisfies no ...