Opened 13 months ago
Closed 13 months ago
#31709 closed enhancement (duplicate)
Accept GF((p, d)) to construct GF(p^d)
Reported by: | vdelecroix | Owned by: | |
---|---|---|---|
Priority: | major | Milestone: | sage-duplicate/invalid/wontfix |
Component: | finite rings | Keywords: | |
Cc: | slelievre | Merged in: | |
Authors: | Reviewers: | ||
Report Upstream: | N/A | Work issues: | |
Branch: | Commit: | ||
Dependencies: | Stopgaps: |
Description
In the constructor GF
of a finite field the first task of sage is to decompose the argument q
as a prime power. Since most users enter their argument as p^d
this is a very useless task. We propose a new syntax GF((p, d))
(or GF(p, d)
?) to construct a finite field.
Possibly, we could tweak the sage preparser to automatically transform GF(p^d)
into GF((p, d))
.
Change History (5)
comment:1 Changed 13 months ago by
- Summary changed from Accept `GF((p, d))` to construct `GF(p^d)` to Accept GF((p, d)) to construct GF(p^d)
comment:2 Changed 13 months ago by
- Component changed from number fields to finite rings
comment:3 Changed 13 months ago by
Oops there was already a ticket:
- #17568: Allow syntax
FiniteField(p, n)
comment:4 Changed 13 months ago by
- Milestone changed from sage-9.4 to sage-duplicate/invalid/wontfix
- Status changed from new to needs_review
comment:5 Changed 13 months ago by
- Resolution set to duplicate
- Status changed from needs_review to closed
Note: See
TracTickets for help on using
tickets.
In addition to making
GF(q)
work whenq
is either of the following:p^d
(already works)(p, d)
(definitely wanted)there was a suggestion at #31686 to also acceptÂ
Factorization([(p, d)])
.