Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-26T12:10:03.841Z Has data issue: false hasContentIssue false

On A Conjecture of Conway

Published online by Cambridge University Press:  20 November 2018

John Marica*
Affiliation:
The University of Calgary
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.

Problem 7 of Section VI of H. T. Croft's "Research Problems" (August, 1967 edition) is by J. H. Conway:

A is a finite set of integers {ai}. A + A denotes {ai + aj}, A - A denotes {ai - aj}. Prove that A - A always has more members than A + A, unless A is symmetrical about 0.

First note that 'about 0' is redundant and erroneous.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1969