What is the smallest positive integer n such that 3n = 1356 (mod 27).

1356 leaves a remainder of 6 when divided by 27 (you can check using long division.

The problem reduces to: \(3n \equiv 6 (\text{mod 27})\). In other words, what is the smallest number that when multiplied by 3 is equal to 6?