Table of Contents
Fetching ...

On $\frac{1}{n!}$ in Cantor sets

Kehao Lin, Yufeng Wu, Siyu Yang

Abstract

Let $C$ be the middle-third Cantor set. We show that \[\left\{\frac{1}{n!}: n\in\mathbb{N}\right\}\cap C=\left\{1, \frac{1}{5!}\right\}.\] This answers a question recently posed by Jiang [J. Lond. Math. Soc., 2026, published online]. Our approach generalizes to general missing-digit sets, showing that, in any such set, there are only finitely many elements of the form $\frac{1}{n!}$, all of which can be effectively determined.

On $\frac{1}{n!}$ in Cantor sets

Abstract

Let be the middle-third Cantor set. We show that This answers a question recently posed by Jiang [J. Lond. Math. Soc., 2026, published online]. Our approach generalizes to general missing-digit sets, showing that, in any such set, there are only finitely many elements of the form , all of which can be effectively determined.

Paper Structure

This paper contains 2 sections, 6 theorems, 23 equations, 1 table, 1 algorithm.

Key Result

Theorem 1.2

We have

Theorems & Definitions (10)

  • Theorem 1.2
  • Definition 1.3
  • Theorem 1.4
  • Lemma 2.1
  • Lemma 2.2
  • proof
  • Lemma 2.3
  • Lemma 2.4
  • proof : Proof of Lemma \ref{['lemordMn']}
  • proof : Proof of Theorem \ref{['thmCn!']}