PROBLEMS ON COMBINATORIAL PROPERTIES OF PRIMES
From MaRDI portal
Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of partitions of integers (05A17) Congruences; primitive roots; residue systems (11A07) Other combinatorial number theory (11B75) Goldbach-type theorems; other additive questions involving primes (11P32) Elementary theory of partitions (11P81) Partitions; congruences and congruential restrictions (11P83) Primes (11A41)
Abstract: For let be the number of primes not exceeding . The asymptotic behaviors of the prime-counting function and the -th prime have been studied intensively in analytic number theory. Surprisingly, we find that and have many combinatorial properties which should not be ignored. In this paper we pose 60 open problems on combinatorial properties of primes (including connections between primes and partition functions) for further research. For example, we conjecture that for any integer one of the numbers is prime; we also conjecture that for any integer there exists a prime such that is a primitive root modulo . One of our conjectures involving the partition function states that for any prime there is a primitive root modulo with .
Recommendations
- Some problems in combinatorial number theory
- Из проблем теории простых чисел
- scientific article; zbMATH DE number 3414378
- scientific article; zbMATH DE number 3737735
- scientific article; zbMATH DE number 3477291
- Some number-theoretic combinatorial problems
- scientific article; zbMATH DE number 568794
- scientific article; zbMATH DE number 653235
Cited in
(2)
This page was built for publication: PROBLEMS ON COMBINATORIAL PROPERTIES OF PRIMES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3461839)