Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
A finite field is a field with a finite number of elements. For each prime power $q^k$, there is a unique (up to isomorphism) finite field with $q^k$ elements. Up to isomorphism, these are the only finite fields.
4
votes
Intersections of products of Sylow $p$-subgroups
The answer to your both questions is 6. Consider the symmetric group $S_3=\langle a,b\mid a^2=b^3=1, b^a=b^{-1}\rangle$, and take $P_1=\langle a\rangle$, $P_2=\langle ab\rangle$, $P_3=\langle ab^2\ran …
3
votes
1
answer
288
views
Number of solutions of a degree 4 polynomial equation over a finite field
Suppose that $q$ is a prime power and $\xi, \eta\in \mathbb{F}_q$ are nonzero. A computer calculation for $q<70$ suggests that the number $N$ of $4$-tuples
$(a,b,c,d)\in\mathbb{F}_q^{4}$ satisfying $( …
2
votes
computer algebra system for polynomial algebras over finite fields
In addition, Magma http://magma.maths.usyd.edu.au/magma/
and GAP http://www.gap-system.org/ will perform these computations.
The former is commercial and the latter is free. If you want to compute
ove …