Wikipedia:Articles for deletion/Greatest common divisor of two polynomials

 :''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 Bizarre adventure. The AfD is being closed many years later, because it was never properly closed back then, because it was never visible, because it was never transcluded on any of the daily logpages. Technically, it has still been open this whole time.

Nobody else could ever be admitted here, because this door was made only for you. I am now going to shut it. jp×g 22:59, 17 October 2022 (UTC) (non-admin closure)

Greatest common divisor of two polynomials

 * – (View AfD

the article fails WP:NOT#PUBLISHER. the cited vedic methods and books propageted by the article have no mathematical relevance. the topic is covered in the articles Greatest common divisor and Euclidean algorithm. if necessary serious information can be added to these articles


 * 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.