Hostname: page-component-7dd5485656-dk7s8 Total loading time: 0 Render date: 2025-10-31T05:21:57.893Z Has data issue: false hasContentIssue false
  • English
  • Français

On Maximal Residue Difference Sets Modulo p

Published online by Cambridge University Press:  20 November 2018

J. Fabrykowski
J. Fabrykowski*
Affiliation:
Department of Mathematics and Astronomy University of Manitoba Winnipeg, Manitoba R3T 2N2
Rights & Permissions [Opens in a new window]

Abstract

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.

A residue difference set modulo p is a set A = {a1,a2,...,ak} of integers 1 ≤ ai ≤ p — 1 such that for all i and j with i ≠ j, where is the Legendre symbol. We give a lower and an upper bound for mp —the P maximal cardinality of such set A in the case of p ≡ 1 (mod 4).

Keywords

11A0711B75

Information

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 36 , Issue 2 , 01 June 1993 , pp. 144 - 146
Copyright
Copyright © Canadian Mathematical Society 1993

References

1. Buell, D. A. and Williams, K. S., Maximal Residue Difference Sets Modulo p, Proc. Amer. Math. Soc. 69(1978), 205–209.Google Scholar