Ononot — A recursive function f(n) counts the number of ways to parti

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursionhard

0:00.0

A recursive function $f(n)$ counts the number of ways to partition an integer $n$ into distinct parts. What is the correct recurrence relation?