MedVision ad

Search results

  1. kendricklamarlover101

    Proof Perms

    the both have a common factor of (n-r-2)! so u can just multiply it by (n-r-1) like how 1/3 + 1/6 = 2/6 + 1/6 instead of 6/18 + 3/18
  2. kendricklamarlover101

    results that need to be proven

    im pretty sure u can use the heaviside cover up method for partial fractions without proof
  3. kendricklamarlover101

    Diff/ Sum Question Pls Help

    lol these emojis are so silly like has anybody ever used :chainsaw2:
  4. kendricklamarlover101

    Diff/ Sum Question Pls Help

    yup 👍
  5. kendricklamarlover101

    Diff/ Sum Question Pls Help

    yup basically just adding that limit notation to show that ur actually taking the infinite sum
  6. kendricklamarlover101

    Diff/ Sum Question Pls Help

    if u do take the limit u get that the result would equal 1 + ln(2) + ln(2) > 1+ln2 u can take the limit from the start just by writing \lim_{k \rightarrow \infty} \sum_{n=2}^{k} \ln \left( \frac{n^2}{n^2-1} \right ) and if u want to expand the sum out to see the telescoping series the result...
  7. kendricklamarlover101

    Diff/ Sum Question Pls Help

    infinity isnt a number most of the time when u see infinities in math ur actually just taking a limit to infinity. the infinity commonly used in math is just another way of saying what happens as this number gets really big. u can still make a telescoping sum if the symbol used is infinity it...
  8. kendricklamarlover101

    Diff/ Sum Question Pls Help

    k is just an arbitrary value u can use any letter as long as u take the limit to infinity
  9. kendricklamarlover101

    Integral question

    yea my tutor gave me the textbook cause he thought i would have liked some of the questions. at first i tried using a trig substitution but i couldnt get anywhere with that so i was just wondering if there was another solution.
  10. kendricklamarlover101

    Integral question

    can someone check if my working is correct i got this integral from spivak's calculus \int \frac{x^2 -1}{x^2 +1} \frac{1}{\sqrt{1+x^4}} \; dx \quad \text{Using } u^2 = x^2 + \frac{1}{x^2} u^2 = x^2 + \frac{1}{x^2} \implies 2u \; du = \left(2x - \frac{2}{x^3}\right)dx u \; du = \left(x -...
  11. kendricklamarlover101

    Old Proofs to Know

    nah ive seen an algebraic proof of it in a paper before and got stuck on the reverse triangle inequality
  12. kendricklamarlover101

    Old Proofs to Know

    probably nice to know the proof of the triangle inequality and the reverse triangle inequality
  13. kendricklamarlover101

    Should I do inverse function before calculus??

    derivatives of inverse functions are in the yr 12 mx1 scope not the yr 11 one if i recall correctly
  14. kendricklamarlover101

    p does not equal mv anymore :(

    p does not equal mv anymore :(
  15. kendricklamarlover101

    How would u prove this?

    i just realised this is invalid since u cant apply the binomial theorem once again... well another approach u could do is RHS-LHS RHS-LHS = \frac{3^k}{2^{2k}} - \frac{1}{2^{k+1}} - \frac{1}{2} =\frac{3^k - 2^{k-1} - 2^{2k-1}}{2^{2k}} =\frac{3^k -2^{k-1}\left(1+2^k\right)}{2^{2k}} Note that 3^k...
  16. kendricklamarlover101

    How would u prove this?

    also i dont think u would be able to apply induction here since 0<k<1 and usually u can only apply induction when k is an integer
  17. kendricklamarlover101

    How would u prove this?

    if you wanted to do the question without induction btw heres the working out: \frac{1}{2}+\frac{1}{2^{k+1}}=\frac{1}{2}\left(1+\frac{1}{2^k}\right) =\frac{1}{2}\left(\frac{2^k + 1}{2^k}\right) =\frac{2^k + 1}{2^{k}(2)} Notice that 3^k>2^k +1 by the binomial theorem as: 3^k =(2+1)^k = 2^k...
  18. kendricklamarlover101

    How would u prove this?

    actually nvm i dont think this proof is valid as well since 0<k<1 oops.
  19. kendricklamarlover101

    How would u prove this?

    for the specific case of n=2 however u could probably just use the binomial theorem writing 3/4 as 1/2 +1/(2^2) (\frac{3}{4})^{k}=(\frac{1}{2}+\frac{1}{2^2})^k =\frac{1}{2^k} + \binom{k}{1}\frac{1}{2^{k+1}} + \binom{k}{2}\frac{1}{2^{k+2}} + ... + \frac{1}{2^{2k}} > \frac{1}{2^k} +...
  20. kendricklamarlover101

    How would u prove this?

    is there any information on what n is? i dont think this would be a true statement if theres no restriction on n which can be seen in this desmos graph
Top