Computational number theory \{For software etc., see~11-04\} [See also 68W30]
6 mapped entries · Browse and filter all →
Counts include all statuses and descendants. Classifications are editorial or inferred from community fields, not an AMS assessment of the problem.
Wirsing Constant: determine C 83 or improve its bounds; the repository records 0.30366300 (lower) and 0.30366300 (upper).
Brun's constant: determine C 81 or improve its bounds; the repository records 1.840503 (lower) and 2.288513 (upper).
Class Group Algorithms. Solid result problem from Epoch AI’s FrontierMath: Open Problems; answers are checked by a verifier program.
Improve the Best-known Classical Factorization Algorithms. Breakthrough problem from Epoch AI’s FrontierMath: Open Problems; answers are checked by a verifier program.
The Elliptic-Curve Discrete Logarithm Problem (ECDLP). Major advance problem from Epoch AI’s FrontierMath: Open Problems; answers are checked by a verifier program.
A Baillie–PSW Pseudoprime. Moderately interesting problem from Epoch AI’s FrontierMath: Open Problems; answers are checked by a verifier program.
These are selected sources for the parent class. Article coverage is a first reviewed selection, and may not cover this exact subcategory.
Mathematical Sciences Publishers
Algebra, number theory and their connections
European Mathematical Society / EMS Press
Mathematical surveys
2019 · 3 questions extracted
MSC2020 © Mathematical Reviews (AMS) and zbMATH · CC BY-NC-SA 4.0 · Official PDF, page 27