Recursively enumerable but non recursive subset of an infinte recursive language
Hint. Let $S$ be any infinite recursive language. By considering, e.g., the lexicographic order, we can talk of the first, second, third, etc. strings in&nbsp;$S$. Use this indexing to define what you need to define.