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

> but x^y will always be larger than y^x, for y>x and x^y > y^x

That’s trivially true, as that last condition equals the claim:

  but x^y > y^x, for y>x and x^y > y^x
      ^^^^^^^^^              ^^^^^^^^^
Also, if you leave out the and x^y > y^x part, that isn’t generally true because, for example 2⁴ = 4² and 1² < 2¹.

Another, minor, point: you write

> Why resort to the continuous domain to solve a problem n the discrete

and

> essentially we look for where the two 3d space surfaces intersect

Those two are in conflict with each other.



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

Search: