An NP-hard problem is not in NP. (If it was in NP, it would be an NP-complete problem not NP-hard.)
So my question is: if someone can find a polynomial-time algorithm for an NP-hard problem, would that means that P=NP?
I think yes (I am almost sure) but I can't find the reason why?