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
6293 Solvers
Matrix indexing with two vectors of indices
498 Solvers
77 Solvers
Modular multiplicative inverse
17 Solvers
531 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!