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

Very odd sequences.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Very odd sequences. / Inglis, Nicholas F. J.; Wiseman, Julian D. A.
In: Journal of Combinatorial Theory, Series A, Vol. 71, No. 1, 07.1995, p. 89-96.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Inglis, NFJ & Wiseman, JDA 1995, 'Very odd sequences.', Journal of Combinatorial Theory, Series A, vol. 71, no. 1, pp. 89-96. https://doi.org/10.1016/0097-3165(95)90017-9

APA

Inglis, N. F. J., & Wiseman, J. D. A. (1995). Very odd sequences. Journal of Combinatorial Theory, Series A, 71(1), 89-96. https://doi.org/10.1016/0097-3165(95)90017-9

Vancouver

Inglis NFJ, Wiseman JDA. Very odd sequences. Journal of Combinatorial Theory, Series A. 1995 Jul;71(1):89-96. doi: 10.1016/0097-3165(95)90017-9

Author

Inglis, Nicholas F. J. ; Wiseman, Julian D. A. / Very odd sequences. In: Journal of Combinatorial Theory, Series A. 1995 ; Vol. 71, No. 1. pp. 89-96.

Bibtex

@article{77fb9c69736a400d88f1355d4f5e11ef,
title = "Very odd sequences.",
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.",
author = "Inglis, {Nicholas F. J.} and Wiseman, {Julian D. A.}",
year = "1995",
month = jul,
doi = "10.1016/0097-3165(95)90017-9",
language = "English",
volume = "71",
pages = "89--96",
journal = "Journal of Combinatorial Theory, Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "1",

}

RIS

TY - JOUR

T1 - Very odd sequences.

AU - Inglis, Nicholas F. J.

AU - Wiseman, Julian D. A.

PY - 1995/7

Y1 - 1995/7

N2 - 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.

AB - 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.

U2 - 10.1016/0097-3165(95)90017-9

DO - 10.1016/0097-3165(95)90017-9

M3 - Journal article

VL - 71

SP - 89

EP - 96

JO - Journal of Combinatorial Theory, Series A

JF - Journal of Combinatorial Theory, Series A

SN - 0097-3165

IS - 1

ER -