ProjectEuler 463 A weird recurrence re - 拼圖
By Leila
at 2014-04-17T04:21
at 2014-04-17T04:21
Table of Contents
463. A weird recurrence relation
http://projecteuler.net/problem=463
一函數f對所有正整數定義如下:
‧f(1) = 1
‧f(3) = 3
‧f(2n) = f(n)
‧f(4n+1) = 2f(2n+1) - f(n)
‧f(4n+3) = 3f(2n+1) - 2f(n)
定義函數S(n)為Σf(i)對1≦i≦n的和。
S(8) = 22以及S(100) = 3604。
請求出S(3^37),並給出結果的末九位數作為答案。
--
http://projecteuler.net/problem=463
一函數f對所有正整數定義如下:
‧f(1) = 1
‧f(3) = 3
‧f(2n) = f(n)
‧f(4n+1) = 2f(2n+1) - f(n)
‧f(4n+3) = 3f(2n+1) - 2f(n)
定義函數S(n)為Σf(i)對1≦i≦n的和。
S(8) = 22以及S(100) = 3604。
請求出S(3^37),並給出結果的末九位數作為答案。
--
Tags:
拼圖
All Comments
Related Posts
文字獄 001
By Olivia
at 2014-04-15T12:37
at 2014-04-15T12:37
請問原版拼圖實體店價和網拍價的差異
By Anthony
at 2014-04-13T19:36
at 2014-04-13T19:36
拼圖裡有很多相同花色的拼片
By Andrew
at 2014-04-11T09:29
at 2014-04-11T09:29
數迴app有版友推薦那一款嗎?
By Agatha
at 2014-04-06T21:32
at 2014-04-06T21:32
盲解滑塊 / Blindfold Sliding Puzzle
By Lily
at 2014-04-06T02:43
at 2014-04-06T02:43