GCD matrix - Wikipedia

This article may meet Wikipedia's criteria for speedy deletion for the following reasons:

as a very short article lacking sufficient context to identify the subject of the article. See CSD A1.
as an article that contains no content whatsoever, or consists only of external links, categories, a "see also" section, a rephrasing of the title, chat-like comments, template tags, and/or images. Disambiguation pages and redirects are not eligible for this criterion. A very short article may still be a valid stub if there is sufficient context to identify the subject. See CSD A3.

The page may be deleted under any criterion that is valid.

If this article does not meet the criteria for speedy deletion, or you intend to fix it, please remove this notice, but do not remove this notice from pages that you have created yourself. If you created this page and you disagree with the given reason for deletion, you can click the button below and leave a message explaining why you believe it should not be deleted. You can also visit the talk page to check if you have received a response to your message.

Note that this article may be deleted at any time if it unquestionably meets the speedy deletion criteria, or if an explanation posted to the talk page is found to be insufficient.

Nominator: Please consider placing the template:

{{subst:Db-notice-multiple|GCD matrix|header=1|A1|A3}} ~~~~

on the talk page of the author.

Note to administrators: this article has content on its talk page which should be checked before deletion.

Administrators: check links, talk, history (last), and logs before deletion. Consider checking Google.
This page was last edited by Shirt58 (contribs | logs) at 10:22, 9 April 2022 (UTC) (3 years ago)

In mathematics, a greatest common divisor matrix (sometimes abbreviated as GCD matrix) is a matrix/

GCD matrix example

Let $S=\{x_{1},x_{2},\ldots ,x_{n}\}$ be a set of positive integers. Then the $n\times n$ matrix $(S)$ having the greatest common divisor $(x_{i},x_{j})$ as its $ij$ entry is referred to as the GCD matrix on $S$ . The LCM matrix $[S]$ is defined analogously.

Conjectures

Bourque-Ligh Conjecture: Bourque and Ligh (1992) conjectured that the LCM matrix on a GCD-closed set S is nonsingular. This conjecture was shown to be false by Haukkanen, Wang and Sillanpää (1997) and subsequently by Hong (1999).

GCD matrix example

Conjectures

References