function ans = arraygcd(a)
% a=[45 15 200 300];
Note that all solutions (which passed the limited test suite with small size) involving only pair-wise gcd calculations are indeed incorrect. Those solutions include the following ones: 1) min(gcd(a,min(a))); 2) min(gcd(a(1), a)); 3) min(min(bsxfun(@gcd,a,a.'))); To eliminate these incorrect solutions, please simply add a test case with a = [21 15 35].
Distance walked 3D
Project Euler: Problem 6, Natural numbers, squares and sums.
Sort numbers by outside digits
Getting logical indexes
Create matrix of replicated elements
Least common multiple of many numbers
Given an unsigned integer x, find the largest y by rearranging the bits in x
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