Find if a number is divisible by another number using recursion

Question

How would I check if a number is divisible by another using recursion in python?

This is my code so far, but I would like to make it recursive.

def is_divisable(num, div):
    if num % div == 0:
        return True
    else:
        False

Answer 1

For educational purposes, you could keep subtracting until you reach 0 or below:

def is_divisible(num, div):
    while(num > 0):
        num -= div
    return num == 0

Using this logic you can make it recursive (Thanks to Anonymous for pointing out the above version is not recursive):

def is_divisible(num, div):
    if (num == 0):
        return True
    elif (num < 0):
        return False
    return is_divisible(num-div, div)

However, the correct way would be:

def is_divisible(num, div):
    return num % div == 0

Answer 2

def is_divisable(num,div):
    if num<div:
        return num %div==0
    else:
        return is_divisable(num-div,div)