Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Tatarević, Miloš"'
We present improved algorithms for computing the left factorial residues $!p=0!+1!+...+(p-1)! \!\mod p$. We use these algorithms for the calculation of the residues $!p\!\mod p$, for all primes $p$ up to $2^{40}$. Our results confirm that Kurepa's le
Externí odkaz:
http://arxiv.org/abs/1904.09196
Autor:
Andrejić, Vladica, Tatarevic, Milos
Publikováno v:
Publ. Inst. Math., Nouv. S\'er. 100 (2016), 101-106
We investigate the existence of primes $p > 5$ for which the residues of $2!$, $3!$, \dots, $(p-1)!$ modulo $p$ are all distinct. We describe the connection between this problem and Kurepa's left factorial function, and report that there are no such
Externí odkaz:
http://arxiv.org/abs/1603.04086
Autor:
Exoo, Geoffrey, Tatarevic, Milos
Publikováno v:
The Electronic Journal of Combinatorics 22(3) (2015) #P3.11
We establish new lower bounds for $28$ classical two and three color Ramsey numbers, and describe the heuristic search procedures we used. Several of the new three color bounds are derived from the two color constructions; specifically, we were able
Externí odkaz:
http://arxiv.org/abs/1504.02403
Autor:
Tatarevic, Milos
Publikováno v:
The Electronic Journal of Combinatorics 22(1) (2015) #P1.35
We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous best-known arra
Externí odkaz:
http://arxiv.org/abs/1503.07933
Autor:
Andrejić, Vladica, Tatarevic, Milos
Publikováno v:
Mathematics of Computation 85 (2016), 3061-3068
Kurepa's conjecture states that there is no odd prime $p$ that divides $!p=0!+1!+\cdots+(p-1)!$. We search for a counterexample to this conjecture for all $p<2^{34}$. We introduce new optimization techniques and perform the computation using graphics
Externí odkaz:
http://arxiv.org/abs/1409.0800
Autor:
Andrejić, Vladica, Tatarevic, Milos
Publikováno v:
Mathematics of Computation, 2016 Nov 01. 85(302), 3061-3068.
Externí odkaz:
https://www.jstor.org/stable/mathcomp.85.302.3061
Publikováno v:
In Information Processing Letters April 2021 167