benchmarks.wiki / Public workspace

Omni-MATH / Let p>2 be a prime number. F_(p)[x] is defined as the set of all polynomials in x with coefficients in F_(p) (the integers modulo p with usual addition and subtraction), so that tw… · Discussion

Discussing Let p>2 be a prime number. F_(p)[x] is defined as the set of all polynomials in x with coefficients in F_(p) (the integers modulo p with usual addition and subtraction), so that tw… · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.