Kurepa’s conjecture states that there is no odd prime p which divides !p=0!+1!+…+(p-1)!. We search for a counterexample of this conjecture for all p<10^10. We introduce new optimization techniques and perform the computation using graphics processing units (GPUs). Additionally, we consider the generalized Kurepa’s left factorial given as !kn=(0!)k+(1!)k+…+((n-1)!)k and show that for all integers […]

September 3, 2014 by hgpu

We present a parallel algorithm for calculating very large determinants with arbitrary precision on computer clusters. This algorithm minimises data movements between the nodes and computes not only the determinant but also all minors corresponding to a particular row or column at a little extra cost, and also the determinants and minors of all submatrices […]

August 12, 2013 by hgpu

This work considers the deployment of pseudo-random number generators (PRNGs) on graphics processing units (GPUs), developing an approach based on the xorgens generator to rapidly produce pseudo-random numbers of high statistical quality. The chosen algorithm has configurable state size and period, making it ideal for tuning to the GPU architecture. We present a comparison of […]

August 3, 2011 by hgpu

A GPU implementation of an algorithm to compute the Mertens function in O(x2/3+{ko}) time is discussed. Results for x up to $10^{22}$, and a new extreme value for $M(x)/x^{1/2}$, -0.585768 ($M(x) approx -1.996 ast 10^9$ at $x approx 1.161 ast 10^{19}$), are reported.An approximate algorithm is used to examine values of M(x) for x up […]

August 2, 2011 by hgpu