#19778: McFarland 1973 construction for difference sets
-------------------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.0
Component: combinatorial | Resolution:
designs | Merged in:
Keywords: | Reviewers:
Authors: Vincent Delecroix | Work issues:
Report Upstream: N/A | Commit:
Branch: | b3dd88ae6ff747f6c67ca20948b58269dcac73cd
u/vdelecroix/19778 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by ncohen):
Just another note: if one can obtain `q^s` with `sqrt(k-l)`, then one can
get the value of `q`. It looks easy: `k/l` is equal to
`(q^{s+1}-1)/(q^s-1)`. Thus we can compute `kq^s/l` which is equal to
`q^{s+1}-1` and so compute `q^{s+1}`, which we can divide by `q^s` to get
`q`.
--
Ticket URL: <http://trac.sagemath.org/ticket/19778#comment:15>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
