返回题库

HMMT 二月 2001 · 冲刺赛 · 第 50 题

HMMT February 2001 — Guts Round — Problem 50

专题
Discrete Math / 离散数学
难度
L3
来源
HMMT

题目详情

  1. [9] The Fibonacci sequence F , F , F , . . . is defined by F = F = 1 and F = 1 2 3 1 2 n +2 F + F . Find the least positive integer t such that for all n > 0, F = F . n +1 n n n + t
解析
  1. [9] The Fibonacci sequence F , F , F , . . . is defined by F = F = 1 and F = 1 2 3 1 2 n +2 F + F . Find the least positive integer t such that for all n > 0, F = F . n +1 n n n + t Solution: 60 .