Skip to main content
added 2 characters in body
Source Link
user47870
user47870

{a(n)} is such a sequence, satisfying,

  1. For all a(i) ∈ {a(n)}, a(i) =1 or -1

  2. Let S(j) = Sum[a(i) , {i ,1, j}], then for all 1<=j<=n ,S(j)>=0.

For a given n , how many a{a(n)} are there?

{a(n)} is such a sequence, satisfying,

  1. For all a(i) ∈ {a(n)}, a(i) =1 or -1

  2. Let S(j) = Sum[a(i) , {i ,1, j}], then for all 1<=j<=n ,S(j)>=0.

For a given n , how many a(n) are there?

{a(n)} is such a sequence, satisfying,

  1. For all a(i) ∈ {a(n)}, a(i) =1 or -1

  2. Let S(j) = Sum[a(i) , {i ,1, j}], then for all 1<=j<=n ,S(j)>=0.

For a given n , how many {a(n)} are there?

Source Link
user47870
user47870

A problem of a sequence and its sum

{a(n)} is such a sequence, satisfying,

  1. For all a(i) ∈ {a(n)}, a(i) =1 or -1

  2. Let S(j) = Sum[a(i) , {i ,1, j}], then for all 1<=j<=n ,S(j)>=0.

For a given n , how many a(n) are there?