Wikipedia:Articles for deletion/Divisible polynomial Source: en.wikipedia.org/wiki/Wikipedia:Articles_for_deletion/Divisible_polynomial

The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.

The result was delete. Spartaz ^Humbug! 12:13, 6 October 2014 (UTC)[reply]

Divisible polynomial

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

(1) Term not used under that name (in English), and the logical usage of the name would be reducible polynomials. A possible title would be polynomial congruence identitites, but that doesn't strike me as meeting WP:GNG. (2) No reliable sources are provided. The existing source seems to be a Chinese language math forum. (3) It's been deleted on the Chinese Wikipedia. Google translate mangles technical terms used there, so I can't be sure, but I believe the reason given was that it wasn't sourced. Because of sourcing issues, migrating the material to WikiBooks or WikiVersity [under another name] is another option, but there's nothing that could be retained here unless sources can be found. — Arthur Rubin (talk) 16:09, 28 September 2014 (UTC)[reply]

Further discussion on the talk page in regard the {{Prod}}, now removed. — Arthur Rubin (talk) 16:13, 28 September 2014 (UTC)[reply]

Note: This debate has been included in the list of Science-related deletion discussions. NorthAmerica¹⁰⁰⁰ 16:23, 28 September 2014 (UTC)[reply]

Delete. Apparently ("apparently", because the poor writing makes it difficult to understand) this article is about the polynomials with integer coefficients, which, viewed as a functions from the integers to the integers have all their values divisible by some fixed integer n. This article consists simply in a few well known examples of such polynomials. Naming these polynomials "divisible polynomials", and collecting well known examples of them is certainly WP:OR. I have not found anything else in the article. D.Lazard (talk) 16:46, 28 September 2014 (UTC)[reply]

@D.Lazard: No, it apparently deals with polynomials over Z_n as well. --Sammy1339 (talk) 22:37, 28 September 2014 (UTC)[reply]

Speedy delete as A-10. A recently created article with no relevant page history that duplicates an existing English Wikipedia topic, and that does not expand upon, detail or improve information within any existing article(s) on the subject, and where the title is not a plausible redirect. This is just the generalized Carmichael theorem, of which Euler's theorem and Fermat's little theorem are examples, even though historically they developed the from the specific to the more general. The usage here "divisible polynomial" does not exist per se, and hence a redirect is not supported. See especially the section Carmichael function#Hierarchy of results, and the more detailed explanations in general at Carmichael function, including divisibility. The article at Afd was recently created on 20 September. --Bejnar (talk) 16:47, 28 September 2014 (UTC)[reply]

@Bejnar: Although it's not clear since the article is badly written, these theorems can be applied to polynomial factorization but the subject is distinct. --Sammy1339 (talk) 22:37, 28 September 2014 (UTC)[reply]

That is not what the content of this article is about. --Bejnar (talk) 04:02, 29 September 2014 (UTC)[reply]

Keep and rename. (You could also merge this into irreducible polynomial but that would be a chore.) This is a topic that easily passes WP:GNG - I can easily show you a dozen algebra textbooks that devote large sections to the problem of determining whether a polynomial is reducible. As far as I can tell the material is not duplicated in any other article. Certainly the article is a mess, and tags should be added. The term itself is rare but has been used in other sources, by the way: [1], [2]. --Sammy1339 (talk) 22:37, 28 September 2014 (UTC)[reply]

@Sammy1339: I think we should merge this into integer-valued polynomial.--Tttfffkkk (talk) 00:22, 29 September 2014 (UTC)[reply]

@Tttfffkkk: Maybe I misunderstood what the article was about. I thought it might belong in irreducible polynomial or factorization of polynomials. But perhaps you should just WP:USERFYIT to your account until it's legible. --Sammy1339 (talk) 00:39, 29 September 2014 (UTC)[reply]

Delete per WP:TNT. Apparently from the discussion here (I couldn't figure this out from the article itself) the topic is polynomials whose values for integer arguments are always composite numbers. There is likely something encyclopedic to say about them (they're mentioned for instance in JSTOR 2301357; relatedly see Sierpinski number and Schinzel's hypothesis H) but the article as written is so incomprehensible as to be not worth saving by any kind of merge or rename. —David Eppstein (talk) 18:52, 29 September 2014 (UTC)[reply]

On reconsideration I can mostly endorse this position as the current article is totally unreadable. However I think it contains potentially useful information, so I hope it will be userfied in the hope that it can be improved. --Sammy1339 (talk) 05:08, 1 October 2014 (UTC)[reply]

The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.