Search Results for ""

In 1913, Ramanujan asked if the Diophantine equation of second order 2^n-7=x^2, sometimes called the Ramanujan-Nagell equation, has any solutions other than n=3, 4, 5, 7, and ...

The sum c_q(m)=sum_(h^*(q))e^(2piihm/q), (1) where h runs through the residues relatively prime to q, which is important in the representation of numbers by the sums of ...

Given the generating functions defined by (1+53x+9x^2)/(1-82x-82x^2+x^3) = sum_(n=1)^(infty)a_nx^n (1) (2-26x-12x^2)/(1-82x-82x^2+x^3) = sum_(n=0)^(infty)b_nx^n (2) ...

For a point y in Y, with f(y)=x, the ramification index of f at y is a positive integer e_y such that there is some open neighborhood U of y so that x has only one preimage ...

The ramp function is defined by R(x) = xH(x) (1) = int_(-infty)^xH(x^')dx^' (2) = int_(-infty)^inftyH(x^')H(x-x^')dx^' (3) = H(x)*H(x), (4) where H(x) is the Heaviside step ...

A type of cusp as illustrated above for the curve x^4+x^2y^2-2x^2y-xy^2+y^2=0.

The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...

The mathematical study of combinatorial objects in which a certain degree of order must occur as the scale of the object becomes large. Ramsey theory is named after Frank ...

Ramsey's theorem is a generalization of Dilworth's lemma which states for each pair of positive integers k and l there exists an integer R(k,l) (known as the Ramsey number) ...

A type of binary tree.