MathCastle
Proof WritingHardExistence, Uniqueness and Counterexamples

Existence, Uniqueness and Counterexamples · Hard problem

Pigeonhole shows that some power 3n3^n with n≥1n \ge 1 ends in the digits 001001: two of 31,…,310013^1, \ldots, 3^{1001} agree mod 10001000, and dividing gives 3j−i≡13^{j - i} \equiv 1. What is the SMALLEST such nn?