Scribd Logo
Upload

Welcome to Scribd!

  • Canadian Mathematical Olympiad

    Uploaded by

    X MIPA 325Muhammad Farhan
    120 views1 page
    A function f is injective if f(n)=f(m) implies n=m. If an injective function f satisfies f(m)+f(n)=f(n)+f(m), prove that m=n. A cubic function f(x)=x^3+3x^2-1 has roots a, b, c. Find the value of (a) a^3 + b^3 + c^3 and (b) a^2b + b^2c + c^2a.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    A function f is injective if f(n)=f(m) implies n=m. If an injective function f satisfies f(m)+f(n)=f(n)+f(m), prove that m=n. A cubic function f(x)=x^3+3x^2-1 has roots a, b, c. Find the value of (a) a^3 + b^3 + c^3 and (b) a^2b + b^2c + c^2a.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    120 views1 page

    Canadian Mathematical Olympiad

    Uploaded by

    X MIPA 325Muhammad Farhan
    A function f is injective if f(n)=f(m) implies n=m. If an injective function f satisfies f(m)+f(n)=f(n)+f(m), prove that m=n. A cubic function f(x)=x^3+3x^2-1 has roots a, b, c. Find the value of (a) a^3 + b^3 + c^3 and (b) a^2b + b^2c + c^2a.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    1. A function f is called injective if when f ( n )=f (m), then n = m.

    Suppose that f is
    1 1 4
    injective and f ( m ) + f ( n ) = f ( n )+ f (m) . Prove m=n
    2. Let f ( x )=x 3 +3 x 2−1, have roots a , b , c .
    (a) Find the value of a 3+ b3 +c 3
    (b) Find all possible values of a 2 b+ b2 c+ c2 a

    You might also like