“BertrandsConjecture”的概念、定义、习题解题方法及翻译-数学辞典

单词	BertrandsConjecture
释义	Bertrand’s conjecture Bertrand conjectured that for every positive integer $n>1$ , there exists at least one prime $p$ satisfying $n<p<2n$ . This result was proven in 1850 by Chebyshev, but the phrase “Bertrand’s Conjecture” remains in the literature.
随便看	MonotonicallyIncreasing monotonically increasing MonotonicallyNondecreasing monotonically nondecreasing MonotonicallyNonincreasing monotonically nonincreasing MonotonicityCriterion monotonicity criterion MonotonicityOfTheSequence1Xnn monotonicity of the sequence (1+x/n)^n MonteCarloMethods Monte Carlo methods MonteCarloSimulation Monte Carlo simulation MontelsTheorem Montel’s theorem MooreGraph Moore graph MooreGraphsOfD2AreVvalentAndOrderIsV21 Moore graphs of d=2 are v-valent and order is v^2+1 MoorePenroseGeneralizedInverse Moore-Penrose generalized inverse MooreSpace Moore space MordellCurve

数学辞典收录了18232条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。

Bertrand’s conjecture