This paper investigates a topic inspired by a magic trick called the “Tantalizer”, which is a card game resembling the well-known Josephus Problem. We study the spectator-first Tantalizer problem with a deck of n-cards and investigate which card is left in the end after a series of dealing operations. A formula and an algorithm with a running time complexity based on the binary form of n are proposed to solve this problem.
