Set Theory

  • 1

    Questions

  • 0

    Discussions

  • 0

    Active Users

  • 0

    Followers

Have a question about Set Theory? Ask our experts

Ask Your Question

Keep it short & simple. Type complete word. Avoid abusive language.

New answer posted•a year ago
A
a year ago

S = {1, 2, 3, 4, 5, 6, 9}

Elements of type 3n -> 3, 6, 9

Type 3n + 1 ->1, 4

3n + 2 -> 2, 5

Number of subset of S containing one element which are not divisible by  3 = 2 C 1 + 2 C 1 = 4 number of subset of S containing two numbers whose sum is not divisible 3 = 3 C 1 × 2 C 1 + 3 C 1 × 2 C 1 + 2 C 2 + 2 C 2 = 1 4 by

Number of subset of S containing 3 elements

...Read more

Thumbs Up IconUpvote Thumbs Down Icon