Wikipedia:Articles for deletion/Primorial sieve

Primorial sieve

[Hide this box] New to Articles for deletion (AfD)? Read these primers!

(Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL)

Blatant WP:OR: the unique source is not published and consists of vague consideration on a supposed algorithm that is not even described. D.Lazard (talk) 13:23, 20 June 2024 (UTC)[reply]

Note: This discussion has been included in the list of Mathematics-related deletion discussions. D.Lazard (talk) 13:23, 20 June 2024 (UTC)[reply]
Delete, per nomination. I did also look for this in a couple of textbooks on computational number theory and in the mentioned Scottish Book, and did not find it in either. Russ Woodroofe (talk) 13:52, 20 June 2024 (UTC)[reply]
to Russ Woodroofe — The algorithm is a complete novelty, NOW-alijka (in Polish. It means fresh, spring vegetables eaten for the first time this year...), in Greek "εὐαγγέλιον", while in the Scottish Book the last entries were made by an officer of the Red Army entering Poland, in 1939, so you know...

BaSzRafael (talk) 00:17, 21 June 2024 (UTC)[reply]
Delete - not remotely encyclopedic, woolly, rambling, uncited, and per the above actually unciteable, i.e. WP:OR. Delete as not notable. Chiswick Chap (talk) 15:01, 20 June 2024 (UTC)[reply]
"not notable"?

The algorithm blows RSA to smithereens, it will factorize 500-digit numbers (decimal) at lightning speed, almost in real time (on a very "fancy", thousand-core computer, of course).

"Not notable" — funny, really... BaSzRafael (talk) 00:33, 21 June 2024 (UTC)[reply]
Delete. Appears to be unpublished original research based on a web page dated (in its source code) from yesterday. The article creator's pseudonym BaSzRafael bears some resemblance to the author name (in the web page source code) Rafael Szulc, suggesting that they may be the same person. The edit summary in the creating edit, "a completely new topic", could be interpreted as a statement that this is made up, and as a rationale for a WP:CSD#A11 speedy deletion. —David Eppstein (talk) 19:02, 20 June 2024 (UTC)[reply]
David — what, in the face of paragraphs and judges — is TRUTH?

Because it clearly does NOT matter at all whether an algorithm is TRUE, whether it WORKS, whether it does what it says it does.

Well, there is clearly a war going on (here too). To maintain the primacy of the RSA algorithm. As I wrote above to colleague C. Chap , the "Primorial Riddle" algorithm blows RSA to dust, and powder!

"The first casualty when war comes is truth"

[ https://en.wikiquote.org/wiki/Hiram_Johnson ] BaSzRafael (talk) 00:53, 21 June 2024 (UTC)[reply]
Delete as something that somebody, most likely the page creator, made up one day. No objection to a speedy per WP:CSD#A11. XOR'easter (talk) 23:40, 20 June 2024 (UTC)[reply]

to D.Lazard

The algorithm IS described!

0. (Ground floor) We divide the number under study by the highest primorial #p — which "fills" no more than 100% of the integer variable used, which has a limited capacity (number of digits).

a) We check the remainder of the division, whether it is a prime number (this is only "on the ground floor"!), but necessarily greater than "p". This case signals that "a" CAN BE a prime number.

b) Otherwise, the number under study "a" is a composite number, and we have one of its divisors (or even two! — at least...)

1. We abandon the use of the primorial function, and from now on in the subsequent floors we use its "nephew": the Van function, choosing its upper argument so that the obtained product of subsequent prime numbers, starting from the lower argument and ending with the upper one — does not exceed the "capacity" of the variable used. The lower argument is the "ceiling" of the previous floor.

2. We check whether the remainder obtained from the division of "a" by #p — is a number relatively prime to "b", and to #p.

a) If so — then "a" CAN BE a prime number

b) If it has common divisors (and THEN there will be at least two of them!) then it is a composite number, and we have its divisors.

3. We loop the procedure from point 2 — that is, we define subsequent values for the lower argument (the "floor" of the Van function) and the upper argument (its "ceiling").

4. Each time we find any divisors of the tested number "a" — we divide it by them, and we only subject the RESULT of this division to further factorization.

5. We proceed in this way until we obtain ALL divisors of the composite number

6. If we do not find any, then they... do not exist! And the number "a" is a prime number, and with 100% CERTAINTY.

What do you not understand? After all, the algorithm is as simple as building a flail... BaSzRafael (talk) 00:23, 21 June 2024 (UTC)[reply]