Search Results for ""

A method used by Gauss to solve the quadratic Diophantine equation of the form mx^2+ny^2=A (Dickson 2005, pp. 391 and 407).

A matrix with 0 determinant whose determinant becomes nonzero when any element on or below the diagonal is changed from 0 to 1. An example is M=[1 -1 0 0; 0 0 -1 0; 1 1 1 -1; ...

A number b_(2n) having generating function sum_(n=0)^(infty)b_(2n)x^(2n) = 1/2ln((e^(x/2)-e^(-x/2))/(1/2x)) (1) = 1/2ln2+1/(48)x^2-1/(5760)x^4+1/(362880)x^6-.... (2) For n=1, ...

In above figure, which constitutes a modified version of the painting Tirets by Francois Morellet, small circles seem to appear and disappear as the eye is moved over them.

Morley's circle is the circumcircle of the first Morley triangle. Its center is the first Morley center, which has center function alpha_(356)=cos(1/3A)+2cos(1/3B)cos(1/3C), ...

For a given n, is the problem of determining if a set is mortal solvable? n=1 is solvable, n=2 is unknown, and n>=3 is unsolvable.

A necessary and sufficient condition that [alpha^'] should be comparable with [alpha] for all positive values of the a is that one of (alpha^') and (alpha) should be ...

Place 2n balls in a bag and number them 1 to 2n, then pick half of them at random. The number of different possible sums for n=1, 2, 3, ... are then 2, 5, 10, 17, 26, ... ...

Numerical stability refers to how a malformed input affects the execution of an algorithm. In a numerically stable algorithm, errors in the input lessen in significance as ...

The sum of the first n odd numbers is a square number, sum_(k=1)^n(2k-1)=n^2. A sort of converse also exists, namely the difference of the nth and (n-1)st square numbers is ...