Extension to problem 2479:
Determine the number of complete set of Mongean shuffles required to get the original status of a deck of cards of length n.
Brute force :-)
Spot the outlier
Largest Twin Primes
Rounding off numbers to n decimals
Polite numbers. N-th polite number.
Graph Algorithms 3: Number of Connected Components
Beauty of Parentheses
Integer sequence - 2 : Kolakoski sequence
FIFA World Cup 2014 : Offside
all possible subsets of set
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office