Dear Students,

Try to solve by yourself. If that seems difficult discuss with your friend. Do not
jump to look into solutions in Internet. It does not help you to learn in any way.
Enjoy your weekend with some food for your brains.

1. Logical Puzzle: (nothing to do with what we have learnt in class)

There are two tables in room. On one table 50 cards are placed, out of which 40
are facing down and 10 cards are facing up.The other table is empty.You can do the
following operation: (a) throw a card to the ground, (b) Flip a card i.e., turn a
card facing to facing down or vice versa. (c) transfer any number of cards from one
table to another.

Now you are blindfolded. Can you do the above operations and make sure that at the
end you have equal number of card facing up on both the table?.(please note that
the trivial answer of throwing all the card on ground is not allowed)

2. A staircase has n steps. You climb up taking one or two at a time. How many
ways can you climb up? For example, if n=3, then you can climb up in 3 ways: (i) 3
single steps (ii) one single followed by one double (iii) one double followed by
one single.

3. Suppose S is a set on 'n+1' integers. Show that there exist two elements 'a' and
'b' such that 'a-b' is a multiple of 'n'.

4. Given a sequence of n^2+1 integers, does there exist a non-decreasing

subsequence of n+1 numbers?(n^2 = square of n)

5. Given a sequence of n^2+1 integers, does there exist non-increasing subsequence

of n+1 numbers? (n^2 = square of n)

6. Given a sequence of n^2+1 integers, does there exists a non-decreasing

subsequence of n+1 numbers or a non-increasing subsequence of n+1 numbers? (n^2 =
square of n)

Best regards,
manu.
Dear Students,

Try to solve by yourself. If that seems difficult discuss with your friend. Do not
jump to look into solutions in Internet. It does not help you to learn in any way.
Enjoy your weekend with some food for your brains.

1. Logical Puzzle: (nothing to do with what we have learnt in class)

There are two tables in room. On one table 50 cards are placed, out of which 40
are facing down and 10 cards are facing up.The other table is empty.You can do the
following operation: (a) throw a card to the ground, (b) Flip a card i.e., turn a
card facing to facing down or vice versa. (c) transfer any number of cards from one
table to another.

Now you are blindfolded. Can you do the above operations and make sure that at the
end you have equal number of card facing up on both the table?.(please note that
the trivial answer of throwing all the card on ground is not allowed)

2. A staircase has n steps. You climb up taking one or two at a time. How many
ways can you climb up? For example, if n=3, then you can climb up in 3 ways: (i) 3
single steps (ii) one single followed by one double (iii) one double followed by
one single.

3. Suppose S is a set on 'n+1' integers. Show that there exist two elements 'a' and
'b' such that 'a-b' is a multiple of 'n'.

4. Given a sequence of n^2+1 integers, does there exist a non-decreasing

subsequence of n+1 numbers?(n^2 = square of n)

5. Given a sequence of n^2+1 integers, does there exist non-increasing subsequence

of n+1 numbers? (n^2 = square of n)

6. Given a sequence of n^2+1 integers, does there exists a non-decreasing

subsequence of n+1 numbers or a non-increasing subsequence of n+1 numbers? (n^2 =
square of n)

Best regards,
manu.
Dear Students,

Try to solve by yourself. If that seems difficult discuss with your friend. Do not
jump to look into solutions in Internet. It does not help you to learn in any way.
Enjoy your weekend with some food for your brains.

1. Logical Puzzle: (nothing to do with what we have learnt in class)

There are two tables in room. On one table 50 cards are placed, out of which 40
are facing down and 10 cards are facing up.The other table is empty.You can do the
following operation: (a) throw a card to the ground, (b) Flip a card i.e., turn a
card facing to facing down or vice versa. (c) transfer any number of cards from one
table to another.

Now you are blindfolded. Can you do the above operations and make sure that at the
end you have equal number of card facing up on both the table?.(please note that
the trivial answer of throwing all the card on ground is not allowed)

2. A staircase has n steps. You climb up taking one or two at a time. How many
ways can you climb up? For example, if n=3, then you can climb up in 3 ways: (i) 3
single steps (ii) one single followed by one double (iii) one double followed by
one single.

3. Suppose S is a set on 'n+1' integers. Show that there exist two elements 'a' and
'b' such that 'a-b' is a multiple of 'n'.

4. Given a sequence of n^2+1 integers, does there exist a non-decreasing

subsequence of n+1 numbers?(n^2 = square of n)

5. Given a sequence of n^2+1 integers, does there exist non-increasing subsequence

of n+1 numbers? (n^2 = square of n)

6. Given a sequence of n^2+1 integers, does there exists a non-decreasing

subsequence of n+1 numbers or a non-increasing subsequence of n+1 numbers? (n^2 =
square of n)

Best regards,
manu.
Dear Students,

