𝑷 𝒓 𝒊 𝒎 𝒐 𝒓 𝒊 𝒂 𝒍 𝒓 𝒊 𝒅 𝒅 𝒍 𝒆
.
The 𝒑𝒓𝒊𝒎𝒐𝒓𝒊𝒂𝒍 𝒔𝒊𝒆𝒗𝒆, or 𝒑𝒓𝒊𝒎𝒐𝒓𝒊𝒂𝒍 𝒓𝒊𝒅𝒅𝒍𝒆 (abbreviated 𝑷𝒓𝒊𝑹) presented here: tinyurl.com/PrimorialSieve
— This was a first approach to the problem, and as an “introduction” to
it — it went in a pretty good direction.
However, it had flaws that made it suitable only for composite numbers
with small divisors, so it was not suitable for breaking cryptographic keys,
which the author sadly admits here.
The next step was to introduce a new function #p called → Van(guard), in the form:
#p₂ = p₁#
: p₀# .
similar to the quotient of two factorials 𝐧₁! : 𝐧₀!
and with a similar "effect"...
However, this turned out to be insufficient, so in the third step we
introduce the nabla-deltorial (→ nDeltorial)
method, with the pictogram ∇Δ(pₙ) symbolizing it, where the
opposite triangles: the nabla symbol and delta — are
to bring to mind the selection method used during the capricious selection of
prime numbers in order to obtain their ∇Δ-product.
However,
all these solutions turned out to be insufficient, a bigger step was needed,
which was achieved in the fourth approach, where the idea of
REVERSE division was introduced - details here...
This is the most far-reaching concept.
©
𝑁𝑖𝑐𝑜𝑙𝑎𝑠 𝑅𝑎𝐵𝑎𝑟𝑏𝑎𝑟(𝑠)𝑘𝑖
(𝐢𝐧 𝐋𝐯𝐢𝐯-𝐒𝐜𝐨𝐭𝐭𝐢𝐬𝐡
𝐂𝐨𝐨𝐤𝐁𝐨𝐨𝐤
prime floor:
𝐬𝐞𝐥𝐞𝐫, 𝐩𝐚𝐫𝐬𝐥𝐞𝐲 & 𝐩𝐨𝐨𝐫)
‘shrink’ (shortened link) to the above: