All Questions

Suppose one generates a random polynomial of degree $d$ with integer coefficients uniformly distributed within $[-c_\max,c_\max]$. For example, for $d=8$, $|c_\max|=100$, here is one random polynomial:...

Given positive integer $N$, we choose $m_1, m_2, n_1, n_2$ independently and with equal probabilities from $\{0,1,\ldots,N\}$, and let $f_1 = x^{m_1} + (1+x)^{n_1}$ and $f_2 = x^{m_2} + (1+x)^{n_2}$ ...

Imagine an n-simplex, the solution set for the expression: $a_1$*$x_1$ + $a_2$*$x_2$ + ... + $a_n$*$x_n$ = S, where: $a_1$ through $a_n$ are positive bounded integers $x_1$ through $x_n$ are ...

Let $n,H$ two fixed positive integers. Let $P\in\mathbb{Z}[X]$ a monic integral polynomial of height $H$ and degree $n$ taken uniformly at random (i.e. each of the $n$ free coefficients of $P$ is ...

In "Anatomy of Integers and Permutations", http://www.dms.umontreal.ca/~andrew/PDF/Anatomy.pdf, Granville gives a calibration of cycles of a permutation and prime factors of an integer. "We know ...