*****   Statistics for Min derlog L  ***** 
name source file = minderlog.csv
  *****   MAX   *****
maximal value on column min = 0.3682816159701500 attained at q = 3.0
second maximal value on column min = 0.3001053912732600 attained at q = 13.0
  *****   MIN   *****
minimal value on column min = 0.0000006311157467 attained at q = 6119053.0
second minimal value on column min = 0.0000007046027757 attained at q = 9859769.0
  *****   MAX  normalised values min/lbound(q) *****
maximal value on column norm = 130782.7605978460051119 attained at q = 9561863.0
second maximal value on column norm = 130326.1083049171138555 attained at q = 9293447.0
  *****   Min normalised values min/lbound(q) *****
minimal value on column norm = 1.0423793329146667 attained at q = 7.0
second minimal value on column norm = 2.5705644808685717 attained at q = 61.0
  *****   STATS Min derlog L   *****
number of odd > even : 333408 percentage = 50.16837752679144
number of even > odd : 331170 percentage = 49.83162247320856
number of even = odd : 0 percentage = 0.0
total number (oddgreatereven+evengreaterodd) = 664578
total number (evenequalodd) = 0
total number (number of rows) = 664578
*** Detecting values mq < 1e-05 and q > 2
*** and saving them on file recompute.txt 
*** There are n.192 primes in which mq < 1e-05 and q > 2
*** recompute them with quadruple precision ***
*** Detecting values mq >= ubound(q) and saving them on file uexcept.txt
*** There are n.1 primes for which mq >= ubound(q) 
*** Detecting values mq <= lbound(q)  and saving them on file lexcept.txt
 No primes for which mq <= lbound(q) detected 
*****   End analysis script   *****