What I want and what I have. FiveItt[x98_, cc5_] := If[x98 == 1, 1, FromDigits[Append[Table[1, {ft, x98 - 1}], 0], cc5]]; BCCLog[x22_, y22_] := Catch[Module[{s21 = x22, t22 = Length[IntegerDigits[x22, y22]]}, If[FiveItt[t22, y22] > s21, t22 = t22 - 1]; Throw[t22]; ]]; "Now what I Want (My Wish)" Mus...

T2Root[xxy_] := (Sqrt[8 xxy + 1] - 1)/2; T2xy[x_, y_] := ((x + y) (x + y - 1))/2 - y + 1; FiveItt[x98_, cc5_] := If[x98 == 1, 1, FromDigits[Append[Table[1, {ft, x98 - 1}], 0], cc5]]; BCC[x55_, g77_] := Drop[Flatten[ Reap[Module[{x45 = x55, z7 = 0, z8 = 0, z9, g7 = g77, bell}, z7 = If[x45/FiveItt[Len...

PrimeQPW[hh3_] := Catch[Module[ {aa3, aa4 = hh3, aa5, aa6, aa7, aa8, aa9, a10, a11, a12, a13, a14, a15, a16, aam}, aa5 = 1; Label["Whittle"]; If[aa4 == Prime[aa5] || aa4 == Prime[aa5 + 1] || aa4 == Prime[aa5 + 2], Throw[True]; Break[];]; If[aa5 >= 25, aa5 = 1; Goto["Whittle2"] ;, aa5 = aa5 + 3; Goto...

Details[ww5_, ww6_] := Column[{{Mod[ww5, 3], Mod[ww5, 5], Mod[ww5, 7], Mod[ww5, 11]}, {Floor[ Total[{Test14[ww5 2, ww6], Test14[ww5 3, ww6], Test14[ww5 5, ww6], Test14[ww5 7, ww6], Test14[ww5 11, ww6]}]/5], IntegerQ[ Total[{Test14[ww5 2, ww6], Test14[ww5 3, ww6], Test14[ww5 5, ww6], Test14[ww5 7, ww...

My Tools FiveItt[x98_, cc5_] := If[x98 == 1, 1, FromDigits[Append[Table[1, {ft, x98 - 1}], 0], cc5]]; RS[x_, y_] := \!\(\* TagBox[GridBox[{ {"\[Piecewise]", GridBox[{ { FractionBox[ RowBox[{"Pochhammer", "[", RowBox[{ RowBox[{"y", "+", "1"}], ",", RowBox[{"x", "-", "1"}]}], "]"}], RowBox[{ RowBox[{"...

Just about to write up a test based on this finding watch the zero count on this relating to the other stats. FiveItt[x98_, cc5_] := If[x98 == 1, 1, FromDigits[Append[Table[1, {ft, x98 - 1}], 0], cc5]]; BCC[x55_, g77_] := Drop[Flatten[ Reap[Module[{x45 = x55, z7 = 0, z8 = 0, z9, g7 = g77, bell}, z7 ...

Were those results on the front end or from the kernel or both?.

A false reading has been reported at 488881.

I'm currently working On a far more optimal version.

My searching function was faulty so I had to re-code the Prime Test Function. This should work. If you can find any faults That I may have missed feel free to comment. Test1[vbe_] := Catch[Module[{ce1 = vbe, zcv2, zcv3, zcv4, zcv5, zcv6, zcv7, zcv8, zcv9, zcv10, zcv11}, zcv2 = JacobiSymbol[ce1, From...

It's quite fast already all that's left now is to turn it into compile code and then try and make an asm file that does it a lot faster. I suspect I can get it running quicker than the current lot.

I don't really use mathematica that much, but this would probably be (if I left something out please correct me) the fastest: Start at 4 and try 2 and 3. Since 4%2 = 0, then 4 is not prime. When trying 5, check only the previously calculated numbers up to the sqrt of the number+1, ie 2 and 3 are le...

It's not Necessarily that I don't want to use PrimeQ. It's just that I want to be able to generate at least a quick list of potential large primes at a quick enough pace. I get great pleasure playing and studying the primes and a learn a lot from it.

Hello I've been using Mathematica for 8 years or so now and have decided I want to use my findings to develop in assembly language for the Pi community. My assembly language of choice is FASM. So far I've only managed to do hello world and am working on a program which adds 2 numbers together from t...

Hello there fellow Raspberry's I've been studying Prime numbers for a long time and this recent find is my best find. I'm not certain whether or not my primality test works for every Integer or if the test is a sort of probable prime test. The challenge I leave to you is to speed the function up and...