### Task

Given two strictly positive integers **n** and **d** as input, determine whether **n** is [evenly divisible][divisibility] by **d**, i.e., if there exists an integer **q** such that **n = qd**.

You may write a [program or a function][p/f] and use any of the our [standard methods][I/O] of receiving input and providing output.

The output should be a [truthy or a falsy value][t/f]; truthy if **n** is divisible by **d**, and falsy otherwise.

Your code only has to handle integers it can represent natively, as long as it works for all signed 8-bit integers. However, your *algorithm* has to work for arbitrarily large integers.

You may use any [programming language], but note that [these loopholes][loopholes] are forbidden by default.

This is [tag:code-golf], so the shortest valid answer – measured in *bytes* – wins.

### Test cases

     n,  d    output

     1,  1    truthy
     2,  1    truthy
     6,  3    truthy
    17, 17    truthy
    22,  2    truthy
     1,  2    falsy
     2,  3    falsy
     2,  4    falsy
     3,  9    falsy
    15, 16    falsy

[divisibility]: https://en.wikipedia.org/wiki/Divisibility_rule
[I/O]: http://meta.codegolf.stackexchange.com/q/2447
[t/f]: http://meta.codegolf.stackexchange.com/a/2194
[p/f]: http://meta.codegolf.stackexchange.com/q/2419
[loopholes]: http://meta.codegolf.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default
[programming language]: http://meta.codegolf.stackexchange.com/q/2028