Testování perfektních mocnin
A positive integer n is a perfect power if there exist integers x and k, both at least 2, such that n = x^k. Perfect power testing is important as preprocessing for number factorization and prime number testing, because many algorithms for that are not able to distinguish between prime number and po...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Dissertation |
| Language: | Czech |
| Published: |
2008
|
| Online Access: | http://www.nusl.cz/ntk/nusl-290957 |