Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
nhaehnle
on Feb 13, 2015
|
parent
|
context
|
favorite
| on:
A regular expression to check for prime numbers
You really have to put parentheses when building "towers" of exponentials. The bound is (2^n)^2, which simplifies to 2^(2n). This is of course still horrible, but much less so than the 2^(n^2) for which what you wrote may be mistaken.
j2kun
on Feb 13, 2015
|
next
[–]
Yeah, I realized that after the edit link expired. Let's just disambiguate the expression in whatever way makes me look best :)
quadratini
on Feb 13, 2015
|
prev
|
next
[–]
It's right associative, normally :)
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: