Let n>4 be a positive integer such that n is composite (not a prime) and divides \varphi (n) \sigma (n) \plus{}1, where φ(n) is the Euler's totient function of n and σ(n) is the sum of the positive divisors of n. Prove that n has at least three distinct prime factors. functionEuleralgebrapolynomialVietaquadraticsnumber theory