Displaying 21 – 40 of 56

Showing per page

On the divisibility of power LCM matrices by power GCD matrices

Jian Rong Zhao, Shaofang Hong, Qunying Liao, Kar-Ping Shum (2007)

Czechoslovak Mathematical Journal

Let S = { x 1 , , x n } be a set of n distinct positive integers and e 1 an integer. Denote the n × n power GCD (resp. power LCM) matrix on S having the e -th power of the greatest common divisor ( x i , x j ) (resp. the e -th power of the least common multiple [ x i , x j ] ) as the ( i , j ) -entry of the matrix by ( ( x i , x j ) e ) (resp. ( [ x i , x j ] e ) ) . We call the set S an odd gcd closed (resp. odd lcm closed) set if every element in S is an odd number and ( x i , x j ) S (resp. [ x i , x j ] S ) for all 1 i , j n . In studying the divisibility of the power LCM and power GCD matrices, Hong conjectured in 2004 that...

On the irreducibility of 0,1-polynomials of the form f(x)xⁿ + g(x)

Michael Filaseta, Manton Matthews, Jr. (2004)

Colloquium Mathematicae

If f(x) and g(x) are relatively prime polynomials in ℤ[x] satisfying certain conditions arising from a theorem of Capelli and if n is an integer > N for some sufficiently large N, then the non-reciprocal part of f(x)xⁿ + g(x) is either identically ±1 or is irreducible over the rationals. This result follows from work of Schinzel in 1965. We show here that under the conditions that f(x) and g(x) are relatively prime 0,1-polynomials (so each coefficient is either 0 or 1) and f(0) = g(0) = 1, one...

Currently displaying 21 – 40 of 56