In this study, we study the relation between Grundy numbers of a Maximum Nim and Josephus problem. Let f(x) = floor(x/k), where floor( ) is the floor function and k is a positive integer. We prove that there is a simple relation with a Maximum Nim with the rule function f and the Josephus problem in which every k-th numbers are to be removed.