Search Results for ""

Also called the ménage problem. In how many ways can n married couples be seated around a circular table in such a manner than there is always one man between two women and ...

Assume that n numbered pancakes are stacked, and that a spatula can be used to reverse the order of the top k pancakes for 2<=k<=n. Then the pancake sorting problem asks how ...

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

Consider the consecutive number sequences formed by the concatenation of the first n positive integers: 1, 12, 123, 1234, ... (OEIS A007908; Smarandache 1993, Dumitrescu and ...

A number v=xy with an even number n of digits formed by multiplying a pair of n/2-digit numbers (where the digits are taken from the original number in any order) x and y ...

Replacing the logistic equation (dx)/(dt)=rx(1-x) (1) with the quadratic recurrence equation x_(n+1)=rx_n(1-x_n), (2) where r (sometimes also denoted mu) is a positive ...

The approximation problem is a well known problem of functional analysis (Grothendieck 1955). It asks to determine whether every compact operator T from a Banach space X to a ...

Suppose A and B are candidates for office and there are 2n voters, n voting for A and n for B. In how many ways can the ballots be counted so that B is never ahead of A? The ...

Does there exist an algorithm for deciding whether or not a specific mathematical assertion does or does not have a proof? The decision problem is also known as the ...

There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...