Access the full text.
Sign up today, get DeepDyve free for 14 days.
(1943)
Noen setninger om ubestemte likninger av formen (xn®1)}(x®1) ̄ yq
(1997)
On the diophantine equations (x m j1) (x n j1) l y#
(1991)
The diophantine equations x$ l Ny#p1', Quart
E. Spence (1977)
A Family of Difference SetsJ. Comb. Theory, Ser. A, 22
(1967)
Cyclotomy and difference sets (Markham
(1992)
Difference sets ’, Contemporary design theory, a collection of sureys
(1943)
Noen setninger om ubestemte likninger av formen (x n k1)\(xk1) l y q
(1997)
On the diophantine equations (xm1
T. Storer (1967)
Cyclotomy and difference sets
(1982)
Introduction to number theory (Springer, Berlin
(1991)
The diophantine equations x$ ̄Ny#31
Let p, q be distinct odd primes, and let a, b be positive integers. In this paper we prove that if S(pa, qb) is a Storer difference set with the parameters ν = paqb, k = (ν−1)/4 and λ =(ν−5)/16, then we have a = b = 1, p=(ρ3r+ρ¯3r−1)/3 and q=ρ3r+ρ¯3r+1, where ρ=2+3, ρ¯=2−3 and r is a positive integer. 1991 Mathematics Subject Classification 05B10.
Bulletin of the London Mathematical Society – Wiley
Published: Nov 1, 2000
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.