yes, some NP-hard problems cannot be reduced to a NP problem or otherwise NP-hard = NPC. i.e., if you reduce any NP-hard problem to a NP problem, that problem now becomes NPC. It is all given in the definitions of NP,NPC and NP-hard - yes some by-heart required here and then you can think logically.