Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    MA1101 2018 MidSemester

    Uploaded by

    Crazy Experiments
    1) Two subsets A and B of a universal set U are equal if their union is the same and their intersection is the same. 2) The inverse of the function p = {(1,2), (2,3), (3,1)} is p-1 = {(2,1), (3,2), (1,3)}. 3) A surjective function from a finite set to itself must be injective as well, since every element of the domain must map to a unique element of the codomain.

    Copyright:

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

    You might also like

    MA1101 2018 MidSemester

    Uploaded by

    Crazy Experiments
    3 views1 page
    1) Two subsets A and B of a universal set U are equal if their union is the same and their intersection is the same. 2) The inverse of the function p = {(1,2), (2,3), (3,1)} is p-1 = {(2,1), (3,2), (1,3)}. 3) A surjective function from a finite set to itself must be injective as well, since every element of the domain must map to a unique element of the codomain.

    Original Description:

    Original Title

    MA1101_2018_MidSemester

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1) Two subsets A and B of a universal set U are equal if their union is the same and their intersection is the same. 2) The inverse of the function p = {(1,2), (2,3), (3,1)} is p-1 = {(2,1), (3,2), (1,3)}. 3) A surjective function from a finite set to itself must be injective as well, since every element of the domain must map to a unique element of the codomain.

    Copyright:

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

    MA1101 2018 MidSemester

    Uploaded by

    Crazy Experiments
    1) Two subsets A and B of a universal set U are equal if their union is the same and their intersection is the same. 2) The inverse of the function p = {(1,2), (2,3), (3,1)} is p-1 = {(2,1), (3,2), (1,3)}. 3) A surjective function from a finite set to itself must be injective as well, since every element of the domain must map to a unique element of the codomain.

    Copyright:

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

    l\Iicl semester exc-1111: I\IA1.

    101
    IISER Kolknta

    17 September :2018 Full :'.\larks: 20 TI~IE: l HOUR

    l. Let _-\. B and C' be subsets of a universal set [-such tlrnt

    A uB == A u C and .-11- B = A n C.
    1

    Pron' tlrnt B = C.

    ·)
    _ I.ft.· <
    .--i -- f'l"3 J ..6 -i
    L-" ..- 1_r anc I p - {(''-· •'))
    _ . (''-· ..3) •(•')
    ~ .. C\J1• (3 ••'3) ••("J. o') . (6J. 6)} . F'.me l p -] . (\Jfflp1 ..it(·
    p-1 ·J ,o and r1 c p-1. ;; ·<'-" li
    :1. Let A be a finite non-empty set wit h 11 elements and f A --:- .-1 be surjecrive. \\'ill f he
    ir',it·cti\'(·? .Justiiy your answer. i:-1· J

    P1c11"' t!:·11. c1:::irn:·


    tli1! definitions of integers and nrn!tiplication and addition on:<:..

    1(\1 ·-'.! '1- -:2.


    ..,,
    r b: For o, b. c E Z. a >< ( b + c) = u :' b + o x c.

    ·). J..:: m.:1.p E 1\ such tlrnt m +p =n + p. Tlwn show tlrnt m = n.


    : H:·:1 · '·'-c.: induction on p).

    You might also like