Try to solve by yourself. If that seems difficult discuss with your friend. Do not
jump to look into solutions in Internet. It does not help you to learn in any way.
Enjoy your weekend with some food for your brains.

1. Logical Puzzle: (nothing to do with what we have learnt in class)

There are two tables in room. On one table 50 cards are placed, out of which 40
are facing down and 10 cards are facing up.The other table is empty.You can do the
following operation: (a) throw a card to the ground, (b) Flip a card i.e., turn a
card facing to facing down or vice versa. (c) transfer any number of cards from one
table to another.

Now you are blindfolded. Can you do the above operations and make sure that at the
end you have equal number of card facing up on both the table?.(please note that
the trivial answer of throwing all the card on ground is not allowed)

2. A staircase has n steps. You climb up taking one or two at a time. How many
ways can you climb up? For example, if n=3, then you can climb up in 3 ways: (i) 3
single steps (ii) one single followed by one double (iii) one double followed by
one single.

3. Suppose S is a set on 'n+1' integers. Show that there exist two elements 'a' and
'b' such that 'a-b' is a multiple of 'n'.

4. Given a sequence of n^2+1 integers, does there exist a non-decreasing

subsequence of n+1 numbers?(n^2 = square of n)

5. Given a sequence of n^2+1 integers, does there exist non-increasing subsequence

of n+1 numbers? (n^2 = square of n)
6. Given a sequence of n^2+1 integers, does there exists a non-decreasing
subsequence of n+1 numbers or a non-increasing subsequence of n+1 numbers? (n^2 =
square of n)

Best regards,
manu.
Dear Students,

Try to solve by yourself. If that seems difficult discuss with your friend. Do not
jump to look into solutions in Internet. It does not help you to learn in any way.
Enjoy your weekend with some food for your brains.

1. Logical Puzzle: (nothing to do with what we have learnt in class)

There are two tables in room. On one table 50 cards are placed, out of which 40
are facing down and 10 cards are facing up.The other table is empty.You can do the
following operation: (a) throw a card to the ground, (b) Flip a card i.e., turn a
card facing to facing down or vice versa. (c) transfer any number of cards from one
table to another.

Now you are blindfolded. Can you do the above operations and make sure that at the
end you have equal number of card facing up on both the table?.(please note that
the trivial answer of throwing all the card on ground is not allowed)

2. A staircase has n steps. You climb up taking one or two at a time. How many
ways can you climb up? For example, if n=3, then you can climb up in 3 ways: (i) 3
single steps (ii) one single followed by one double (iii) one double followed by
one single.

3. Suppose S is a set on 'n+1' integers. Show that there exist two elements 'a' and
'b' such that 'a-b' is a multiple of 'n'.

4. Given a sequence of n^2+1 integers, does there exist a non-decreasing

subsequence of n+1 numbers?(n^2 = square of n)

5. Given a sequence of n^2+1 integers, does there exist non-increasing subsequence

of n+1 numbers? (n^2 = square of n)

6. Given a sequence of n^2+1 integers, does there exists a non-decreasing

subsequence of n+1 numbers or a non-increasing subsequence of n+1 numbers? (n^2 =
square of n)

Best regards,
manu.
Dear Students,

Try to solve by yourself. If that seems difficult discuss with your friend. Do not
jump to look into solutions in Internet. It does not help you to learn in any way.
Enjoy your weekend with some food for your brains.
1. Logical Puzzle: (nothing to do with what we have learnt in class)

There are two tables in room. On one table 50 cards are placed, out of which 40
are facing down and 10 cards are facing up.The other table is empty.You can do the
following operation: (a) throw a card to the ground, (b) Flip a card i.e., turn a
card facing to facing down or vice versa. (c) transfer any number of cards from one
table to another.

Now you are blindfolded. Can you do the above operations and make sure that at the
end you have equal number of card facing up on both the table?.(please note that
the trivial answer of throwing all the card on ground is not allowed)

2. A staircase has n steps. You climb up taking one or two at a time. How many
ways can you climb up? For example, if n=3, then you can climb up in 3 ways: (i) 3
single steps (ii) one single followed by one double (iii) one double followed by
one single.

3. Suppose S is a set on 'n+1' integers. Show that there exist two elements 'a' and
'b' such that 'a-b' is a multiple of 'n'.

4. Given a sequence of n^2+1 integers, does there exist a non-decreasing

subsequence of n+1 numbers?(n^2 = square of n)

5. Given a sequence of n^2+1 integers, does there exist non-increasing subsequence

of n+1 numbers? (n^2 = square of n)

6. Given a sequence of n^2+1 integers, does there exists a non-decreasing

subsequence of n+1 numbers or a non-increasing subsequence of n+1 numbers? (n^2 =
square of n)

Best regards,
manu.
Dear Students,

