A study about ternary sequences
碩士 === 國立政治大學 === 應用數學研究所 === 102 === The problem of the number of ternary sequences of length n with : (a) 0 is even, 1 is even, (b) 0 is even, 1 is odd, (c) 0 is odd, 1 is even, (d) 0 is odd, 1 is odd, has been solved by recurrence relations before. We solve the problem by constructingone-to-one...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/93296495249539412319 |
| Summary: | 碩士 === 國立政治大學 === 應用數學研究所 === 102 === The problem of the number of ternary sequences of length n with :
(a) 0 is even, 1 is even,
(b) 0 is even, 1 is odd,
(c) 0 is odd, 1 is even,
(d) 0 is odd, 1 is odd,
has been solved by recurrence relations before. We solve the problem by constructingone-to-one functions, and use the characteristics of one-to-one functions to solve this problem. Our method is simpler than those methods which have been done before.
|
|---|