Inglis, Nicholas F. J. and Wiseman, Julian D. A.
(1995)
*Very odd sequences.*
Journal of Combinatorial Theory, Series A, 71 (1).
pp. 89-96.
ISSN 0097-3165

## Abstract

Suppose that n ε and a = (a0, …, an − 1) is a sequence of length n with ai ε {0, 1}. For 0 k n − 1, let We call the sequence avery odd if Ak is odd for 0 k n − 1. We prove that there are very odd sequences of length n> 1 if and only if the order of 2 is odd in the multiplicative group of integers modulo 2n − 1.

Item Type:

Journal Article

Journal or Publication Title:

Journal of Combinatorial Theory, Series A

Uncontrolled Keywords:

/dk/atira/pure/subjectarea/asjc/2600/2607

Subjects:

?? discrete mathematics and combinatoricscomputational theory and mathematicstheoretical computer scienceqa mathematics ??

Departments:

ID Code:

19571

Deposited By:

Deposited On:

11 Nov 2008 09:18

Refereed?:

Yes

Published?:

Published

Last Modified:

15 Jul 2024 09:45