Try to solve by yourself. If that seems difficult discuss with your friend. Do not
jump to look into solutions in Internet. It does not help you to learn in any way.
Enjoy your weekend with some food for your brains.

1. Logical Puzzle: (nothing to do with what we have learnt in class)

There are two tables in room. On one table 50 cards are placed, out of which 40
are facing down and 10 cards are facing up.The other table is empty.You can do the
following operation: (a) throw a card to the ground, (b) Flip a card i.e., turn a
card facing to facing down or vice versa. (c) transfer any number of cards from one
table to another.
Now you are blindfolded. Can you do the above operations and make sure that at the
end you have equal number of card facing up on both the table?.(please note that
the trivial answer of throwing all the card on ground is not allowed)

2. A staircase has n steps. You climb up taking one or two at a time. How many
ways can you climb up? For example, if n=3, then you can climb up in 3 ways: (i) 3
single steps (ii) one single followed by one double (iii) one double followed by
one single.

3. Suppose S is a set on 'n+1' integers. Show that there exist two elements 'a' and
'b' such that 'a-b' is a multiple of 'n'.

4. Given a sequence of n^2+1 integers, does there exist a non-decreasing

subsequence of n+1 numbers?(n^2 = square of n)

5. Given a sequence of n^2+1 integers, does there exist non-increasing subsequence

of n+1 numbers? (n^2 = square of n)

6. Given a sequence of n^2+1 integers, does there exists a non-decreasing

subsequence of n+1 numbers or a non-increasing subsequence of n+1 numbers? (n^2 =
square of n)

Best regards,
manu.
Dear Students,

Try to solve by yourself. If that seems difficult discuss with your friend. Do not
jump to look into solutions in Internet. It does not help you to learn in any way.
Enjoy your weekend with some food for your brains.

1. Logical Puzzle: (nothing to do with what we have learnt in class)

There are two tables in room. On one table 50 cards are placed, out of which 40
are facing down and 10 cards are facing up.The other table is empty.You can do the
following operation: (a) throw a card to the ground, (b) Flip a card i.e., turn a
card facing to facing down or vice versa. (c) transfer any number of cards from one
table to another.

Now you are blindfolded. Can you do the above operations and make sure that at the
end you have equal number of card facing up on both the table?.(please note that
the trivial answer of throwing all the card on ground is not allowed)

2. A staircase has n steps. You climb up taking one or two at a time. How many
ways can you climb up? For example, if n=3, then you can climb up in 3 ways: (i) 3
single steps (ii) one single followed by one double (iii) one double followed by
one single.

3. Suppose S is a set on 'n+1' integers. Show that there exist two elements 'a' and
'b' such that 'a-b' is a multiple of 'n'.
4. Given a sequence of n^2+1 integers, does there exist a non-decreasing
subsequence of n+1 numbers?(n^2 = square of n)

5. Given a sequence of n^2+1 integers, does there exist non-increasing subsequence

of n+1 numbers? (n^2 = square of n)

6. Given a sequence of n^2+1 integers, does there exists a non-decreasing

subsequence of n+1 numbers or a non-increasing subsequence of n+1 numbers? (n^2 =
square of n)

Best regards,
manu.
Dear Students,

Try to solve by yourself. If that seems difficult discuss with your friend. Do not
jump to look into solutions in Internet. It does not help you to learn in any way.
Enjoy your weekend with some food for your brains.

1. Logical Puzzle: (nothing to do with what we have learnt in class)

There are two tables in room. On one table 50 cards are placed, out of which 40
are facing down and 10 cards are facing up.The other table is empty.You can do the
following operation: (a) throw a card to the ground, (b) Flip a card i.e., turn a
card facing to facing down or vice versa. (c) transfer any number of cards from one
table to another.

Now you are blindfolded. Can you do the above operations and make sure that at the
end you have equal number of card facing up on both the table?.(please note that
the trivial answer of throwing all the card on ground is not allowed)

2. A staircase has n steps. You climb up taking one or two at a time. How many
ways can you climb up? For example, if n=3, then you can climb up in 3 ways: (i) 3
single steps (ii) one single followed by one double (iii) one double followed by
one single.

3. Suppose S is a set on 'n+1' integers. Show that there exist two elements 'a' and
'b' such that 'a-b' is a multiple of 'n'.

4. Given a sequence of n^2+1 integers, does there exist a non-decreasing

subsequence of n+1 numbers?(n^2 = square of n)

5. Given a sequence of n^2+1 integers, does there exist non-increasing subsequence

of n+1 numbers? (n^2 = square of n)

6. Given a sequence of n^2+1 integers, does there exists a non-decreasing

subsequence of n+1 numbers or a non-increasing subsequence of n+1 numbers? (n^2 =
square of n)

Best regards,
manu.
Dear Students,

