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 :-)
Count from 0 to N^M in base N.
Project Euler: Problem 3, Largest prime factor
Better bullseye matrix
Sum of diagonal of a square matrix
Find the biggest empty box
self description 2.0
Latest Question On Cody
Yet Another Path Finder
Tribute to Ramanujan
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