Hostname: page-component-6898cfcb55-zkb6p Total loading time: 0 Render date: 2026-11-11T07:35:22.833Z Has data issue: false hasContentIssue false

On a Combinatorial Problem in Number Theory

Published online by Cambridge University Press:  20 November 2018

Bernt Lindström*
Affiliation:
University of Stockholm
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Given an integer k ≤ 2 and a finite set M of rational integers. Let vi (i = 1, 2, …, n) be m-dimensional (column-)vectors with all components from M and such that the kn sums

1.1

are all different. Then we shall say that {v1, v2, …, vn} is a detecting set of vectors.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1965