Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

That's quite the nerd snipe.

I mean, it's definitely not a Diophantine equation and solving it is definitely not challenging -- (2, 1, 1) happens to be an easy solution -- but I want to say it probably doesn't have any other solutions but I don't see a great way to prove it...



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: