2010Journal of Wuhan UniversityRequires access

Non-Divisibility of the Determinants of Power GCD and Power LCM Matrices

Zongbing Lin

Open publisher page 0 citations

Abstract

The authors give the computational formula and obtain a result on non-divisibility of determinants of power GCD matrices and power LCM matrices when it is a divisor chain of length not less than 2.

About this research paper

What this paper is about

The authors give the computational formula and obtain a result on non-divisibility of determinants of power GCD matrices and power LCM matrices when it is a divisor chain of length not less than 2.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The authors give the computational formula and obtain a result on non-divisibility of determinants of power GCD matrices and power LCM matrices when it is a divisor chain of length not less than 2.

Key concepts: Divisibility rule, Greatest common divisor, Mathematics, Divisor (algebraic geometry), Power (physics), Least common multiple, Chain (unit), Combinatorics

Related papers

Back to paper searchBrowse research topicsOriginal source
Non-Divisibility of the Determinants of Power GCD and Power LCM Matrices — Research Paper | ScholarLens