Bernoulli numbers and arithmetic progressions

[cino hilliard]

>From: "cino hilliard" <hillcino368 at hotmail.com>
 From my last post on this subject.
>1349 90350 2211
>1407 94236 2211
>1448 96983 2211
>472 = first fail from 2211
>29   = number correct

This should be

1349 90350 2211
1407 94236 2211
1448 96983 2211
335 = first fail from 2211
33 = number correct

Sorry.

>bern4(n,p) =
>          {
>           c=0;
>           c2=0;
>           c3=0;
>           a=vector(n);
>           a2=vector(n);
>           ak=vector(n);
>           for(k=1,n,
>           if(numerator(bernfrac(k+k))%p==0,
>           c++;
>           a[c]=p*k-(p-1)/2;
>           ak[c]=k;
>            )
>            );
>           for(x=1,c,
>           if(x%3,c2++;a2[c2]=a[x])
>            );
>           d=a2[2]-a2[1];
>           forstep(x=1,c,2,
>           d2 =a2[x+1]-a2[x];
>           if(a2[x+1]>0 && d==d2,c3++;print(ak[x]" "a[x]" "d2),
>           f=a2[x+1]- a2[x];
>           break)
>                  );
>           print( f" = first fai from "d);
>           print(c3" = number correct")
>           }
>
Cino

_________________________________________________________________
Find great local high-speed Internet access value at the MSN High-Speed 
Marketplace. http://click.atdmt.com/AVE/go/onm00200360ave/direct/01/