Search Results for ""

Any method which solves a problem by generating suitable random numbers and observing that fraction of the numbers obeying some property or properties. The method is useful ...

The Mordell conjecture states that Diophantine equations that give rise to surfaces with two or more holes have only finite many solutions in Gaussian integers with no common ...

The moth graph is the 6-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["MothGraph"].

A permutation problem invented by Cayley. Let the numbers 1, 2, ..., n be written on a set of cards, and shuffle this deck of cards. Now, start counting using the top card. ...

What is the sofa of greatest area S which can be moved around a right-angled hallway of unit width? Hammersley (Croft et al. 1994) showed that S>=pi/2+2/pi=2.2074... (1) ...

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

A set n distinct numbers taken from the interval [1,n^2] form a magic series if their sum is the nth magic constant M_n=1/2n(n^2+1) (Kraitchik 1942, p. 143). If the sum of ...

For n a positive integer, expressions of the form sin(nx), cos(nx), and tan(nx) can be expressed in terms of sinx and cosx only using the Euler formula and binomial theorem. ...

Multiple edges are two or more edges connecting the same two vertices within a multigraph. Multiple edges of degree d_(ij) between vertex i and vertex j correspond to an ...

A multiple integral is a set of integrals taken over n>1 variables, e.g., int...int_()_(n)f(x_1,...,x_n)dx_1...dx_n. An nth-order integral corresponds, in general, to an ...