Wolfram|Alpha introduces a fundamentally new way to get knowledge and answers—
not by searching the web, but by doing dynamic computations based on a vast collection of built-in data, algorithms, and methods.

'-- the Josephus Problem sequence
Dim listOfPeople As New List(Of Int32)

Dim lHowManyPeopleTotal As Int32 = 30
Dim lNthPerson As Int32 = 3

Dim location As Int32 = 0 '-- the temporary location to remove from the collection.

'-- fill our list with numbered people.
For i As Int32 = 1 To lHowManyPeopleTotal
listOfPeople.Add(i)
Next

lNthPerson -= 1 '-- remember the array list starts its index at 0

While listOfPeople.Count > 1 '-- run until there is only one item in the list left.
location += lNthPerson '-- from our current location add the number of steps we need to take.

While location >= listOfPeople.Count '-- if that number of steps is more than the items in the array wrap around.
location = location - listOfPeople.Count '-- this will happen frequently when when the # of steps is greater than the number of items.
End While

Console.WriteLine(listOfPeople(location)) '-- show what was removed
listOfPeople.RemoveAt(location) '-- remove it.
End While

Console.WriteLine("winner! " + listOfPeople(0).ToString) '-- show the winning spot!