We show that the binary expansions of algebraic numbers do not form secure pseudorandom sequences; given sufficiently many initial bits of an algebraic number, its minimal polynomial can be ...

We prove that if $f(x)=\sum _{k=0}^{n-1}a_{k}x^{k}$ is a polynomial with no cyclotomic factors whose coefficients satisfy $a_{k}$ ≡ 1 mod 2 for 0 ≤ k < n, then ...