Search Results for ""

The square root method is an algorithm which solves the matrix equation Au=g (1) for u, with A a p×p symmetric matrix and g a given vector. Convert A to a triangular matrix ...

An unordered factorization is a factorization of a number into a product of factors where order is ignored. The following table lists the unordered factorizations of the ...

Two numbers which are relatively prime.

The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...

Find a way to stack a square of cannonballs laid out on the ground into a square pyramid (i.e., find a square number which is also square pyramidal). This corresponds to ...

An Artin L-function over the rationals Q encodes in a generating function information about how an irreducible monic polynomial over Z factors when reduced modulo each prime. ...

The fifth of Peano's axioms, which states: If a set S of numbers contains zero and also the successor of every number in S, then every number is in S.

Integrals over the unit square arising in geometric probability are int_0^1int_0^1sqrt(x^2+y^2)dxdy=1/3[sqrt(2)+sinh^(-1)(1)] int_0^1int_0^1sqrt((x-1/2)^2+(y-1/2)^2)dxdy ...

An even number of the form 4n+2 (i.e., an integer which is divisible by 2 but not by 4). The first few for n=0, 1, 2, ... are 2, 6, 10, 14, 18, ... (OEIS A016825)

R(p,tau)=int_(-infty)^inftyint_(-infty)^inftyf(x,y)delta[y-(tau+px)]dydx, (1) where f(x,y)={1 for x,y in [-a,a]; 0 otherwise (2) and ...