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 :-)
Select every other element of a vector
Which doors are open?
Distance walked 1D
Create a matrix X, where each column is a shifted copy of the vector v
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
Path of least resistance - Move all direction
Largest Geometric Series
longest common substring : Skipped character version
Latest Question On Cody
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