Pre-RMO 2014/20

What is the number of ordered pairs (A,B)(A, B) where AA and BB are subsets of {1,2,,5}\{1, 2, \ldots, 5\} such that neither ABA \subseteq B nor BAB \subseteq A ?


This note is part of the set Pre-RMO 2014

#Combinatorics #Pre-RMO

Note by Pranshu Gaba
6 years, 8 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

is it 30???

Nitish Deshpande - 6 years, 8 months ago

How many elements can A or B can have? Only 1 or more than one

If only 1 element ans \to 20

Otherwise(counting every possibility) ans \to 47

Krishna Sharma - 6 years, 8 months ago

Log in to reply

Since AA and BB are subsets of {1,2,3,4,5}\{1, 2, 3, 4, 5\}, they can have from 0 to 5 elements.

Pranshu Gaba - 6 years, 8 months ago

Write a comment or ask a question... I think 52

vatsal shah - 6 years, 8 months ago

should be 1024 - 243 - 243 + 32 = 570

ww margera - 6 years, 8 months ago

Log in to reply

ww margera. actually you permuted it...... {1,2} is Same as {2,1}

vatsal shah - 6 years, 8 months ago

Log in to reply

Ordered pairs right? So the two should not be the same...

ww margera - 6 years, 8 months ago

@ww margera. actually you permuted it...... {1,2} is Same as {2,1}

vatsal shah - 6 years, 8 months ago

As @ww margera said, we can use principle of inclusion and exclusion.

Answer=total no. of ordered pairs(AB+BA)+A=B \text{Answer} = \text{total no. of ordered pairs} - (|A \subseteq B |+ |B \subseteq A|) + |A = B|

where x|x| is no. of ordered pairs (A,B)(A, B) satifying condition xx.

Answer=210(35+35)+25=570 \text{Answer}= 2^{10} - ( 3^5 + 3^5) + 2^5 = \boxed{570}

Pranshu Gaba - 6 years, 8 months ago

Log in to reply

How 2^10, 3^5, 2^5, I didn't get that.

Raj Hariya - 2 years, 10 months ago

why should it be 2^10......i think it should be ${2^5 \choose 2}*2$

Abhishek Bakshi - 6 years, 8 months ago

Log in to reply

Using rule of product, AA has 252^5 choices, and even BB has 252^5 choices, so total no. of ordered pairs = 25×25=2102^5 \times 2^5 = 2^{10}

Pranshu Gaba - 6 years, 8 months ago

6

Muhammad Adil Zafar - 6 years, 8 months ago

570

Saarthak Marathe - 5 years, 8 months ago

@Pranshu Gaba : Are you studying in resonance? Which Centre?

Abhishek Bakshi - 5 years, 8 months ago
×

Problem Loading...

Note Loading...

Set Loading...