Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
nullc
on June 13, 2019
|
parent
|
context
|
favorite
| on:
Fast constant-time GCD algorithm and modular inver...
I have an O(N) algorithm for factoring any prime: Read each digit of the prime from the input tape and write it to the output tape. :P
(Perhaps you meant factoring large semi-primes? :) )
hoseja
on June 13, 2019
[–]
I have an O(1) then!
ColinWright
on June 13, 2019
|
parent
[–]
Given that you have to read and then write each digit of the input I find it hard to believe that you have an O(1) algorithm - can you tell us what it is?
Yajirobe
on June 13, 2019
|
root
|
parent
|
next
[–]
Take a photo of the input on the tape and print the photo.
mratsim
on June 13, 2019
|
root
|
parent
|
next
[–]
Depending of the size of the prime you might need to take multiple photos.
hoseja
on June 14, 2019
|
root
|
parent
|
prev
[–]
Print "1", thought that would be obvious...
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
(Perhaps you meant factoring large semi-primes? :) )