Linear Josephus Problem

関西学院高等部数理科学部が証明した変形ヨセフス問題を元にして作成したアプリです。
nはプレイヤの数です。まず最初に一番左からr番目ごとにプレイヤを消していき、
一番端に到達したとき、方向を変え、同じようにr番目ごとにプレイヤを消していきます。
それをプレイヤが最後の1人になるまで繰り返します。
その最後の数字がJosephus Numberです。
Josephus Numberを当てるゲームを楽しんで下さい。

This is a variant of the Josephus problem. There are n players in a line. Beginning with the first player, move from left to right, removing every rth player. Change the direction at the end of the line and again remove every rth player.

Programming:Masnaori Fukui(ER Computing)
Icon:Ryo Hanafusa(Kwansei Gakuin University)

(Special Thanks)
Dr.Ryohei Miyadera(Kwansei Gakuin Senior High School), and Kwansei Gakuin Senior High School Mathematical Sciences Club All Members(includes OB). It is an application that was created on the basis of a deformation Josephus problem Kwansei Gakuin higher number of copies undergraduate science proved.
n is the number of the player. It will turn off the player in each position r from the far left first,
When it reaches the extreme, to change the direction, we will turn off the player in each position r in the same way.
I repeat player until the last one of them.
Number of the last is Josephus Number.
Enjoy the game shed Josephus Number.

This is a variant of the Josephus problem. There are n players in a line. Beginning with the first player, move from left to right, removing every rth player. Change the direction at the end of the line and again remove every rth player.

Programming: Masnaori Fukui (ER Computing)
Icon: Ryo Hanafusa (Kwansei Gakuin University)

(Special Thanks)
Dr.Ryohei Miyadera (Kwansei Gakuin Senior High School), and Kwansei Gakuin Senior High School Mathematical Sciences Club All Members (includes OB).