Recurrence Relationshard
0:00.0

A software company's user base grows according to Un=1.2Un1+5000U_n = 1.2 U_{n-1} + 5000, where UnU_n is the user count at the end of month nn, with U0=10,000U_0 = 10,000.

The general solution is Un=Un(h)+Un(p)=c1.2n+Un(p)U_n = U_n^{(h)} + U_n^{(p)} = c \cdot 1.2^n + U_n^{(p)}. What is the particular solution Un(p)U_n^{(p)}?