I think that with this kind of problem, you can process in two steps.
A first easy problem with small N (to test perms for example). And a harder problem with big N, which
oblige to find another algorithm.
Prime factor digits
Longest Divisor Run
Create a cell array out of a struct
Is it a number?
Singularity v5 (with apologies to the true hack masters)
The Hills Are Alive...
Should Mr McNugget even get out of bed today?
Some Assembly Required
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