Distinct representative of the halting many-one degree (source code)

= Distinct representative of the halting many-one degree

If $0\notin K$, then
$$
S=\{0\}\cup\{2n+1:n\in K\}
$$
differs from $K$, while the computable map $n\mapsto2n+1$ proves $K\leq_mS$.

The <set> $S$ is also a <computably enumerable set>, so the <many-one completeness of the halting problem> gives $S\leq_mK$. Together the two <many-one reductions> place $S$ and $K$ in the same <many-one degree>.