OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Szymanski's conjecture

 Home Mathematics Fields of mathematics Graph theory Unsolved problems in graph theory
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Szymanski's conjecture refers to a problem in the field of number theory, particularly concerning prime numbers. Specifically, it conjectures the existence of infinitely many primes of a certain form related to the sequence of prime numbers. The conjecture states that for any integer \( n \geq 1 \), there are infinitely many primes of the form \( p_k = k^2 + n \) for some positive integer \( k \).

 Ancestors (5)

  1. Unsolved problems in graph theory
  2. Graph theory
  3. Fields of mathematics
  4. Mathematics
  5.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook