Search Results for ""
1 - 10 of 71 for laterSearch Results
When a Young tableau is constructed using the so-called insertion algorithm, an element starts in some position on the first row, from which it may later be bumped. In ...
Cauchy's functional equation is the equation f(x+y)=f(x)+f(y). It was proved by Cauchy in 1821 that the only continuous solutions of this functional equation from R into R ...
A recursive sequence {f(n)}_n, also known as a recurrence sequence, is a sequence of numbers f(n) indexed by an integer n and generated by solving a recurrence equation. The ...
The term "transition matrix" is used in a number of different contexts in mathematics. In linear algebra, it is sometimes used to mean a change of coordinates matrix. In the ...
If replacing each number by its square in a magic square produces another magic square, the square is said to be a bimagic square. Bimagic squares are also called doubly ...
In April 1999, Ed Pegg conjectured on sci.math that there were only finitely many zerofree cubes, to which D. Hickerson responded with a counterexample. A few days later, Lew ...
A right triangle whose legs are in the ratio 2:1 is sometimes known as a "dom," a name derived from "half a domino." The name was suggested by Andrew Clarke and preferred in ...
A structure consisting of an ordered set of sorted lists such that the head and tail entries of later lists nest within earlier ones. For example, an encroaching list set for ...
By choosing appropriate rules, it is possible to achieve many forms of synchronization within cellular automata. One version, known as the firing squad synchronization ...
A curve also known as Gutschoven's curve which was first studied by G. van Gutschoven around 1662 (MacTutor Archive). It was also studied by Newton and, some years later, by ...
...
View search results from all Wolfram sites (5095 matches)