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 $O(\log n)$ based on the binary form of n are proposed to solve this problem.

中文翻译：

---

观众优先Tantalizer问题的一般解决方案

本文研究了一个受魔术魔术启发的主题，称为“诱骗者”，这是一种类似于著名的约瑟夫斯问题的纸牌游戏。我们用一副n张牌研究观众优先的Tantalizer问题，并调查在一系列发牌操作后最后剩下哪张牌。一个具有运行时间复杂度的公式和算法$哦(\mathrm{日志}n)$提出了基于n的二进制形式来解决这个问题。