Zobrazeno 1 - 5
of 5
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
Publikováno v:
Human-computer Interaction. Ambient, Ubiquitous & Intelligent Interaction; 2009, p377-386, 10p
Publikováno v:
Human-computer Interaction. Ambient, Ubiquitous & Intelligent Interaction; 2009, p1-1, 1p
Autor:
Julie A. Jacko
The 13th International Conference on Human–Computer Interaction, HCI Inter- tional 2009, was held in San Diego, California, USA, July 19–24, 2009, jointly with the Symposium on Human Interface (Japan) 2009, the 8th International Conference on Eng