Search Results for ""

The sequence {|_(3/2)^n_|} is given by 1, 1, 2, 3, 5, 7, 11, 17, 25, 38, ... (OEIS A002379). The first few composite |_(3/2)^n_| occur for n=8, 9, 10, 11, 12, 13, 14, 15, 16, ...

Let p_n be the nth prime, then the primorial (which is the analog of the usual factorial for prime numbers) is defined by p_n#=product_(k=1)^np_k. (1) The values of p_n# for ...

A rational amicable pair consists of two integers a and b for which the divisor functions are equal and are of the form sigma(a)=sigma(b)=(P(a,b))/(Q(a,b))=R(a,b), (1) where ...

The rational distance problem asks to find a geometric configuration satisfying given properties such that all distances along specific edges are rational numbers. (This is ...

A polyhedron is said to be regular if its faces and vertex figures are regular (not necessarily convex) polygons (Coxeter 1973, p. 16). Using this definition, there are a ...

Self-recursion is a recursion that is defined in terms of itself, resulting in an ill-defined infinite regress. The formula for the volume of a cylinder leads to the ...

The square torus is the quotient of the plane by the integer lattice.

A special type of binary tree obtained by starting with the fractions 0/1 and 1/0 and iteratively inserting (m+m^')/(n+n^') between each two adjacent fractions m/n and ...

Graph Strength

A pair of numbers m and n such that sigma^*(m)=sigma^*(n)=m+n, where sigma^*(n) is the unitary divisor function. Hagis (1971) and García (1987) give 82 such pairs. The first ...