Try to solve by yourself. If that seems difficult discuss with your friend. Do not
jump to look into solutions in Internet. It does not help you to learn in any way.
Enjoy your weekend with some food for your brains.

1. Logical Puzzle: (nothing to do with what we have learnt in class)

There are two tables in room. On one table 50 cards are placed, out of which 40
are facing down and 10 cards are facing up.The other table is empty.You can do the
following operation: (a) throw a card to the ground, (b) Flip a card i.e., turn a
card facing to facing down or vice versa. (c) transfer any number of cards from one
table to another.

Now you are blindfolded. Can you do the above operations and make sure that at the
end you have equal number of card facing up on both the table?.(please note that
the trivial answer of throwing all the card on ground is not allowed)

2. A staircase has n steps. You climb up taking one or two at a time. How many
ways can you climb up? For example, if n=3, then you can climb up in 3 ways: (i) 3
single steps (ii) one single followed by one double (iii) one double followed by
one single.

3. Suppose S is a set on 'n+1' integers. Show that there exist two elements 'a' and
'b' such that 'a-b' is a multiple of 'n'.

4. Given a sequence of n^2+1 integers, does there exist a non-decreasing

subsequence of n+1 numbers?(n^2 = square of n)

5. Given a sequence of n^2+1 integers, does there exist non-increasing subsequence

of n+1 numbers? (n^2 = square of n)

6. Given a sequence of n^2+1 integers, does there exists a non-decreasing

subsequence of n+1 numbers or a non-increasing subsequence of n+1 numbers? (n^2 =
square of n)

Best regards,
manu.
Dear Students,

Try to solve by yourself. If that seems difficult discuss with your friend. Do not
jump to look into solutions in Internet. It does not help you to learn in any way.
Enjoy your weekend with some food for your brains.

1. Logical Puzzle: (nothing to do with what we have learnt in class)

There are two tables in room. On one table 50 cards are placed, out of which 40
are facing down and 10 cards are facing up.The other table is empty.You can do the
following operation: (a) throw a card to the ground, (b) Flip a card i.e., turn a
card facing to facing down or vice versa. (c) transfer any number of cards from one
table to another.

Now you are blindfolded. Can you do the above operations and make sure that at the
end you have equal number of card facing up on both the table?.(please note that
the trivial answer of throwing all the card on ground is not allowed)

2. A staircase has n steps. You climb up taking one or two at a time. How many
ways can you climb up? For example, if n=3, then you can climb up in 3 ways: (i) 3
single steps (ii) one single followed by one double (iii) one double followed by
one single.

3. Suppose S is a set on 'n+1' integers. Show that there exist two elements 'a' and
'b' such that 'a-b' is a multiple of 'n'.

4. Given a sequence of n^2+1 integers, does there exist a non-decreasing

subsequence of n+1 numbers?(n^2 = square of n)

5. Given a sequence of n^2+1 integers, does there exist non-increasing subsequence

of n+1 numbers? (n^2 = square of n)

6. Given a sequence of n^2+1 integers, does there exists a non-decreasing

subsequence of n+1 numbers or a non-increasing subsequence of n+1 numbers? (n^2 =
square of n)

Best regards,
manu.
Dear Students,

Try to solve by yourself. If that seems difficult discuss with your friend. Do not
jump to look into solutions in Internet. It does not help you to learn in any way.
Enjoy your weekend with some food for your brains.

1. Logical Puzzle: (nothing to do with what we have learnt in class)

There are two tables in room. On one table 50 cards are placed, out of which 40
are facing down and 10 cards are facing up.The other table is empty.You can do the
following operation: (a) throw a card to the ground, (b) Flip a card i.e., turn a
card facing to facing down or vice versa. (c) transfer any number of cards from one
table to another.

Now you are blindfolded. Can you do the above operations and make sure that at the
end you have equal number of card facing up on both the table?.(please note that
the trivial answer of throwing all the card on ground is not allowed)

2. A staircase has n steps. You climb up taking one or two at a time. How many
ways can you climb up? For example, if n=3, then you can climb up in 3 ways: (i) 3
single steps (ii) one single followed by one double (iii) one double followed by
one single.

3. Suppose S is a set on 'n+1' integers. Show that there exist two elements 'a' and
'b' such that 'a-b' is a multiple of 'n'.

4. Given a sequence of n^2+1 integers, does there exist a non-decreasing

subsequence of n+1 numbers?(n^2 = square of n)

5. Given a sequence of n^2+1 integers, does there exist non-increasing subsequence

of n+1 numbers? (n^2 = square of n)

6. Given a sequence of n^2+1 integers, does there exists a non-decreasing

subsequence of n+1 numbers or a non-increasing subsequence of n+1 numbers? (n^2 =
square of n)

Best regards,
manu.