This is a preview. Log in through your library . Abstract Abstract Given a positive integer 𝑛 the 𝑘-fold divisor function 𝑑𝑘(𝑛) equals the number of ordered 𝑘-tuples of positive integers whose ...

Title: Sums of the divisor function and random matrix distributions Abstract: The divisor function gives the number of positive divisors of a natural number. How can we go about understanding the ...

Finding divisors of a given number. For example 50 has dividers: 1, 2, 5, 10, 25, 50. Divisors must be placed in ascending order in the returned collection. The given divisor may appear only once in ...

ABSTRACT: This paper attempts to form a bridge between a sum of the divisors function and the gamma function, proposing a novel approach that could have significant implications for classical problems ...

Abstract: By using the q-analog of van der Corput's method, we study the divisor function in an arithmetic progression to modulus q. We show that the expected asymptotic formula holds for a larger ...

Title: Variance of the k-fold divisor function in arithmetic progressions for individual modulus Abstract: We discuss some background and the proof of Corollary 1 in arXiv:2205.02354. This result is ...

Abstract: We consider very short sums of the divisor function in arithmetic progressions prime to a fixed modulus and show that “on average” these sums are close to the expected value. We also give ...

If you wish to find the Lowest Common Multiple (LCM) or Greatest Common Divisor (GCD) in Excel, this post will be helpful. Microsoft Excel is known to help in easing mathematical calculations. We all ...