锘??xml version="1.0" encoding="utf-8" standalone="yes"?>国产h在线观看,亚洲午夜一区二区,日韩.欧美.亚洲http://www.aygfsteel.com/jimmyljb/category/13205.htmlzh-cnTue, 27 Feb 2007 12:19:32 GMTTue, 27 Feb 2007 12:19:32 GMT60concrete mathematics(1)http://www.aygfsteel.com/jimmyljb/archive/2006/07/19/58885.htmljimmyljbjimmyljbTue, 18 Jul 2006 17:33:00 GMThttp://www.aygfsteel.com/jimmyljb/archive/2006/07/19/58885.htmlhttp://www.aygfsteel.com/jimmyljb/comments/58885.htmlhttp://www.aygfsteel.com/jimmyljb/archive/2006/07/19/58885.html#Feedback0http://www.aygfsteel.com/jimmyljb/comments/commentRss/58885.htmlhttp://www.aygfsteel.com/jimmyljb/services/trackbacks/58885.html聽聽聽 What is the maximum number L, of regions defined by n lines in the plane? 聽聽聽 L0 = 1 聽聽聽 Ln = Ln-1 + n (n>0) =>>聽聽 Ln = n(n+1)/2 +1
Suppose that instead of straight lines we use bent lines, each containing one 鈥渮ig!", such as "<" 聽聽聽 Zn = L2n - 2n = 2n(2n+1)/2+1-2n = 2n^2-n+1 (n>=0)
1.3) THE JOSEPHUS PROBLEM 聽聽聽 In our variation, we start with n people numbered 1 to n around a circle,and we eliminate every second remaining person until only one survives. 聽聽聽 J(1) = 1 ; 聽聽聽 J(2n) = 2J(n) - 1 , for n > 1; 聽聽聽 J(2n + 1) = 2J(n) + 1 ==>>J(2^m+l) = 2*l+1;
for binary number 聽聽聽 J(ABCDEF) = 2*BCDEFA + 1 (A,B,C,D,E,F = 0,1) 聽聽聽 J(1...1...) = 1...1... 聽 (A = 1)
涔犻鏈変竴涓槸姹夎濉旂殑棰樼洰錛岃鏄疉 C B涓笉鍏佽A鍜孊涔嬮棿浜ゆ崲錛屽嵆鍙兘to or from C銆?br />榪欓噷寰楀埌涓涓畝鍗曠殑閫掑綊灝辨槸A(n) = 3A(n-1)+2 (n >= 1)錛岀悊鐢辨槸鎶妌-1涓浠嶢緇忕敱C縐誨埌B錛屽啀鎶婃渶搴曚笅鐨勭n鍧椾粠A縐誨姩C錛屽啀鎶妌-1鍧椾粠B緇忕敱C縐誨埌A錛屽啀鎶奀涓殑絎琻鍧椾粠C縐誨埌B錛屾渶鍚庢妸A鐨刵-1鍧椾粠A縐誨埌B銆?br />
J(1) = 1 ;