Re: More on triangle numbers and primes!

> Just an added statement about the sieve of t(n)-t(y)
> where n>y.
> This is inefficient I know but it still rips quite fast.
> What is interesting about this sieve is, you
> build a data file or array with the first entries --
> 9,3 ===== t(4)-1, 3 = constant add to t(4)-1
> 14,4 ----etc.
> 20,5
> 27,6
> 35,7
> . etc
>
> Run the 9's set as deep as the size primes you
> want to extract or the limit of the array or file you have for storage. In
> an array or file plug the blank
> spots by identifying the location as a prime or if an
> even # blank spot then eliminates that location #.
>
> Then run the next set [14,4] etc.
> After you run and save all sets, retrieve array or file
> for listing out the primes.
>
> This will just display all primes > 7, and eliminates
> all 2^>3 and the few perfect #.(also 10 and 136)
>

Hmm...Do you have a pattern that runs in accelerating numerical value steps
but that outputs all odd composites ?

In other words forget the 14,4 line...

And does this pattern need proving ?

See if I want to know if 31 is in the 9,3 line I can calculate that without
running the whole line...and then I know that there are no more possible
31's past line 27,6 .


.

Relevant Pages

  • Re: goldbachs conjecture
    ... That's why God created ... created all primes (and only ... The Pattern ... an excellent mathematician wrote to me something: ...
    (sci.math)
  • Re: goldbachs conjecture
    ... That's why God created ... created all primes (and only ... The Pattern ... A mathematician might begin with "natural" numbers ...
    (sci.math)
  • Re: Pattern to the primes
    ... it's one of many such equivalent patterns. ... Essentially it's an exact equivalent of the proved pattern (.i.e. ... There are other "patterns" for the primes. ... defined a pattern for their distribution. ...
    (sci.math)
  • Re: Bug in Strings split method???
    ... The limit parameter controls the number of times the pattern is ... applied and therefore affects the length of the resulting array. ... limit n is greater than zero then the pattern will be applied at most n ...
    (comp.lang.java.programmer)
  • Re: Surprise in array concatenation
    ... >> computational states for which A is considered be 1. ... >> memory dump and discover a bit pattern 000000001 at the address FF07712CA0 ... could you stop naming this ADT an array? ... > These are Ada arrays, rock solid low level stuff, based on preexisting ...
    (comp.lang.ada)