Search Results for ""

Calculus II

A Gray code is an encoding of numbers so that adjacent numbers have a single digit differing by 1. The term Gray code is often used to refer to a "reflected" code, or more ...

The Hall-Janko graph, also known as the Hall-Janko-Wales graph, is a strongly regular graph on 100 nodes with parameters (nu,k,lambda,mu)=(100,36,14,12). It is also a ...

The conjecture that the number of alternating sign matrices "bordered" by +1s A_n is explicitly given by the formula A_n=product_(j=0)^(n-1)((3j+1)!)/((n+j)!). This ...

The Chu-Vandermonde identity _2F_1(-n,b;c;1)=((c-b)_n)/((c)_n) (1) (for n in Z^+) is a special case of Gauss's hypergeometric theorem _2F_1(a,b;c;1) = ((c-b)_(-a))/((c)_(-a)) ...

The multicomputational paradigm is a generalization of the computational paradigm to many computational threads of time. In the ordinary computational paradigm, time ...

The ruliad may be defined as the entangled limit of everything that is computationally possible, i.e., the result of following all possible computational rules in all ...

A puzzle involving disentangling a set of rings from a looped double rod, originally used by French peasants to lock chests (Steinhaus 1999). The word "baguenaudier" means ...

A notion introduced by R. M. Wilson in 1974. Given a finite graph G with n vertices, puz(G) is defined as the graph whose nodes are the labelings of G leaving one node ...

Two trains are on the same track a distance 100 km apart heading towards one another, each at a speed of 50 km/h. A fly starting out at the front of one train, flies towards ...