Hilbert’s 12th problem asked for novel analogues of the roots of unity, the building blocks for certain number systems. Now, over 100 years later, two mathematicians have produced them. Problems in ...

This is a preview. Log in through your library . Abstract The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the ...

This is a preview. Log in through your library . Abstract In this paper the problem proposed by Kuhn on the presence of a monotonicity property related to the Kuhn's algorithm for finding roots of a ...

New work establishes a tighter connection between the rank of a polynomial and the extent to which it favors particular outputs. When you deposit a quarter and turn the crank on a gumball machine, the ...