Search Results for ""

A precise sequence of instructions designed to accomplish a given task. The implementation of an algorithm on a computer using a programming language is an example of a ...

A slightly archaic term for a computer-generated random number. The prefix pseudo- is used to distinguish this type of number from a "truly" random number generated by a ...

There are a number of functions in mathematics denoted with upper or lower case Qs. 1. The nome q. 2. A prefix denoting q-analogs and q-series. 3. Q_n or q_n with n=0, 1, 2, ...

A mathematical relationship expressing f_n as some combination of f_i with i<n. When formulated as an equation to be solved, recurrence relations are known as recurrence ...

Two links can be continuously deformed into each other iff any diagram of one can be transformed into a diagram of the other by a sequence of Reidemeister moves.

The sum of the aliquot divisors of n, given by s(n)=sigma(n)-n, where sigma(n) is the divisor function. The first few values are 0, 1, 1, 3, 1, 6, 1, 7, 4, 8, 1, 16, ... ...

Rule 30 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

A Shanks (a,b)-chain is a sequence of primes p_i of the form p_(i+1)=ap_i^2-b, with a and b integers. On Sep. 1, 2000, P. Leyland found a (4, 17)-chain of length 6, and on ...

The property intf(y)delta(x-y)dy=f(x) obeyed by the delta function delta(x).

sum_(n=1)^(infty)1/(phi(n)sigma_1(n)) = product_(p prime)(1+sum_(k=1)^(infty)1/(p^(2k)-p^(k-1))) (1) = 1.786576459... (2) (OEIS A093827), where phi(n) is the totient function ...