Search Results for ""

A grand unified theory of mathematics which includes the search for a generalization of Artin reciprocity (known as Langlands reciprocity) to non-Abelian Galois extensions of ...

Using the notation of Byerly (1959, pp. 252-253), Laplace's equation can be reduced to (1) where alpha = cint_c^lambda(dlambda)/(sqrt((lambda^2-b^2)(lambda^2-c^2))) (2) = ...

The logistic equation (sometimes called the Verhulst model or logistic growth curve) is a model of population growth first published by Pierre Verhulst (1845, 1847). The ...

The first few prime Lucas numbers L_n are 2, 3, 7, 11, 29, 47, 199, 521, 2207, 3571, ... (OEIS A005479), corresponding to indices n=0, 2, 4, 5, 7, 8, 11, 13, 16, 17, 19, 31, ...

Consider the sequence of partial sums defined by s_n=sum_(k=1)^n(-1)^kk^(1/k). (1) As can be seen in the plot above, the sequence has two limit points at -0.812140... and ...

The Maclaurin trisectrix is a curve first studied by Colin Maclaurin in 1742. It was studied to provide a solution to one of the geometric problems of antiquity, in ...

Multiple edges are two or more edges connecting the same two vertices within a multigraph. Multiple edges of degree d_(ij) between vertex i and vertex j correspond to an ...

Given a curve C and O=(x_0,y_0) a fixed point called the pedal point, then for a point P on C, draw a line perpendicular to OP. The envelope of these lines as P describes the ...

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 game which is played by the following rules. Given one or more piles (nim-heaps), players alternate by taking all or some of the counters in a single heap. The player ...