Problem

Source:

Tags: combinatorics



Consider words made with letters $A_1, . . . ,A_{2023}$. We call a word humble if and only if it contains an even number of $A_1$’s and an odd number of $A_2$’s. Let $s$ be the number of humble words of length $2023$. Enter $s$ mod $1000$.