![]() |
|
|
#1 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
72·131 Posts |
4*x^6+27 is irreducible modulo about 5/6 of all primes, so I'm a little confused as to why msieve square root is consistently failing to find an irreducible prime for C244_131_108 for which that's the algebraic side.
(it picks 53, and indeed polrootsmod(4*x^6+27,53) = [], but so far I've had twelve 'Newton iteration failed to converge' in succession; I'm running the rest of the 36 dependencies but not terribly confidently) |
|
|
|
|
|
#2 | |
|
(loop (#_fork))
Feb 2006
Cambridge, England
144238 Posts |
Quote:
|
|
|
|
|
|
|
#3 | |
|
"Forget I exist"
Jul 2009
Dumbassville
203008 Posts |
Quote:
Code:
polisirreducible(4*x^2+27) |
|
|
|
|
|
|
#4 | |
|
Feb 2017
Nowhere
4,643 Posts |
Quote:
An irreducible polynomial of degree n can be irreducible (mod p) for some p, only if its Galois group has a n-cycle; and D6(6), being a 6-element group that isn't cyclic, hasn't got a 6-cycle. But an irreducible polynomial of degree n which defines a normal extension of Q of degree n, always splits (mod p) into factors all of the same degree, for all primes p which do not divide the discriminant. |
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| A new problem similar to the Collatz problem | dabler | Miscellaneous Math | 1 | 2018-07-28 14:03 |
| What is the problem here? | didgogns | Msieve | 1 | 2016-11-15 03:31 |
| problem with my PC | science_man_88 | Software | 1 | 2011-01-31 21:40 |
| problem I have | science_man_88 | Miscellaneous Math | 2 | 2010-10-10 16:36 |
| PSU problem? | ian209 | Hardware | 4 | 2006-02-18 19:52 |