# Task
**_Given_** a **_Divisor and a Bound_** , *Find the largest integer N* , Such That , 
# Conditions :
* **_N_**  is *divisible by divisor*
* **_N_**  is *less than or equal to bound* 
* **_N_**  is *greater than 0*.
___
# Notes 
* The **_parameters (divisor, bound)_** passed to the function are *only positive values* .
* *It's guaranteed that* a **divisor is Found** .
___
# Input >> Output Examples 
```
maxMultiple (2,7) ==> return (6)
```
## Explanation: 
**_(6)_** is divisible by **_(2)_** , **_(6)_** is less than or equal to bound **_(7)_** , and **_(6)_** is > 0 .
___
```
maxMultiple (10,50)  ==> return (50)
```
## Explanation:
**_(50)_** *is divisible by* **_(10)_** , **_(50)_** is less than or equal to bound **_(50)_** , and **_(50)_** is > 0 .*
___
```
maxMultiple (37,200) ==> return (185)
```
## Explanation:
**_(185)_** is divisible by **_(37)_** , **_(185)_** is less than or equal to bound **_(200)_** , and **_(185)_** is > 0 .
___
___
## [Playing with Numbers Series](https://www.codewars.com/collections/playing-with-numbers)
# [Playing With Lists/Arrays Series](https://www.codewars.com/collections/playing-with-lists-slash-arrays)
# [Bizarre Sorting-katas](https://www.codewars.com/collections/bizarre-sorting-katas)
# [For More Enjoyable Katas](http://www.codewars.com/users/MrZizoScream/authored)
___
## ALL translations are welcomed
## Enjoy Learning !!
# Zizou
~~~if:java
Java's default return statement can be any `int`, a divisor **will** be found.
~~~
~~~if:nasm
## NASM-specific notes
The function declaration is `int max_multiple(int divisor, int bound)` where the first argument is the divisor and the second one is the bound.
~~~
def max_multiple(divisor, bound):
    for num in range(bound,0,-1):
        if num% divisor == 0:
            return num
    return "none"
def max_multiple(divisor, bound):
    for num in range(bound,0,-1):
        if num% divisor == 0:
            return num
    return "none"