Detecting perfect powers in almost linear time

Free Download

Authors:

Size: 346 kB (353981 bytes)

Pages: 31/31

File format:

Language:

Publishing Year:

Category:

Bernstein D.J.

This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect power or proves that n is not a perfect power; (3) proves, using Loxton’s theorem on multiple linear forms in logarithms.

Reviews

There are no reviews yet.

Be the first to review “Detecting perfect powers in almost linear time”
Shopping Cart
Scroll to Top