Isn't this a duplicate of the gcd question? The only difference is checking if the gcd is equal to the smaller number?

@FryAmTheEggman gcd(12,14) = 2, but 12 and 14 are not divisible by the other.

@TimmyD I edited my comment, you're right, but I still think this is extremely close...

Unless this is actually a duplicate of another challenge, I don't get the downvotes. We need entry level challenges for new users and Turing tarpits.

@Dennis I don't see how posting endless 1~3 byte builtin solutions in languages new users have never heard of before will encourage new users to participate.

@TimmyD OK, yes, it could use a better description and a few test cases, despite the simplicity. A catalog snippet would also be a good idea, since there will probably be more than just a few answers.

if one is divisible by the other Does that mean the first by the second, or either by the other? Test cases? Can output be any truthy / falsey value? The current wording of the challenge is too terse in my opinion

Also, what's the relationship with the linked paper? I suggest you explain that, or remove the reference. If the relantionship is just that your challenge is one-line long, I'm afraid it will have to be quite a few lines more, because currently it's unclear (see my previous comment)

Can we output truthy if non-divisible and falsy if divisible? What are possible outputs?

I’m with the others here: such a “simple” challenge deserves an extremely solid specification.

I've made an extensive edit. Please feel free to undo any changes you disagree with.

@Eʀɪᴋ That was directed at the author. Please don't remove useful parts of a question because someone might not want it. If the author doesn't want the leaderboard, he can always remove it himself. And I already joined the chat room you created and told you I was listening. Why do you keep posting comments here and tell me we should talk there?

Thank you to those who edited my question :)

I'm assuming that d=0 should return false except when n=0, correct?