22 Dec
2011
22 Dec
'11
3:31 p.m.
On Thu, Dec 22, 2011 at 8:31 AM, John Young
""" Since 2008 I've been working on a method to fast-factor large semiprimes with a friend of mine (maybe I've emailed you about this in the past). We've made several advances that are previously unknown in the mathematics literature. We found a unique prime number sieve that uses digital-roots and the Chinese remainder theorem (it operates in an almost "numerological" manner and it starts at the number 7); we found symmetries that hint at a branch-and-bound contrapositive solution to Riemann's Zeta; etc. Lately we've been submitting a bunch of the integer sequences that resulted from our research to AT&T's Online Encyclopedia of Integer Sequences: http://oeis.org/search?q=helkenberg """