Hacker News new | ask | show | jobs
by knlje 2140 days ago
Doesn't it read that "for all x, y \in {0, 1}^n"?
1 comments

For 2^n of such pairs x, y, it happens that x = y. But checking the description of Simon's Problem on Wikipedia, it appears that case is excluded, so that x = y ⊕ c doesn't have to hold if x = y.