Search Results for ""

The Euler polynomial E_n(x) is given by the Appell sequence with g(t)=1/2(e^t+1), (1) giving the generating function (2e^(xt))/(e^t+1)=sum_(n=0)^inftyE_n(x)(t^n)/(n!). (2) ...

A diagram lemma which states that, given the commutative diagram of additive Abelian groups with exact rows, the following holds: 1. If f_0 is surjective, and f_1 and f_3 are ...

A connected graph is said to be highly irregular if the neighbors of each vertex have distinct vertex degrees. Highly irregular graphs exist on all orders except 3, 5 and 7, ...

The prime HP(n) reached starting from a number n, concatenating its prime factors, and repeating until a prime is reached. For example, for n=9, 9=3·3->33=3·11->311, so 311 ...

Given a unit line segment [0,1], pick two points at random on it. Call the first point x_1 and the second point x_2. Find the distribution of distances d between points. The ...

Given a square complex or real matrix A, a matrix norm ||A|| is a nonnegative number associated with A having the properties 1. ||A||>0 when A!=0 and ||A||=0 iff A=0, 2. ...

Newton's iteration is an algorithm for computing the square root sqrt(n) of a number n via the recurrence equation x_(k+1)=1/2(x_k+n/(x_k)), (1) where x_0=1. This recurrence ...

A polyhedral nonhamiltonian graph is a graph that is simultaneously polyhedral and nonhamiltonian. The smallest possible number of vertices a nonhamiltonian polyhedral graph ...

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