[seqfan] Re: Question about abundant numbers (A5101)

[Amiram Eldar]

It is an interesting question.
I find that there are counterexamples, the least of them is 9272.

Best regards.

On Mon, Dec 12, 2022 at 8:32 PM Alonso Del Arte <alonso.delarte at gmail.com>
wrote:

> Given an abundant number *n*, is it always the case that there are at least
> two subsets of *n*'s divisors that add up to *n* + 1?
>
> e.g., *n* = 70, we see that obviously 1 + 70 = 71 but also 35 + 14 + 10 +
> 7 + 5 = 71.
>
> Al
>
> --
> Alonso del Arte
> Author at SmashWords.com
> <https://www.smashwords.com/profile/view/AlonsoDelarte>
> Musician at ReverbNation.com <http://www.reverbnation.com/alonsodelarte>
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>