1 citations · 3 across the 21 of their papers we have counts for
4 papers · 1 filter
A New 0(klog n) Algorithm for Josephus Problem
Hikaru Manabe, Ryohei Miyadera, Yuji Sasaki +2
We present a new O(k log n) algorithm of the Josephus problem. The time complexity of our algorithm is O(k log n), and this time complexity is on a par with the existing O(k log n)…
A Problem of Knot
Ryohei Miyadera, Hikaru Manabe, Aoi Murakami +1
In this article, the authors give the correct answer to the following problem, which is presented in the well-known problem book "CHALLENGING MATHEMATICAL PROBLEMS WITH ELEMENTARY…
Maximum Nim and Josephus Problem algorithm
Shoei Takahashi, Hikaru Manabe, Ryohei Miyadera
In this study, we study a Josephus problem algorithm. Let be positive integers and , where $ \left\lfloor \ \ \right\rfl…
Maximum Nim and Josephus Problem
Shoei Takahashi, Hikaru Manabe, Ryohei Miyadera
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 i…