Please help, I need to prove there is some n > 0 \in Naturals such that there is no one-to-one function from n-length strings from the alphabet to binary strings of length 4.6n+1000 (rounded down). So I think I need to show that there is some n where 26^n is > 2^4.6n+1000 but I could not find one. Am I correct on what I need to do??