Home > Research > Publications & Outputs > Very odd sequences.
View graph of relations

Very odd sequences.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

  • Nicholas F. J. Inglis
  • Julian D. A. Wiseman
<mark>Journal publication date</mark>07/1995
<mark>Journal</mark>Journal of Combinatorial Theory, Series A
Issue number1
Number of pages8
Pages (from-to)89-96
Publication StatusPublished
<mark>Original language</mark>English


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.