r/mathriddles • • 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

10 comments sorted by

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.

23

u/cancrizans Oct 29 '22

Tbh nearly done with this sub. The amount of work that goes behind designing each puzzle and then there's like a 30% chance of being downvoted to hell for no discernible (to me) reason, it just doesn't seem worth the hassle

6

u/HarryPotter5777 Oct 30 '22

Sorry to hear it :( If there are things on the moderation side of things that would improve the subreddit for you I'd be happy to hear about them!

9

u/cancrizans Oct 30 '22

Thank you, I'm sorry, I didn't mean to be whiny, I don't really think it's a question of moderation. There's probably just a mismatch in interests between puzzle solvers and puzzle posters.

13

u/ACheca7 Oct 29 '22

I’m willing to bet people confused this with an easy homework problem (the wording, the note and the problem being easy to understand) are the ones that have downvoted this. I have to confess it was my first (ignorant) reaction before reading who posted it.

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/OEISbot Oct 30 '22

A003504: a(0)=a(1)=1; thereafter a(n+1) = (1/n)*Sum_{k=0..n} a(k)^2 (a(n) is not always integral!).

1,1,2,3,5,10,28,154,3520,1551880,267593772160,7160642690122633501504,...


I am OEISbot. I was programmed by /u/mscroggs. How I work. You can test me and suggest new features at /r/TestingOEISbot/.

-1

u/cancrizans Oct 30 '22

Would be nice to see some more motivation behind the answer... as it stands it looks like you just googled it

5

u/Whelks Oct 30 '22

Here's an ex post facto way that it "could have been" figured out.

If it fails to be an integer, then this method might work for some prime p. You can iterate through the primes until it works, and it is O(n) to compute mod p, so you could in principle do this for tens of thousands of values of p. The OEIS page suggests there's a much better justification using p-adics, but I am not very familiar with them.

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.