Skip to content

Problems · Vela Mathematics Program

Narrowed toopen ×not formalized ×Clear all

Problem ledger

285 problems · 2/6NumberSourcesGraph view
declared openerdos:338
Erdős problem 338
number theoryadditive basisN/A
declared openerdos:345
Erdős problem 345
number theorycomplete sequencesA0016612 sources
declared openerdos:365
Erdős problem 365
number theoryA060355 · A060859 · A175155
declared openerdos:367
Erdős problem 367
number theoryA0575213 sources
declared openerdos:368
Erdős problem 368
number theoryA0743993 sources
declared openerdos:374
Erdős problem 374
number theoryA388851 · A387184 · A389117 · A3891482 sources
declared openerdos:382
Erdős problem 382
number theoryA388850
declared openerdos:388
Erdős problem 388
number theoryN/A2 sources
declared openerdos:393
Erdős problem 393
number theoryfactorialsA3883022 sources
declared openerdos:404
Erdős problem 404
number theoryfactorialsN/A
declared openerdos:408
Erdős problem 408
number theoryiterated functionsA049108
declared openerdos:411
Erdős problem 411
number theoryiterated functionsA383044 · possible2 sources
declared openerdos:415
Erdős problem 415
number theorypossible2 sources
declared openerdos:420
Erdős problem 420
number theoryN/A
declared openerdos:423
Erdős problem 423
number theoryA0052432 sources
declared openerdos:425
Erdős problem 425
number theorysidon setspossible2 sources
declared openerdos:430
Erdős problem 430
number theorypossible
declared openerdos:431
Erdős problem 431
number theoryprimesN/A
declared openerdos:432
Erdős problem 432
number theoryN/A2 sources
declared openerdos:436
Erdős problem 436
number theoryA000445 · possible
declared openerdos:451
Let nkn_k be the least integer greater than 2k2k for which ∏i=1k(nk−i)\prod_{i=1}^k (n_k - i) has no prime factor in (k,2k)(k, 2k). How rapidly must nkn_k grow?
number theoryA3866203 sources
declared openerdos:452
Erdős problem 452
number theorypossible
declared openerdos:460
Erdős problem 460
number theoryN/A2 sources
declared openerdos:461
Erdős problem 461
number theoryprimespossible
declared openerdos:462
Erdős problem 462
number theoryprimesA032742 · possible
declared openerdos:467
Erdős problem 467
number theoryN/A
declared openerdos:468
Erdős problem 468
number theorydivisorsA167485 · A387502 · A387503
declared openerdos:472
Erdős problem 472
number theoryA389713 · possible
declared openerdos:478
Erdős problem 478
number theoryfactorialsA210184
declared openerdos:483
Erdős problem 483
number theoryadditive combinatoricsramsey theoryA030126
declared open · $500erdos:500
Erdős problem 500
graph theoryhypergraphsturan numberA140462
declared openerdos:514
For a transcendental entire function, how fast can ∣f(z)∣|f(z)| be forced to grow along a path to infinity, and how short can such a path be in terms of the maximum modulus M(r,f)M(r, f)?
analysisN/A4 sources
declared openerdos:524
Erdős problem 524
analysisprobabilitypolynomialsN/A3 sources
declared openerdos:528
Erdős problem 528
geometryA387897 · A156816
declared openerdos:529
Erdős problem 529
geometryprobabilityN/A
declared openerdos:530
Erdős problem 530
number theorysidon setsA143824 · possible
declared openerdos:531
Erdős problem 531
number theoryramsey theorypossible
declared openerdos:544
Erdős problem 544
graph theoryramsey theoryA000791
declared openerdos:545
Erdős problem 545
graph theoryramsey theoryA059442 · possible
declared openerdos:550
Let m1≤⋯≤mkm_1\leq\cdots\leq m_k and nn be sufficiently large. If TT is a tree on nn vertices and GG is the complete multipartite graph with vertex class sizes m1,…,mkm_1,\ldots,m_k, prove that R(T,G)≤(χ(G)−1)(R(T,Km1,m2)−1)+m1R(T,G)\leq (\chi(G)-1)(R(T,K_{m_1,m_2})-1)+m_1.
graph theoryramsey theoryN/A4 sources
declared openerdos:552
Erdős problem 552
graph theoryramsey theoryA006672
declared openerdos:554
Erdős problem 554
graph theoryramsey theorypossible
declared openerdos:555
Erdős problem 555
graph theoryramsey theoryA389313 · possible
declared openerdos:557
Erdős problem 557
graph theoryramsey theoryN/A
declared openerdos:558
Erdős problem 558
graph theoryramsey theorypossible
declared openerdos:560
Erdős problem 560
graph theoryramsey theorypossible
declared openerdos:561
Erdős problem 561
graph theoryramsey theoryN/A
declared openerdos:563
Erdős problem 563
graph theoryramsey theoryhypergraphsN/A
declared openerdos:568
Erdős problem 568
graph theoryramsey theoryN/A
declared openerdos:569
Erdős problem 569
graph theoryramsey theoryN/A

Search problems.science

Find a Problem, Result, source, or page