mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math > Number Theory Discussion Group

Reply
 
Thread Tools
Old 2021-05-24, 11:48   #1
MattcAnderson
 
MattcAnderson's Avatar
 
"Matthew Anderson"
Dec 2010
Oregon, USA

911 Posts
Thumbs up k-tuples

We are still not satisfied regarding k-tuples.

A expression m*n + o + p

where m is multiplier
n is test number
o is offset and
p is pattern.


For example for the pattern [0, 2, 6]

we want to enumerate the first few numbers.

We require that n is a positive integer.

and p is an element in the set [0,2,6]


See oeis.org


prime quads
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)

A007530 Prime quadruples: numbers k such that k, k+2, k+6, k+8 are all prime.
(Formerly M3816) +30

5, 11, 101, 191, 821, 1481, 1871, 2081, 3251, 3461, 5651, 9431, 13001, 15641, 15731,

I introduce my new terminology and element p is a member of the set P.
That makes me feel much better. See you tomorrow.

Regards

MCA

PS See wikipedia
https://en.wikipedia.org/wiki/Prime_k-tuple
MattcAnderson is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
On the Infinity of Twin Prime and other K-tuples jzakiya Miscellaneous Math 61 2021-08-21 19:41
3-tuples and 4-tuples MattcAnderson Math 8 2021-01-19 22:31
prime k-tuples MattcAnderson Math 0 2020-06-16 17:45
How do you efficiently sieve for prime 3/4-tuples? Puzzle-Peter Software 156 2019-06-03 20:19

All times are UTC. The time now is 03:19.


Tue Oct 26 03:19:20 UTC 2021 up 94 days, 21:48, 0 users, load averages: 1.83, 2.13, 2.10

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.