We have n people standing in a circle, and we count in a fixed direction to eliminate the k-th person after skipping k-1 people.
This elimination process continues until only one person remains, and our goal is to determine the position of this survivor in the initial arrangement.
If there is only one person (n=1), they obviously survive, so the survivor’s position is 0 (using zero-based indexing).
For n > 1, we eliminate one person and then solve the problem for n-1 people, adjusting the position based on the elimination.
Mathematically, the recursive relation is:

Base case: Josephus(1, k) = 0 (If there's only one person, their position is 0).
Recursive case: For n > 1, the survivor’s position can be found with the relation:

Josephus(n, k) = (Josephus(n-1, k) + k) % n
This means that after eliminating the k-th person, the new survivor's position in the reduced circle is computed and adjusted by adding k, followed by taking modulo n to keep the position within bounds.