Benedict Irwin edited 9090+3.tex  over 9 years ago

Commit id: be0b21a53cecc4be4b3172b06c510a083ba5d94c

deletions | additions      

       

(90;;73)-1& 0 & \\  (90;;74)-1& 1 & (90;;74)-1\\  (90;;75)-1& 0 & 23×...\\  (90;;76)-1& 0 & 43?????×... \\  (90;;77)-1& 0 & \\  (90;;78)-1& 0 & \\  (90;;79)-1& 0 & 29×3134796238244514106583072100313479623824451410658307210031347962382445141065830721003134796238244514106583072100313479623824451410658307210031347962382445141 \\  (90;;80)-1& 0 & 19×478468899521531100478468899521531100478468899521531100478468899521531100478468899521531100478468899521531100478468899521531100478468899521531100478468899521531 \\  (90;;81)-1& 1 & (90;;81)-1\\   (90;;82)-1& 0 & \\  (90;;83)-1& 0 & 11×... \\  (90;;84)-1& 0 & \\  (90;;85)-1& 0 & 79×(11507479861910241657077100;;6)|1150747986191 \\  (90;;86)-1& 0 & 23×67×[[5899356970090260161642380980473128429001238864963718954633944900005899356970090260161642380980473128429001238864963718954633944900005899356970090260161642380980473128429]]\\  (90;;87)-1& 0 & \\  (90;;88)-1& 0 & \\  (90;;89)-1& 0 & 19×89×[[5376055050803720230095156174399225848072684264286866297510886511477877533465942691253158432342347185635180904252459545185742702005268533949787645825493253050911241331111230579]]\\  (90;;90)-1& 0 & \\  (90;;91)-1& 0 & \\  (90;;92)-1& 0 & 61×[[149031296572280178837555886736214605067064083457526080476900149031296572280178837555886736214605067064083457526080476900149031296572280178837555886736214605067064083457526080476900149]]\\  (90;;93)-1& 0 & 29×[[31347962382445141065830721003134796238244514106583072100313479623824451410658307210031347962382445141065830721003134796238244514106583072100313479623824451410658307210031347962382445141]]\\  (90;;94)-1& 0 & 11×[[8264462809917355371900826446280991735537190082644628099173553719008264462809917355371900826446280991735537190082644628099173553719008264462809917355371900826446280991735537190082644628099]]\\  (90;;95)-1& 0 & \\  \hline  \end{array}  \end{equation} 

COULD TABULATE/CHART N+... AGAINST Xm\in Z...  Amazingly the huge prime, we will denote, $P_H$=1150747986191024165707710011507479861910241657077100115074798619102416570771001150747986191024165707710011507479861910241657077100115074798619102416570771001150747986191 appears twice in the table above!!  Not only this, but the prime $P_H$ appears to have some kind of repeating feature $11507479861910241657077100$, repeating $6$ times, but then stopping part way [Exactly half 13 out of 26] with a last repeat of $1150747986191$... , note that last section is not prime but $203279×5660929$.  could be potentially stated as a rule by \\  We see that if $n-46=39m\in\mathbb{Z^0}$, then $(90;;n)-1$ is div by $P_H$. [24th prime] \\  primes of form $(90;;n)+1$: 2, 3, 9, 15, 26, 33, 146, 320, 1068, 1505 \\  primes of form $(90;;n)-1$: 1, 3, 4, 11, 15, 21, 36, 74 74, 81,  \\ Twin primes of form $(90;;n)\pm1$ 3, 15, ...  Now the second sequence doesn't appear to be recoginsed by OEIS. We require a way of finding the two sequences, then we may identify very large double primes.  However this being said $((90;;76)-1)/43 \nin \mathbb{Z}$ according to WA. But all other cases have been... apparently has remainder 13, Does this frown upon one of the ruels above?? [Check it out.]  According to "Wikipedia:Twin Prime" the largest twin prime pair found has each $200700$ digits. So we require a $(90;;100351)\pm1$ term or greater. This is still a huge task. We may be a ble to buil a similar algorithm to assess primality (or more strictly rule out non-primes). Together, the two algorithms may then sift out again more numbers, if we refine the search to twin primes, this would give some good numbers to focus on.  Building a similar table to before.