MathYouLike MathYouLike
  • Toggle menubar
  • Toggle fullscreen
  • Toggle Search
  •    Sign up
  • Newest
  • Featured
  • Votes
  • Unanswered
  • First «
  • 476
  • 477
  • 478
  • 479
  • 480
  • » Last
  • QUESTIONS
  • TAGS
  • USERS
  • BADGES
  • ASK A QUESTION
  • BLOG

All questions

  • Newest
  • Featured
  • Votes
  • Unanswered

...
falcon handsome moderators
09/03/2017 at 12:43
Answers
6
Follow

Let \(a_0\)= 1, \(a_1\)=1 and \(a_n=4a_{n-1}-4a_{n-2}\) for n>=2

Find a formula for a\(_n\) in terms of n.

generating functions


...
falcon handsome moderators
09/03/2017 at 12:55
Answers
1
Follow

In each cell of a 100 x 100 table, one of the integers 1,2,...,5000 is written. Moreover, each integer appears in the table exactly twice. Prove that one can choose 100 cells in the satisfying three conditions below.

(1) Exactly one cell is chosen in each row.

(2) Exactly one cell is chosen in each column.

(3) The numbers in the cells chosen are pairwise distinct

probabilistic method

  • ...
    demo acc 10/03/2017 at 14:42

    very diffcult khocroioe


...
falcon handsome moderators
09/03/2017 at 12:58
Answers
3
Follow

Given 2n points in a plane with no three of them collinear. Show that thay can be divided into n pairs such that the n segments joining each pair do not intersect

games

  • ...
    Ace Legona 09/03/2017 at 19:14

    In the beginning randomly pair the points and join the segments. Let \(S \) be the sum of the lengths of the segments. (Note that since there are finitely many ways of connecting \(2n \) points by \(n \) segments, there are finitely many possible values of \(S\).) If two segments \(AB\)and \(CD\)intersect at \(O\), then replace pairs \(AB\)and \(CD\)by \(AC\)and \(BD\). Since

    \(AB + CD = AO + OB + CO + OD > AC + BD\)

    by the triangle inequality, whenever there is an intersection, doing this replacement will always decrease \(S\). Since there are only finitely many possible values of \(S\), so eventually there will not be any intersection.

  • ...
    Faded 19/01/2018 at 14:52

    In the beginning randomly pair the points and join the segments. Let S be the sum of the lengths of the segments. (Note that since there are finitely many ways of connecting 2n points by n segments, there are finitely many possible values of S.) If two segments ABand CDintersect at O, then replace pairs ABand CDby ACand BD

    . Since

    AB+CD=AO+OB+CO+OD>AC+BD

    by the triangle inequality, whenever there is an intersection, doing this replacement will always decrease S

    . Since there are only finitely many possible values of S, so eventually there will not be any intersection.

  • ...
    Vũ Việt Vương 01/04/2017 at 16:59

    banh

    In the beginning randomly pair the points and join the segments. Let SS be the sum of the lengths of the segments. (Note that since there are finitely many ways of connecting 2n2n points by nn segments, there are finitely many possible values of SS.) If two segments ABABand CDCDintersect at OO, then replace pairs ABABand CDCDby ACACand BDBD. Since

    AB+CD=AO+OB+CO+OD>AC+BDAB+CD=AO+OB+CO+OD>AC+BD

    by the triangle inequality, whenever there is an intersection, doing this replacement will always decrease SS. Since there are only finitely many possible values of SS, so eventually there will not be any intersection.leuleueoeobucquagianroiundefined


4799

questions

Weekly ranking

  • ...

    Nguyen The Thao

    This week's point: . Total: 0
  • ...

    nguyễn ngọc bảo hân

    This week's point: . Total: 0
  • ...

    Chibi

    This week's point: . Total: 7
  • ...

    Grand Master

    This week's point: . Total: 0
  • ...

    Nguyễn Huy Thắng

    This week's point: . Total: 159
  • ...

    Mây Bay Theo Gió

    This week's point: . Total: 0
  • ...

    gggggggg

    This week's point: . Total: 0
  • ...

    Nguyễn Huy Thắng

    This week's point: . Total: 0
  • ...

    James Blizabeth

    This week's point: . Total: 0
  • ...

    Mai Marry

    This week's point: . Total: 0

Related Tags

games 18  double counting 8  generating functions 2  probabilistic method 1  Polynomial 9  inequality 13  area 17  Equation 9  Primitive Roots Modulo Primes 1  Primitive in Arithmetic Progression 6  Base n Representatioons 4  Pell Equation 1  mixed number 1  Fraction 29  Circle 3  Imaginary numbers 1  Decimal number 2  Volume 2  percentages 6  simple equation 19  absolute value 19  rational numbers 20  Operation of Indices 21  Simulataneous Equation A System of Equations 25  Multiplication of Polynomial 17  divisibility 24  Maximum 5  Minimum 8  Fraction 4  Prime Numbers and Composite Numbers 13  Square Number 26  Even and Odd Numbers 13  GDC and LCM 11  GCD and LCM 12  Permutation and combination 9  combinations 5  interger 7  number 10  Diophantine equations 2  equations 1  Grade 6 19  Power 3  equality 2  maxima-minima 2  square root 1  Polygon 2  IGCSE 1  factorial 1  integers 2 
© 2016 MATHYOULIKE
Crafted with by OLM.VN