On the norm of GCD and related matrices.
For an integer we denote by the largest prime factor of . We obtain several upper bounds on the number of solutions of congruences of the form and use these bounds to show that
We compare the growth of the least common multiple of the numbers and , where is a Lucas sequence and is some sequence of positive integers.