Wouldn’t that be 3n + 1? n passengers already present, another 2n + 1 enter, resulting in a total of 3n + 1. Doing it in my head, we seem to always end up in a cycle of 4 -> 2 -> 1 -> 4. All of these are < 5, so once we enter that cycle, the number of possible passengers killed is always less than five.
2n+1 is not in the Collatz conjecture.
Mathematics is not ready for such carelessness.
And I did a dumb. Withdrawn.
Wouldn’t that be 3n + 1? n passengers already present, another 2n + 1 enter, resulting in a total of 3n + 1. Doing it in my head, we seem to always end up in a cycle of 4 -> 2 -> 1 -> 4. All of these are < 5, so once we enter that cycle, the number of possible passengers killed is always less than five.