## Task

Write a method `remainder` which takes two integer arguments, `dividend` and `divisor`, and returns the remainder when dividend is divided by divisor. Do NOT use the modulus operator (%) to calculate the remainder!

#### Assumption

Dividend will always be `greater than or equal to` divisor.

#### Notes

Make sure that the implemented `remainder` function works exactly the same as the `Modulus operator (%)`.

```if:java
`SimpleInteger` is a tiny and immutable implementation of an integer number. Its interface is a very small subset of the `java.math.BigInteger` API:

* `#add(SimpleInteger val)`
* `#subtract(SimpleInteger val)`
* `#multiply(SimpleInteger val)`
* `#divide(SimpleInteger val)`
* `#compareTo(SimpleInteger val)`
```

Source: codewars | Difficulty: EASY
Tags: Mathematics

Starter code: def remainder(dividend, divisor):
	

Solutions:
def remainder(dividend, divisor):
	while divisor <= dividend:
		dividend = dividend - divisor
	return dividend


from operator import mod as remainder
remainder = int.__mod__


def remainder(d1, d2):
	return d1 % d2


def remainder(dividend, divisor):
	return dividend - dividend // divisor * divisor if divisor else None


from math import floor

def remainder(dividend, divisor):
	return 'NaN' if divisor == 0 else dividend - floor(dividend / divisor) * divisor


def remainder(dividend, divisor):
	return dividend - dividend // divisor * divisor


def remainder(a, b):
	return a % b