Google-translated:
Conjecture On Prime Number Series
This conjecture and very simple yet very special time in practice is spread over a very simple algorithm:
Nseries (p) * (p)
Nseries and based on a small or large number of predefined numbers ranging from 1 to infinity for example 111 and a series 123456 a other set and where (p) is a prime number. Now the product of the series 111 (p) * (p) = 1117 * 7 = 7819 (where (p) = 7) results in a number not first, and in fact has two unique factors as two prime numbers this case 1117 and 7, the series 111 taken as an example can produce hundreds or thousands of results having as result of the product, a number that has only two factors First.
It remains a guess cause it is not demonstrable that there can not be a series where nothing at all is a set whose product does not comply with the rules and did not in fact only and only two prime factors which respect the algorithm.
The problem divided into two parts.
1. As a first step it must be shown that:
Given an arbitrary number

belonging to

written in the formula:
(1)
where

and

belong to

and

, and took a number first arbitrary

, written in the form
(2)
where

and

belong to

and

, then took the ' infinite set of numbers

expressible in the form
(3)
necessarily exists at least one number

belonging to

, that

belongs to

.
To prove it, and 'sufficient to prove that
(4)
2. Managed to get this demonstration the second step is to show that:
if there exists a number

of the type shown in eq. (3) that belongs to

and

, then necessarily exists at least one other number

that belongs at the intersection of

and

.
The union of the two demonstrations would imply that the set

and an infinite set (this would be a demonstration for recursion).