One and Two
任取一个首项为1且仅由1、2组成的序列,对于任意不超过该序列代数和的值,该序列一定存在的某个连续子列代数和为该值.
设有如下序列 A = ( a 0 , a 1 , a 2 , a 3 , … , a n ) a 0 = 1 ∧ ∀ a i ∈ { 1 , 2 } A = (a_0,a_1,a_2,a_3,\dots,a_n) \qquad a_0=1 \wedge \forall a_i\in\{1, 2\} A=(a0,a1,a2,a3,…,an)a0=1∧∀ai∈{1,2}.
记 f ( x , y ) = ∑ i = x y a i f(x,y) = \sum_{i=x}^y a_i f(x,y)=∑i=xyai,
那么, f ( 0 , 0 ) = 0 ∧ f ( 0 , 1 ) = 1 f(0,0) = 0 \wedge f(0,1) = 1 f(0,0)=0∧f(0,1)=1.
记 P : f ( 0 , x ) = c ∧ c ∈ N P : f(0,x) = c \wedge c \in \mathbb{N} P:f(0,x)=c∧c∈N.
如若 a x + 1 = 1 a_{x+1} = 1 ax+1=1:
那么 f ( 0 , x + 1 ) = c + 1 f(0,x+1) = c+1 f(0,x+1)=c+1,此命题同 P P P.
有 { c } → { c , c + 1 } \{c\} \rightarrow \{c, c+1\} {c}→{c,c+1}.
如若 a x + 1 = 2 a_{x+1} = 2 ax+1=2:
那么 f ( 0 , x + 1 ) = c + 2 f(0,x+1) = c+2 f(0,x+1)=c+2,此命题同 P P P,且 f ( 1 , x + 1 ) = c + 1 f(1,x+1) = c+1 f(1,x+1)=c+1.
有 { c } → { c , c + 1 , c + 2 } \{c\} \rightarrow \{c, c+1, c+2\} {c}→{c,c+1,c+2}.
综上,
{
P
→
P
{
c
}
→
{
c
,
c
+
1
}
∨
{
c
}
→
{
c
,
c
+
1
,
c
+
2
}
\begin{cases} P \rightarrow P \\ \{c\} \rightarrow \{c, c+1\} \vee \{c\} \rightarrow \{c, c+1, c+2\} \end{cases}
{P→P{c}→{c,c+1}∨{c}→{c,c+1,c+2}
对于 a 0 = 1 ∧ ∀ a i ∈ { 1 , 2 } a_0=1 \wedge \forall a_i\in\{1, 2\} a0=1∧∀ai∈{1,2},不妨记 ∑ i a i = S \sum_ia_i=S ∑iai=S.
则,于序列 A A A,有 { 0 , 1 } → [ 0 , S ] \{0, 1\} \rightarrow [0, S] {0,1}→[0,S].