Re: [PrimeNumbers] New Type of Prime Arithmetic Progression?
- Bill Sindelar wrote:
> I used Pari-gp for this. For every set of k consecutive primes, which hasI would expect your method to be much slower based on how
> n skipped consecutive primes between its adjacent terms, after an
> inputted integer, it checks if the terms of that set are in arithmetic
> progression. Jens, is this slower than your approach with your tuplet
"randomly" consecutive prime gaps appear to be distributed.
> If one could prove the above assumption, would that also proveNo, and also no to the only-part. Your assumption says nothing
> that all admissible prime constellations have infinitely many occurrences
> as you put it, or only those that have a (PAP-k, n) subset?
about the existence of specific differences between primes,
so it says nothing about any admissible constellation.
> This suggested trying this assumption which is just a fancy way of.....
> defining a (PAP-k, n):
> It works but is more"computationally complicated" refers to something computational,
> computationally complicated. What do you think?
for example the time to compute something with a given algorithm.
You have made another formulation of your conjecture but not
described an algorithm so "computationally complicated" is a
concept which does not apply.
I don't have time to discuss more.
Jens Kruse Andersen