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].
Make a checkerboard matrix
Who Has the Most Change?
Implement a ROT13 cipher
Find state names that start with the letter N
Back to basics 7 - Equal NaNs
count any radix?
Given a square and a circle, please decide whether the square covers more area.
How to multiply?
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