Let be given natural numbers N_1,N_2,N_3,...,N_k such that for every prime p less or equal
k set N_1,N_2,N_3,...,N_k does not contain all reminders modulo p. Is it right that there exists number X such that all X+N_1,X+N_2,X+N_3,...,X+N_k are prime? I think it must follow
from some theorems about prime numbers in arithmetical progression.
Monday, 26 February 2007
nt.number theory - Prime numbers with given difference
at
23:35
Labels:
Mathematics

Related Posts:
- gr.group theory - When does a subgroup H of a group G have a complement in G?
- oc.optimization control - Uniformly distribute a population in a given search space
- ag.algebraic geometry - Hilbert scheme of points on a complex surface
- Models of ZFC Set Theory - Getting Started
- nt.number theory - A "round" lattice with low kissing number?
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment