TOPICS
Search

Search Results for ""


911 - 920 of 2089 for Eulers Polygon Division ProblemSearch Results
An integer n which is tested to see if it divides a given number.
A finite division algebra is a field.
The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...
A prime number (or prime integer, often simply called a "prime" for short) is a positive integer p>1 that has no positive integer divisors other than 1 and p itself. More ...
A polyomino is a generalization of the domino to a collection of n squares of equal size arranged with coincident sides. Polyominos were originally called "super-dominoes" by ...
An operator defined on a set S which takes two elements from S as inputs and returns a single element of S. Binary operators are called compositions by Rosenfeld (1968). Sets ...
The only nonassociative division algebra with real scalars. There is an 8-square identity corresponding to this algebra. The elements of a Cayley algebra are called Cayley ...
A fallacy is an incorrect result arrived at by apparently correct, though actually specious reasoning. The great Greek geometer Euclid wrote an entire book on geometric ...
The Pippenger product is an unexpected Wallis-like formula for e given by e/2=(2/1)^(1/2)(2/34/3)^(1/4)(4/56/56/78/7)^(1/8)... (1) (OEIS A084148 and A084149; Pippenger 1980). ...
The term "product" refers to the result of one or more multiplications. For example, the mathematical statement a×b=c would be read "a times b equals c," where a is called ...
1 ... 89|90|91|92|93|94|95 ... 209 Previous Next

...