Problem: The largest of the following integers which divides each of the members of the sequence 15β1,25β2,35β3,β¦,n5βn,β¦ is:
Answer Choices:
A. 1
B. 60
C. 15
D. 120
E. 30
Solution:
Since n5βn=(nβ1)n(n+1)(n2+1)=k(n2+1), where k is a product of 3 consecutive integers, k is always divisible by 6 at least. We show next that in addition, n5βn is always divisible by 5. If we divide n by 5, we get a remainder whose value is either 0,1,2,3, or 4; i.e.,
n=5q+r,r=0,1,2,3 or 4.
By the binomial theorem,
βn5βn=(5q+r)5β(5q+r)=(5q)5+5(5q)4r+10(5q)2r2+10(5q)2r3+5(5q)r4+r5β5qβr.=5N+r5βr,where N is an integer If r=0,n5βn=5N is divisible by 5. If r=1,n5βn=5N is divisible by 5. If r=2,n5βn=5N+30=5(N+6)is divisible by 5. If r=3,n5βn=5N+240=5(N+48)is divisible by 5. If r=4,n5βn=5N+1020=5(N+204) is divisible by 5. Thus, for all integers n,n5βn is divisible by 5 and by 6 hence by 30; β
or
n5βn=n(n4β1) is divisible by 5 since npβ1β‘1(modp) where p is a prime. β΄n5βn is divisible by 30.