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.
No takes yet. Share an insight, caveat, or question.
Takahashi et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: