Search Results for ""

Let n be a positive integer and r(n) the number of (not necessarily distinct) prime factors of n (with r(1)=0). Let O(m) be the number of positive integers <=m with an odd ...

The rectilinear crossing number of a graph G is the minimum number of crossings in a straight line embedding of G in a plane. It is variously denoted rcr(G), cr^_(G) ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...

The central factorials x^([k]) form an associated Sheffer sequence with f(t) = e^(t/2)-e^(-t/2) (1) = 2sinh(1/2t), (2) giving the generating function ...

The polyhedron compound of the truncated icosahedron and its dual, the pentakis dodecahedron. The compound can be constructed from a truncated icosahedron of unit edge length ...

A number which is simultaneously a heptagonal number H_n and square number S_m. Such numbers exist when 1/2n(5n-3)=m^2. (1) Completing the square and rearranging gives ...

Let H_n denote the nth hexagonal number and S_m the mth square number, then a number which is both hexagonal and square satisfies the equation H_n=S_m, or n(2n-1)=m^2. (1) ...

A number which is simultaneously a nonagonal number N_m and heptagonal number Hep_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=1/2n(5n-4). (1) Completing the ...

A number which is simultaneously a nonagonal number N_m and octagonal number O_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=n(3n-2). (1) Completing the ...