|
Definition of Bertrand-Chebyshev theorem
1. Noun. (context mathematics) the theorem that there is at least one prime number between ''n'' and 2''n'' for every ''n''>1, i.e.: ¹
¹ Source: wiktionary.com
|
1. Noun. (context mathematics) the theorem that there is at least one prime number between ''n'' and 2''n'' for every ''n''>1, i.e.: ¹
¹ Source: wiktionary.com