Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Kalogirou, Alexandros"'
Autor:
Kalogirou, Alexandros
We show that $0,1$-polynomials of high degree and few terms are irreducible with high probability. Formally, let $k\in\mathbb{N}$ and $F(x)=1+\sum_{i=1}^kx^{n_i}$, where $ 0
Externí odkaz:
http://arxiv.org/abs/2410.10035
In 1952, H. Davenport posed the problem of determining a condition on the minimum modulus $m_{0}$ in a finite distinct covering system that would imply that the sum of the reciprocals of the moduli in the covering system is bounded away from $1$. In
Externí odkaz:
http://arxiv.org/abs/2407.15280