USAJMO 2025 Problem 2

Let $k$ and $d$ be positive integers. Prove that there exists a positive integer $N$ such that for every odd integer $n>N$ , the digits in the base- $2n$ representation of $n^k$ are all greater than $d$ .