Sorry but I don't know how to deal big number.
Here's another CODY problem that deals with something similar:
Project Euler: Problem 16, Sums of Digits of Powers of Two
Combinations without using nchoosek
We love vectorized solutions. Problem 1 : remove the row average.
Make a 1 hot vector
Say something funny
Unique dice configurations
Lowest sum from a group of digits
Pandigital Multiples of 11 (based on Project Euler 491)
Crunch that matrix!
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