Search results

  • draw(D--(30,4)--(34,4)--(34,0)--D); 1. If the sides of a triangle have lengths 2, 3, and 4, what is the radius of the circle circumscribing the triangle?
    6 KB (1,003 words) - 09:11, 7 June 2023
  • A=(4,2); D=(3,4);
    3 KB (575 words) - 15:27, 19 March 2023
  • pair A=(-1,5), B=(-4,-1), C=(4,-1), D, O; *If the sides of a triangle have lengths 2, 3, and 4, what is the radius of the circle circumscribing the triangle?
    4 KB (658 words) - 16:19, 28 April 2024
  • ...ath>\mathbb{N}</math> corresponds to the sequence <math>X = (x_n) = (0, 1, 4, 9, 16, \ldots)</math>. ...> is called the [[limit]] of <math>(x_n)</math> and is written <math>\lim_{n \to \infty} x_n</math>. The statement that <math>(x_n)</math> converges to
    2 KB (413 words) - 21:18, 13 November 2022
  • For example, <math>1, 2, 4, 8</math> is a geometric sequence with common ratio <math>2</math> and <mat ...progression if and only if <math>a_2 / a_1 = a_3 / a_2 = \cdots = a_n / a_{n-1}</math>. A similar definition holds for infinite geometric sequences. It
    4 KB (644 words) - 12:55, 7 March 2022
  • ...on difference <math>-8</math>; however, <math>7, 0, 7, 14</math> and <math>4, 12, 36, 108, \ldots</math> are not arithmetic sequences, as the difference ...progression if and only if <math>a_2 - a_1 = a_3 - a_2 = \cdots = a_n - a_{n-1}</math>. A similar definition holds for infinite arithmetic sequences. It
    4 KB (736 words) - 02:00, 7 March 2024
  • ...\geq 3</math>, there are no solutions to the equation <math>a^n + b^n = c^n</math>. ...he never published it, though he did publish a proof for the case <math>n=4</math>. It seems unlikely that he would have circulated a proof for the sp
    3 KB (453 words) - 11:13, 9 June 2023
  • ...ece of length <math>k_i</math> from the end of leg <math>L_i \; (i = 1,2,3,4)</math> and still have a stable table? For <math>0 \le x \le n</math>, it is easy to see that the number of stable tables is <math>(x+1)^2
    7 KB (1,276 words) - 20:51, 6 January 2024
  • If <math>n>1</math>, <math>2n, n^2 - 1, n^2 + 1</math> is a Pythagorean triple. ...ny <math>m,n</math>(<math>m>n</math>), we have <math>m^2 - n^2, 2mn, m^2 + n^2</math> is a Pythagorean triple.
    9 KB (1,434 words) - 13:10, 20 February 2024
  • ...s to the [[circumcenter]]. This creates a triangle that is <math>\frac{1}{n},</math> of the total area (consider the regular [[octagon]] below as an ex ...ound using [[trigonometry]] to be of length <math>\frac s2 \cot \frac{180}{n}^{\circ}</math>.
    6 KB (1,181 words) - 22:37, 22 January 2023
  • ...r+\left\lfloor a+\frac{1}{n}\right\rfloor+\ldots+\left\lfloor a+\frac{n-1}{n}\right\rfloor</cmath> *<math>\lfloor -3.2 \rfloor = -4</math>
    3 KB (508 words) - 21:05, 26 February 2024
  • ...he sum of the values on row <math>n</math> of Pascal's Triangle is <math>2^n</math>. ...ved from the combinatorics identity <math>{n \choose k}+{n \choose k+1} = {n+1 \choose k+1}</math>. Thus, any number in the interior of Pascal's Triang
    5 KB (838 words) - 17:20, 3 January 2023
  • Consider a polynomial <math>P(x)</math> of degree <math>n</math>, <center><math> P(x) = a_nx^n + a_{n-1}x^{n-1} + \cdots + a_1x + a_0</math></center>
    4 KB (690 words) - 13:11, 20 February 2024
  • ...ath> and <math>BC</math> again at distinct points <math>K</math> and <math>N</math> respectively. Let <math>M</math> be the point of intersection of the {{IMO box|year=1985|num-b=4|num-a=6}}
    3 KB (496 words) - 13:35, 18 January 2023
  • ...=0}^{\infty} (-1)^n \frac{x^{2n}}{(2n)!} = 1 - \frac{x^2}{2!} + \frac{x^4}{4!} - \frac{x^6}{6!} \cdots</cmath>
    8 KB (1,217 words) - 20:15, 7 September 2023
  • ...</cmath> where <math>n_1>1,~~0<n_2<1,~~-1<n_3<0,~~n_4<-1</math>, and <math>n</math> is the root mean power. ...1}{a}}</math> and the harmonic mean's root mean power is -1 as <math>\frac{n}{\frac{1}{x_1}+\cdots+\frac{1}{x_n}}=\sqrt[-1]{\frac{x_1^{-1}+\cdots+x_a^{-
    5 KB (912 words) - 20:06, 14 March 2023
  • <math>4 = 2 + 2</math> ...might expect the total number of ways to write a large even integer <math>n</math> as the sum of two odd primes to be roughly
    7 KB (1,201 words) - 16:59, 19 February 2024
  • ...function, it is easy to see that <math>\zeta(s)=0</math> when <math>s=-2,-4,-6,\ldots</math>. These are called the trivial zeros. This hypothesis is o ...uld hold. The Riemann Hypothesis would also follow if <math>M(n)\le C\sqrt{n}</math> for any constant <math>C</math>.
    2 KB (425 words) - 12:01, 20 October 2016
  • ...ulo]] <math>m</math> if there is some integer <math>n</math> so that <math>n^2-a</math> is [[divisibility | divisible]] by <math>m</math>. ...p-1}{2}}</math>, so <math>\left(\frac{-1}{p}\right)=1 \iff p \equiv 1 \mod 4</math>
    5 KB (778 words) - 13:10, 29 November 2017
  • Let <math>P</math> be a point, and let <math>S</math> be an <math>n</math>-sphere. Let two arbitrary lines passing through <math>P</math> inter ...th> intersect at <math>R</math>. If <math>AR:BR=1:4</math> and <math>CR:DR=4:9</math>, find the ratio <math>AB:CD</math>.
    5 KB (827 words) - 17:30, 21 February 2024

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