Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
forinti
on April 30, 2012
|
parent
|
context
|
favorite
| on:
Divisibility by 7 is a Walk on a Graph - how does ...
There's a sequence of numbers for jumping over all n-smooth numbers. The problem is that the sequences get very large very fast:
http://alquerubim.blogspot.com.br/2011/12/candidatos-primos....
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: