First, we are given the recurrence relation Ur=Ur−1+8(r−1). Since U2=9, we can find U1 by setting r=2: U2=U1+8(2−1) 9=U1+8(1) U1=9−8=1 Next, we can find U3 by setting r=3: U3=U2+8(3−1) U3=9+8(2) U3=9+16=25 Then, we find U4 by setting r=4: U4=U3+8(4−1) U4=25+8(3) U4=25+24=49 Now, we want to find an expression for Ur in terms of r. Ur=Ur−1+8(r−1) We can write out the first few terms to see if we can identify a pattern.
U2=U1+8(1)=1+8=9 U3=U2+8(2)=9+16=25 U4=U3+8(3)=25+24=49 U5=U4+8(4)=49+32=81 Notice that the terms are 12,32,52,72,92,... So Ur=(2r−1)2. Let's prove this using induction.
Base case: r=1, U1=(2(1)−1)2=12=1, which matches our value. Assume Uk=(2k−1)2 for some k≥1. Then Uk+1=Uk+8(k+1−1)=(2k−1)2+8k=4k2−4k+1+8k=4k2+4k+1=(2k+1)2=(2(k+1)−1)2. So the formula holds for Uk+1. By induction, Ur=(2r−1)2 for all r≥1.