Haskell 0 additions, 29 bytes
n/m=[i|i<-[0..],_<-[1..m]]!!n
this redefines the division operator (/
). it works by making a list of 0
to infinity where each item is repeated m
times, and then choosing the nth element of the list (using a 0-based index).