Given two integers n1, n2 greater than 1, find out if they have common divisors or are prime to each other. Return "true" if they have common divisors and "false" if they are prime to each other.
It seems to me that the logic of the test suite is reversed. You're asking if the numbers are coprime and yet want 0 (false) when they are.
@Guillaume: Your are right.
I re-wrote the text. The english got worse, but the clarity increased, I hope:))
I submitted this just to see if one can get away with a blatant cheat!
Until the test suite is changed, yes. Yes you can.
Well, test suite changed :)
Does the "tf = n1==27" still work? :)
My cheat does not pass new test suite, but tf = n2==123 does.
@Are Mjaavatten: Your are terrible:). I will change (improve:)) again the test-suite.
Number of Circles in a Number
Back to basics 22 - Rotate a matrix
Return the Fibonacci Sequence
multiple of nine?
Number of occurrences of letter in a text
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