# surprizing reducibility and challeng on it

Problem $$A$$ is polynomial reducible to problem $$B$$.

If problem $$A$$ is NP-hard then problem $$B$$ is NP-hard

If problem $$B$$ is NP-hard then problem $$A$$ is NP-hard

``````First fact is obviously true, but why the second one is false?
``````