Recursive Formulas for Geometric Sequences
I keep running into students who can calculate the common ratio but freeze when asked to write a recursive definition. The problem isn't the math itself. It's that recursive and explicit formulas do different things, and people mix them up until they're solving the wrong question. A geometric sequence is defined by a starting value and a multiplier. Write it recursively and you tell someone how to get from term n to term n+1. Write it explicitly and you jump straight to any position. Both are correct. They just answer different questions.
What Is The Recursive Formula For This Geometric Sequence Apex
The recursive formula for any standard geometric sequence is simple: a equals the first term, and a equals r times a for n greater than 1. That's it. The entire structure lives in that two-line definition. You state the base case, then you state the recurrence relation. No fancy notation needed. I learned this the hard way during a tutoring session in fall 2023. A student had a sequence where the apex or maximum value appeared at term 4, and the terms were decreasing on both sides. She was trying to force a single recursive formula over the whole thing. I had to explain that a sequence with a true apex and different behavior on each side isn't a single geometric sequence at all. It's two geometric pieces joined at the peak. Each piece has its own common ratio and its own recursive formula. Trying to write one formula for the whole thing is like writing one equation for a piecewise function. It won't work cleanly. Here's the exact workaround I use now. Split the sequence at the apex. Write the left side as one recursive system starting from a with ratio r. Write the right side as another recursive system starting from the apex term with ratio r. If r happens to equal 1 over r, which it usually does in textbook problems, you can express the relationship between the two ratios explicitly. That extra step is what most guides skip, and it's the step that actually matters when you're grading or verifying work.
Let me give you a concrete example from a real problem I worked through last semester. The sequence goes like this: 3, 6, 12, 24, 12, 6, 3. The apex is at term 4 with value 24. On the left side, the recursive formula is a equals 3 and a equals 2 times a for n between 2 and 4. On the right side, the recursive formula is a equals 24 and a equals one half times a for n between 5 and 7. Notice how the ratio flips. The left side multiplies by 2. The right side multiplies by one half. Together they form a symmetric pattern around the apex, but each side is its own independent geometric sequence. One counter-intuitive thing most beginners miss: the recursive formula doesn't care about the apex at all. The apex is a property of the sequence values, not a parameter in the formula. When people ask for "the recursive formula for the apex sequence," they usually mean they want the formula that generates the sequence containing the apex. The apex itself is just the maximum value in the list. You don't plug it into the recurrence. You find it after you compute the terms. Another thing that trips people up: recursive formulas are order-dependent. If you shuffle the terms, the recursive formula changes completely even though the set of values is identical. I once saw a student hand in work where she listed the terms in descending order, wrote a recursive formula for that order, and called it equivalent to the ascending-order formula. They're not. Same numbers. Different recurrence relations. Different answers when you extend past the given terms.
Get the Full Details
There are real limitations here. Recursive formulas don't scale well for large n. If you need term 1000, computing it recursively means doing 999 multiplications in sequence. An explicit formula like a equals a times r to the n minus 1 power gives you that answer in one step. In practice, I use recursive definitions when I'm building sequences step by step, like in programming or recurrence relations in discrete math. I switch to explicit formulas when I need a specific distant term or when I'm analyzing long-term behavior. Also worth noting: not every sequence with an obvious peak can be split into two geometric pieces. If the ratios on either side of the apex don't form clean geometric progressions, the whole recursive approach breaks down. In those cases you're dealing with a non-geometric sequence, and you need a different tool entirely. Polynomial fitting, numerical methods, or just accepting that no closed form exists. I've wasted hours trying to force geometric recursive formulas onto data that was clearly generated by a completely different process. The data didn't care about my preference for clean ratios. If you're working on a problem and you're not sure whether a sequence is geometric, check the ratios first. Divide each term by the previous term. If the results are consistent, you have a geometric sequence and the recursive formula applies directly. If the ratios drift even slightly, stop and reconsider your approach before writing any formula. A wrong recursive definition is worse than no definition at all, because it gives you false confidence in your answers.
