tsdfsfsdfsfd

Theorem: Given any two Natural numbers n (dividend) and d (divisor) where d>0, there exists only one couple of natural nambers q (quotient) and r (reminder) such that n = q * d + r with r is less than d.

Program requrements: Given any two Natural numbers n and d with d>0 as input, the present program checks if n is a multiple of d (i. e., the reminder r above is equal to 0) or not.