-1

Struggling to approach keep ending with solutions that do not work.

Find the generating function for the recurrence:

$$a_{+1}= \frac{a_}3 + 1, \quad ≥ 0$$

with the initial condition $a_0 =0$.

Martin
  • 1
  • 1
    This will be closed if you show no effort. You didn't even type the question, only used a camera. – coffeemath Oct 10 '23 at 20:05
  • Sorry about that coffeemath, was trying to enter the characters on my keyboard but was having trouble – Martin Oct 10 '23 at 20:11
  • So what did you try specifically? – emacs drives me nuts Oct 10 '23 at 20:16
  • went in using the examples from https://math.libretexts.org/Bookshelves/Combinatorics_and_Discrete_Mathematics/Applied_Combinatorics_(Keller_and_Trotter)/09%3A_Recurrence_Equations/9.06%3A_Using_generating_functions_to_solve_recurrences but wasn't computing well since the +1 term, I know 1,1,1,1 = 1/(1-x) but I wasn't getting correct final answers
  • – Martin Oct 10 '23 at 20:19
  • I went in trying to manipulate the sums, from f(x)= 3a0+ 3Sum (an+1) x^(n+1) - (1/x-1) but I resulted in f(x) = -2x^2/ (1-x)(1-3x) which doesn't work
  • – Martin Oct 10 '23 at 20:20
  • I know I'm overlooking something here but I've just been stumped on this question all day – Martin Oct 10 '23 at 20:21
  • For future reference, the details you've added in comments should have been added to the body of your question – user170231 Oct 10 '23 at 20:49
  • Thanks User170231, really appreciate the guidance, I'll make sure to do that moving forward! – Martin Oct 10 '23 at 22:17