View examples of the gamma-structure of prime powers for half- and quarter-factorials, and 'exceptional' prime 

 

 

In the following half-factorials section the gamma[1](2), gamma[2](2), gamma[3](2), gamma[4](2), () .. () are gamma[i](2) := factorial(ord[`^`(p, i)](`+`(`*`(`/`(1, 2), `*`({`+`(`^`(p, i), `-`(1))}))))[p]), i = 1, 2, 3, 4, () .. () , 

 

and recall that, when i = 1, gamma[1](2)is simply the familiar factorial(ord[p](`+`(`*`(`/`(1, 2), `*`({`+`(p, `-`(1))}))))) (the order of factorial(`+`(`*`(`/`(1, 2), `*`({`+`(p, `-`(1))})))) with respect to the modulus p) 

 

 

See the quite different behaviours of the gamma-values: 

 

 

Half-factorials (just three examples to show all actual (proven) behaviours) 

 

 

 

In the following quarter-factorials section the gamma[1](4), gamma[2](4), gamma[3](4), gamma[4](4), () .. () are: 

 

gamma[i](4) := factorial(ord[`^`(p, i)](`+`(`*`(`/`(1, 4), `*`({`+`(`^`(p, i), `-`(1))}))))[p]), i = 1, 2, 3, 4, () .. () ,  

 

and recall that, when i = 1, gamma[1](4)is simply the familiar factorial(ord[p](`+`(`*`(`/`(1, 4), `*`({`+`(p, `-`(1))}))))) (the order of factorial(`+`(`*`(`/`(1, 4), `*`({`+`(p, `-`(1))})))) with respect to the modulus p) 

 

 

Quarter-factorials (just three examples to show all apparent behaviours ...) 

 

 

 

A  brief summary of what computations suggested to be true for these gamma[1](4), gamma[2](4), gamma[3](4), gamma[4](4), () .. () : 

 

 

 

 

 

 

etc 

 

 

However, this is what a theoretical analysis uncovered, for these same gamma[1](4), gamma[2](4), gamma[3](4), gamma[4](4), () .. () : 

 

 

 

 

 

 

etc 

 

 

In a pre-computer age one would have been tempted to conjecture that the second alternative (the 'OR') never held ... In fact, in the pre-computer age one might never even have arrived at conjecturing the first alternatives ...  

 

 

We derived a criterion (too involved to relate here) for the second atlernative to hold, and it transpired that at the prime p = 29789, one had: 

 

gamma[1](4) = 14894 (which is `*`(`/`(1, 2), `+`(p, `-`(1))))

gamma[2](4) = 7447 (which is `*`(`/`(1, 4), `+`(p, `-`(1))))
 

 

so that  

 

gamma[2](4) = {`+`(`*`(`/`(1, 2), `*`(gamma[1](4))))} 

 

 

and we deemed this prime to be (in this context) 'exceptional'. 

 

Using the criterion we had obtained we tested (using Maple) to `^`(10, 8), and then, using a very fast program written specially for us by Yves Gallot, we extended the search to `+`(`*`(4, `*`(`^`(.10, 8)))), without finding another exceptional prime (for quarter Gauss factorials, that is). 

 

In later years we discovered (with proof) a more beautiful (and much faster) criterion which enabled us to extend the search to `^`(10, 11), and still no new exceptional prime (so the term 'exceptional' is well-chosen).  

 

I shall give that test later; it came directly - and quite unexpectedly - from our extension of the Gauss binomial coefficient congruence. It's all written up in our Acta Mathematica Hungarica paper: 

 

 

THE GAUSS-WILSON THEOREM FOR QUARTER INTERVALS,

Acta Mathemetica Hungarica, Vol. 142 (2014), no. 1, 199-230 

 

 

You should understand that I am keeping my remarks exceptionally brief here, as there is so much more to be said.