Question: prove language is not recursively enumerable?
Answer: A language is recursively enumerable if there is an algorithm that spits out all the strings in that language (in any order), and those strings only. A language is not recursively enumerable precisely when such an algorithm doesn't exist.