Search Results for ""

Let the number of random walks on a d-D hypercubic lattice starting at the origin which never land on the same lattice point twice in n steps be denoted c_d(n). The first few ...

Square line picking is the selection of pairs of points (corresponding to endpoints of a line segment) randomly placed inside a square. n random line segments can be picked ...

The Struve function, denoted H_n(z) or occasionally H_n(z), is defined as H_nu(z)=(1/2z)^(nu+1)sum_(k=0)^infty((-1)^k(1/2z)^(2k))/(Gamma(k+3/2)Gamma(k+nu+3/2)), (1) where ...

A figurate number Te_n of the form Te_n = sum_(k=1)^(n)T_k (1) = 1/6n(n+1)(n+2) (2) = (n+2; 3), (3) where T_k is the kth triangular number and (n; m) is a binomial ...

Transitivity is a result of the symmetry in the group. A group G is called transitive if its group action (understood to be a subgroup of a permutation group on a set Omega) ...

Two lattice points (x,y) and (x^',y^') are mutually visible if the line segment joining them contains no further lattice points. This corresponds to the requirement that ...

Discrete Mathematics

The game of billiards is played on a rectangular table (known as a billiard table) upon which balls are placed. One ball (the "cue ball") is then struck with the end of a ...

A polynomial given by Phi_n(x)=product_(k=1)^n^'(x-zeta_k), (1) where zeta_k are the roots of unity in C given by zeta_k=e^(2piik/n) (2) and k runs over integers relatively ...

Any two rectilinear figures with equal area can be dissected into a finite number of pieces to form each other. This is the Wallace-Bolyai-Gerwien theorem. For minimal ...