I am sure there are other more subtle ways to go about it but this seems about as fast as I can make it for a general brute-force solution (0.11s)
This one seems to work for the large test case, too, although it is not a general solution [for size(p,1)>100 it only tests corner points].
Return the 3n+1 sequence for n
Matrix indexing with two vectors of indices
Modular multiplicative inverse
Min of a Matrix
Usage of java.math : Add, Multiply, Pow
Kaggle: Planetoid Game of Life - Total Score 0.10
QWERTY Shift Code Decoder
Top of the Hour : Return from your routine within 1 second of the hour
GJam 2016 Rd1A: Rank and File (small)
Find the treasures in MATLAB Central and discover how the community can help you!
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