Want to factorize 15 digit number.I have implemented the fermat's thm but it is not suitable for numbers having factor not close to square root of that number .Suggest me some methods .Thanx
Want to factorize 15 digit number.I have implemented the fermat's thm but it is not suitable for numbers having factor not close to square root of that number .Suggest me some methods .Thanx
Комментарии (2)
goo.gl_SsAhv
|
15 лет назад,
скрыть
#
|
+8
Pollard's rho algorithm
→
Ответить
|
|
Urbanowicz
|
15 лет назад,
скрыть
#
|
+8
AFAIK, most of fast factorization algorithms are randomized and additionally require to implement primality test. But there is at least one algorithm that is fully deterministic, doesn't rely on primality tests and works within O(n1/3) operations for any positive integer n. The algorithm is described in “Factoring Large Integers” paper by R. Sherman Lehman (1974).
→
Ответить
|
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
