Category:Mathematical problems
![]() | Computing portal |
Here is a list of articles in the Mathematical problems category of the Computing portal that unifies foundations of mathematics and computations using computers.
Subcategories
This category has the following 6 subcategories, out of 6 total.
C
M
P
U
Pages in category "Mathematical problems"
The following 94 pages are in this category, out of 94 total.
- Mathematical problem (computing)
A
- Alhazen's problem (computing)
- Angle trisection (computing)
B
- Basel problem (computing)
- Behrens–Fisher problem (computing)
- Birthday problem (computing)
- Block-stacking problem (computing)
- Boolean Pythagorean triples problem (computing)
- Boundary value problem (computing)
C
- Carpenter's rule problem (computing)
- Cauchy problem (computing)
- Cheryl's Birthday (computing)
- Circulation problem (computing)
- Class number problem (computing)
- Clock angle problem (computing)
- Congruence lattice problem (computing)
- Covering problems (computing)
D
- Dining cryptographers problem (computing)
- Dirichlet problem (computing)
- Disk covering problem (computing)
- Dissection problem (computing)
- Doubling the cube (computing)
E
- Eight queens puzzle (computing)
- Envy-free cake-cutting (computing)
- Erdős discrepancy problem (computing)
F
- Fagnano's problem (computing)
- Finite lattice representation problem (computing)
- Finite volume method for three-dimensional diffusion problem (computing)
- Firing squad synchronization problem (computing)
G
- Guillotine problem (computing)
H
- Hadwiger–Nelson problem (computing)
- Halting problem (computing)
- Hamburger moment problem (computing)
- Hansen's problem (computing)
- Happy ending problem (computing)
- Hausdorff moment problem (computing)
- Heilbronn triangle problem (computing)
- Hurwitz problem (computing)
I
- Illumination problem (computing)
- Invariant subspace problem (computing)
J
- Josephus problem (computing)
K
- Kirkman's schoolgirl problem (computing)
- Klee's measure problem (computing)
- Knight's tour (computing)
- Kuratowski's closure-complement problem (computing)
L
- Langley's Adventitious Angles (computing)
- Langley’s Adventitious Angles (computing)
- Lattice problem (computing)
- Littlewood–Offord problem (computing)
M
- Minimum-cost flow problem (computing)
- Moment problem (computing)
- The monkey and the coconuts (computing)
- Monty Hall problem (computing)
- Mountain climbing problem (computing)
- Mrs. Miniver's problem (computing)
N
- Napkin ring problem (computing)
- Napoleon's problem (computing)
- Necklace splitting problem (computing)
- Network simplex algorithm (computing)
- Newton's minimal resistance problem (computing)
- Newton–Pepys problem (computing)
- No-three-in-line problem (computing)
O
- Oberwolfach problem (computing)
- Orchard-planting problem (computing)
P
- Parity problem (sieve theory) (computing)
- Plateau's problem (computing)
- Postage stamp problem (computing)
- Prescribed Ricci curvature problem (computing)
- Prescribed scalar curvature problem (computing)
- Prouhet–Tarry–Escott problem (computing)
R
- Regiomontanus' angle maximization problem (computing)
- Riemann–Hilbert problem (computing)
S
- Schoenflies problem (computing)
- Seven Bridges of Königsberg (computing)
- Snellius–Pothenot problem (computing)
- Spherical Bernstein's problem (computing)
- Square trisection (computing)
- Squaring the circle (computing)
- Squaring the square (computing)
- Stable marriage problem (computing)
- Stable roommates problem (computing)
- Stieltjes moment problem (computing)
T
- Tarski's circle-squaring problem (computing)
- Three utilities problem (computing)
- Traveling tournament problem (computing)
- Turán's brick factory problem (computing)
V
- Vertex enumeration problem (computing)
W
- Waring's problem (computing)
- Water pouring puzzle (computing)
- Whitehead problem (computing)
Y
- Yamabe problem (computing)
Z
- Zarankiewicz problem (computing)
- Zero-sum problem (computing)
- Znám's problem (computing)