Markov brothers' inequality

Summary

Markov brothers' inequality is an inequality^[1]. It draws 23 Wikipedia views per month (inequality category, ranking #16 of 41).^[2]

Key Facts

• Markov brothers' inequality's instance of is recorded as inequality^[3].
• Markov brothers' inequality's instance of is recorded as theorem^[4].
• Vladimir Andreyevich Markov is named after Markov brothers' inequality^[5].
• Andrey Markov is named after Markov brothers' inequality^[6].
• Markov brothers' inequality's Freebase ID is recorded as /m/0284cpd^[7].
• Markov brothers' inequality's different from is recorded as Markov's inequality^[8].
• Markov brothers' inequality's defining formula is recorded as \max_{-1 \leq x \leq 1} |P^{(k)}(x)| \leq \frac{n^2 (n^2 - 1^2) (n^2 - 2^2) \cdots (n^2 - (k-1)^2)}{1 \cdot 3 \cdot 5 \cdots (2k-1)} \max_{-1 \leq x \leq 1} |P(x)|^[9].
• Markov brothers' inequality's studied by is recorded as mathematical analysis^[10].
• Markov brothers' inequality's maintained by WikiProject is recorded as WikiProject Mathematics^[11].
• Markov brothers' inequality's Microsoft Academic ID is recorded as 2778525154^[12].
• Markov brothers' inequality's in defining formula is recorded as \max^[13].
• Markov brothers' inequality's in defining formula is recorded as P^[14].

Why It Matters

Markov brothers' inequality draws 23 Wikipedia views per month (inequality category, ranking #16 of 41).^[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.^[15]