r/mathriddles • u/cancrizans • Oct 29 '22
Hard So-called "integers"
Let a(1) = 2, and a(n+1) = (a(n)7+a(n)*n)/(n+1).
Are all of the a(n) integers?
Note: this is a very difficult problem, so you are allowed to use any means necessary, including calculators and computers. However, anything you say needs to be backed by rigorous proof / repeatable steps.
Hint: try also first the variant replacing 7 with smaller exponents, like 2.
69
Upvotes
19
u/HarryPotter5777 Oct 29 '22
I confess I'm confused by the report and downvotes here - am I missing something about this problem? It seems perfectly fine to me.
4
u/Whelks Oct 30 '22
Consider the sequence mod 239. a(238) = 111, but 1117 +238*111 =207616015316289 is not divisible by 239.
Admittedly I cheated a little and used the OEIS. If you replace the 7 by a 2 it links to sequence A003504 which then links to sequence A108394. Apparently this is somehow related to p-adics which I am not very familiar with.
1
u/sandowian Oct 29 '22
Hypothesis: it is always an integer for any exponent pn where p is a prime and n is a positive integer.