Search results

  • ...se 0}+{n \choose 1}x + {n \choose 2}x^2+\cdots+</math><math>{n \choose n}x^n</math>. ...s the number of ways we can get <math>{k}</math> heads when flipping <math>n</math> different coins.
    4 KB (659 words) - 12:54, 7 March 2022
  • ...x]] <math>a</math>, <math>b</math>, and [[non-negative]] [[integer]] <math>n</math>, <center><math>(a+b)^n = \sum_{k=0}^{n}\binom{n}{k}a^{n-k}b^k</math></center>
    5 KB (935 words) - 13:11, 20 February 2024
  • ...N = p_1p_2\cdots p_n + 1</math> is not divisible by any of them, but <math>N</math> must [[#Importance of Primes|have]] a prime factor, which leads to a ...ividing larger numbers would result in a quotient smaller than <math>\sqrt{n}</math>.
    6 KB (985 words) - 12:38, 25 February 2024
  • ...in the second. For instance, one function may map 1 to 1, 2 to 4, 3 to 9, 4 to 16, and so on. This function has the rule that it takes its input value ...ve from <math>\mathbb{R} \rightarrow \mathbb{R}</math> (since <math>f(2) = 4 = f(-2)</math>) nor surjective from <math>\mathbb{R} \rightarrow \mathbb{R}
    10 KB (1,761 words) - 03:16, 12 May 2023
  • ...ructive]] approach, the first digit can be one of seven integers; <math>1, 4, 5, 6, 7, 8,</math> and <math>9</math>. Note that the first digit cannot be ...use can be, four options for the second, and so on. Hence, there are <math>4^7 = 16384</math> ways she can color the four houses.
    8 KB (1,192 words) - 17:20, 16 June 2023
  • ...the '''prime factorization''' of <math>n</math> is an expression for <math>n</math> as a product of powers of [[prime number]]s. An important theorem o <math>n = {p_1}^{e_1} \cdot {p_2}^{e_2}\cdot{p_3}^{e_3}\cdots{p_k}^{e_k}</math>
    3 KB (496 words) - 22:14, 5 January 2024
  • ...me composite numbers are <math>4=2^2</math> and <math>12=2\times 6=3\times 4</math>. Composite numbers '''atleast have 2 distinct [[prime]] [[divisors]] 4 6 8 9 10 12 14 15 16 18 20 21 22 24 25 26 27 28 30 32 33 34 35 36 38 39 40
    6 KB (350 words) - 12:58, 26 September 2023
  • ...tegers (sometimes called [[whole number]]s). In particular, <math>\mathbb{N}</math> usually includes zero in the contexts of [[set theory]] and [[abstr
    1 KB (162 words) - 21:44, 13 March 2022
  • ...ts are perpendicular. Drawing all four semi-axes divides the ellipse into 4 [[congruent (geometry)|congruent]] quarters. pair P=(3,12/5), F1=(-4,0), F2=(4,0);
    5 KB (892 words) - 21:52, 1 May 2021
  • ...46. This number can be rewritten as <math>2746_{10}=2\cdot10^3+7\cdot10^2+4\cdot10^1+6\cdot10^0.</math> ...</math>, spits out <math>P(n)</math>, the value of the polynomial at <math>n</math>. However, the oracle charges a fee for each such computation, so you
    4 KB (547 words) - 17:23, 30 December 2020
  • \text{\textbullet}&&x^{n}-y^{n}&=(x-y)(x^{n-1}+x^{n-2}y+\cdots +xy^{n-2}+y^{n-1}) ...^2 \\\phantom{\text{\textbullet}}&&- b^4 + 2 b^2 d^2 - 4 b c^2 d + c^4 - d^4&=\det\begin{bmatrix}a&b&c&d\\d&a&b&c\\c&d&a&b\\b&c&d&a\end{bmatrix}\\&&&=(a
    2 KB (327 words) - 02:06, 28 April 2024
  • ...ost surprising places, such as in the sum <math>\sum_{n=1}^\infty \frac{1}{n^2}=\frac{\pi^2}{6}</math>. Some common [[fraction]]al approximations for p ...approximates <math>\frac{\pi}{4}</math>. This can simply be multiplied by 4 to approximate <math>\pi</math>.
    8 KB (1,469 words) - 21:11, 16 September 2022
  • ...<math>F_1 = F_2 = 1</math> and <math>F_n=F_{n-1}+F_{n-2}</math> for <math>n \geq 3</math>. This is the simplest nontrivial example of a [[linear recur ...>n \geq 2</math>. In general, one can show that <math>F_n = (-1)^{n+1}F_{-n}</math>.
    6 KB (957 words) - 23:49, 7 March 2024
  • ...equence <math>(5,1)</math> majorizes <math>(4,2)</math> (as <math>5>4, 5+1=4+2</math>), Muirhead's inequality states that for any positive <math>x,y</ma x^5y^1+y^5x^1&=\frac{3}{4}\left(x^5y^1+y^5x^1\right)+\frac{1}{4}\left(x^5y^1+y^5x^1\right)\\
    8 KB (1,346 words) - 12:53, 8 October 2023
  • ...t]]s in that set, i.e. the size of the set. The cardinality of <math>\{3, 4\}</math> is 2, the cardinality of <math>\{1, \{2, 3\}, \{1, 2, 3\}\}</math> ...4\}</math> is <math>|\{3, 4\}| = 2</math>. Sometimes, the notations <math>n(A)</math> and <math>\# (A)</math> are used.
    2 KB (263 words) - 00:54, 17 November 2019
  • * Evaluate: <math>\int_2^5 x^3 dx</math> and <math>\int_{.2}^{.4} \cos(x) dx</math>. (The next few questions are meant as hints for how to ...ctly how far the object moved between times <math>t=.2</math> and <math>t=.4</math>. Interpret the distance that the object moved geometrically, as an
    11 KB (2,082 words) - 15:23, 2 January 2022
  • ...et]] of [[vertex|vertices]], <math>\{A_1, A_2, \ldots, A_n\}</math>, <math>n \geq 3</math>, with [[edge]]s <math>\{\overline{A_1A_2}, \overline{A_2A_3} ...ewer -- it will have "degenerated" from an <math>n</math>-gon to an <math>(n - 1)</math>-gon. (In the case of triangles, this will result in either a l
    2 KB (372 words) - 19:04, 30 May 2015
  • <math> \textbf{(A)}\ 5\sqrt{2} - 7 \qquad\textbf{(B)}\ 7 - 4\sqrt{3} \qquad\textbf{(C)}\ \frac{2\sqrt{2}}{27} \qquad\textbf{(D)}\ \frac{ ...s$",(W--Z),E,red); label("$s$",(X--Y),W,red); label("$s\sqrt{2}$",(W--X),N,red);
    4 KB (691 words) - 18:38, 19 September 2021
  • ...rected line segment. In many situations, a vector is best considered as an n-tuple of numbers (often real or complex). Most generally, but also most abs ...sional vector can be described in this coordinate form as an ordered <math>n</math>-tuple of numbers within angle brackets or parentheses, <math>(x\,\,y
    7 KB (1,265 words) - 13:22, 14 July 2021
  • ...2.285669651531203956336043826\ldots=x</cmath> such that:<cmath>(^24)^x=4^{4^x}\approx(3^5)^6</cmath> # Evaluate <math>(\log_2 3)(\log_3 4)(\log_4 5)\cdots(\log_{2005} 2006)</math>.
    4 KB (680 words) - 12:54, 16 October 2023

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)