## With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

No credit card required

## Height lower bounds – Dobrowolski

In 1933 Lehmer, in connexion with the factorization of large integers, looked at integer sequences

in the notation of (14.2) with a0 = 1. It was advantageous to have as slow growth as possible. Clearly from (14.3) we have |un| ≤ 2dH(α)dn for the height H(α) and so it would be nice to make H(α)d as small as possible. Of course this can be achieved with roots of unity (or zero) by (14.5), but then un is uninteresting. Lehmer found the value

H(α)d = 1.17628081825991750654407033847403505069341580656469 . . .

(which I calculated by Maple with Newton’s Method (12.11) after three iterations starting with Maple’s first ...

## With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

No credit card required