Largest ramifying prime for number fields

[jwj61]

I was recently doing some computations where I wanted to search based on the largest ramifying prime. One can use the "subset of" and a list of ramifying primes, but I had to paste the list of all primes up to a pretty big bound to do it that way.

If others think this is worth adding, it could be accommodated in a couple of ways:

• change the parser for the list of ramifying primes so that it takes ranges; and when used in conjunction with "subset of", don't complain that there are non-prime values in the list.
• or, add largest ramifying prime to the database and add that as a search feature

The second option is more intrusive -- it takes up more database space and requires the completeness checker to deal with another field. On the positive side, it could then be used for sorting search results which would make them more fun to look at (e.g., if you look at all solvable fields).

[AndrewVSutherland]

I like the idea of being able to search/sort on largest ramified prime (and the search would be faster).

[roed314]

For the completeness checker, it should be possible to transform a search on largest ramified prime to a set S and use the existing code.