Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Let sigma(n) be the sum of the divisors of n. Take six consecutive numbers. It appears that at least one of the six has sigma(n) >= 2n. Has this bebeen proved?
Let sigma(n) be the sum of the divisors of n. Take six consecutive numbers. It appears that at least one of the six has sigma(n) >= 2n. Has this be proved?
Let sigma(n) be the sum of the divisors of n. Take six consecutive numbers. It appears that at least one of the six has sigma(n) >= 2n. Has this been proved?
Do six consecutive numbers always contain an abundant or perfect number?
Let sigma(n) be the sum of the divisors of n. Take six consecutive numbers. It appears that at least one of the six has sigma(n) >= 2n. Has this be proved?
