Jump to content

GCD matrix

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Shirt58 (talk | contribs) at 10:47, 9 April 2022 (Speedy deletion declined. Professor Google tells me that there really is a thing called Greatest common divisor matrix, so this would appear to avoid outright WP:A1 and WP:A3 - move to Draft:Greatest common divisor matrix ? That said, while they are both popular with a lot of people, I'm terrified of both mathematics and hot sauce , so I might not a completely objective opinion here. (CSDH)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

GCD matrix example

Let be a set of positive integers. Then the matrix having the greatest common divisor as its entry is referred to as the GCD matrix on . The LCM matrix 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).

References