Abstract
Let S = { x 1, x 2,… x n } be a set of distinct positive integers. The n × n matrix [ S] = (( s ij )), where s ij = ( x i , x j ), the greatest common divisor of x i and x j , is called the greatest common divisor (GCD) matrix on S. We study the structure of a GCD matrix and obtain interesting relations between its determinant. Euler's totient function, and Moebius function. We also determine some arithmetic progressions related to GCD matrices. Then we generalize the results to general partially ordered sets and show a variety of applications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
