Finding the Value of $f(84)$ in an Integer Function

Click For Summary
SUMMARY

The function defined as \( f(x) = \begin{cases} x - 3 & x \geq 1000 \\ f[f(x + 5)] & x < 1000 \end{cases} \) requires evaluation of \( f(84) \). Since \( 84 < 1000 \), the recursive nature of the function necessitates calculating \( f(f(89)) \), which in turn requires evaluating \( f(89) \) and so forth until reaching a base case. The discussion highlights the importance of understanding recursive functions and induction techniques to derive the final value of \( f(84) \).

PREREQUISITES
  • Understanding of recursive functions
  • Familiarity with mathematical induction
  • Basic knowledge of integer properties
  • Experience with function definitions in mathematics
NEXT STEPS
  • Study recursive function evaluation techniques
  • Learn mathematical induction proofs
  • Explore integer function properties and behaviors
  • Practice solving similar recursive function problems
USEFUL FOR

Mathematicians, computer scientists, and students interested in recursive functions and mathematical induction techniques will benefit from this discussion.

Albert1
Messages
1,221
Reaction score
0
$\text{given } :x \in\mathbb{Z}$

$f(x)= \begin{cases}x-3 & x \geq 1000 \\f\big [f(x+5)\big ]& x<1000 \end{cases} $

$\text{find } :\,\, f(84)$
 
Mathematics news on Phys.org
Albert said:
$\text{given } :x \in\mathbb{Z}$

$f(x)= \begin{cases}x-3 & x \geq 1000 \\f\big [f(x+5)\big ]& x<1000 \end{cases} $

$\text{find } :\,\, f(84)$

Lemma
$f(x)= \begin{cases}
x-3 & x \geq 1000 \\
997 & x<1000 \text{ and $x$ even} \\
998 & x<1000 \text{ and $x$ odd} \\
\end{cases} $

Proof
Use full induction going down.
Initial condition: we can verify that it is true for any $x \ge 997$.
Induction step: suppose it is true for any $x$ and some $y$ with $y < x$ and $y< 997$.
Then we need to distinguish the cases that $y$ is even or $y$ is odd.
When we fill in what we already have for $f(y)$ it follows that the given formula is also true for $f(y)$, which completes the proof.

Using the lemma we find that $f(84) = 997$.
 
I like Serena said:
Lemma
$f(x)= \begin{cases}
x-3 & x \geq 1000 \\
997 & x<1000 \text{ and $x$ even} \\
998 & x<1000 \text{ and $x$ odd} \\
\end{cases} $

Proof
Use full induction going down.
Initial condition: we can verify that it is true for any $x \ge 997$.
Induction step: suppose it is true for any $x$ and some $y$ with $y < x$ and $y< 997$.
Then we need to distinguish the cases that $y$ is even or $y$ is odd.
When we fill in what we already have for $f(y)$ it follows that the given formula is also true for $f(y)$, which completes the proof.

Using the lemma we find that $f(84) = 997$.
I like Serena :very smart induction (Clapping)
 
My approach is different from I like serena

we evaluate f(999) through f(995)

f(999) = 998
f(998) = 997
f(997) = 998
f(996) = 997
f(995) = 998

now f(85)= f^183 (998) notation for f is applied 183

applying f twice gives 998 and so on applying 182 time gives 998 and then once more gives 997 which is the ans
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
1K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 20 ·
Replies
20
Views
4K
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K