##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Checking divisibility
A number is divisible by if . A number is divisible by if . Both conditions use modulo to check divisibility.
The tricky part is the order of checks. You must check divisibility by both and first. If you check first and return "Fizz", you never get to check .
For , both and are true, so you output "FizzBuzz".
