Search Results for ""

The point T at which the lines through the polygon vertices of a triangle perpendicular to the corresponding sides of the first Brocard triangle, are concurrent. The Tarry ...

An exponential sum of the form sum_(n=1)^Ne^(2piiP(n)), (1) where P(n) is a real polynomial (Weyl 1914, 1916; Montgomery 2001). Writing e(theta)=e^(2piitheta), (2) a notation ...

A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...

The Eisenstein integers, sometimes also called the Eisenstein-Jacobi integers (Finch 2003, p. 601), are numbers of the form a+bomega, where a and b are normal integers, ...

There are a number of equations known as the Riccati differential equation. The most common is z^2w^('')+[z^2-n(n+1)]w=0 (1) (Abramowitz and Stegun 1972, p. 445; Zwillinger ...

When discussing a rotation, there are two possible conventions: rotation of the axes, and rotation of the object relative to fixed axes. In R^2, consider the matrix that ...

Consider a game, first proposed by Nicolaus Bernoulli, in which a player bets on how many tosses of a coin will be needed before it first turns up heads. The player pays a ...

Schmidt (1993) proposed the problem of determining if for any integer r>=2, the sequence of numbers {c_k^((r))}_(k=1)^infty defined by the binomial sums sum_(k=0)^n(n; ...

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 ...

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...