Mathematics · Recurrence Relations
Let n denote a positive integer. Suppose a function f is defined recursively as: f(1) = 0 f(n) = f(⌊n/2⌋ + 1) for n > 1 What is the value of f(25) and what property of n does this function compute?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 114, ⌊n/2⌋
- 24, ⌊n/2⌋
- 314, ⌊log2n⌋
- 44, ⌊log2n⌋✓
Correct answer
4, ⌊log2n⌋
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Recurrence Relations MCQs →Want more practice questions on Recurrence Relations?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Recurrence Relations