0% found this document useful (0 votes)
4 views3 pages

PnC

The document presents a series of mathematical problems involving combinatorics, permutations, and arrangements. Each problem requires finding specific quantities or arrangements based on given conditions, such as selecting balls of different colors, seating arrangements, and coloring patterns. The problems range in complexity and cover various scenarios, including chessboards, seating arrangements, and currency transactions.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views3 pages

PnC

The document presents a series of mathematical problems involving combinatorics, permutations, and arrangements. Each problem requires finding specific quantities or arrangements based on given conditions, such as selecting balls of different colors, seating arrangements, and coloring patterns. The problems range in complexity and cover various scenarios, including chessboards, seating arrangements, and currency transactions.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

1.There are n-1 red balls, n green balls and n+1 blue balls in a bag.

The number of ways of choosing two


balls from the bag that have different colors is 299. What is the value of n?

2. A pen costs $11 and a notebook costs $13. Find the number of ways in which a person can spend
exactly $1000 to buy pens and notebooks.

3. There are five cities A,B,C,D,E on a certain island. Each city is connected to every other city by road.
In how many ways can a person starting from city A come back to A after visiting some cities without
visiting a city more than once and without taking the same road more than once? (The order in which he
visits the cities also matters: e.g., the routes A B C A and A B C
A are different.)

4. There are eight rooms on the first floor of a hotel, with four rooms on each side of the corridor,
symmetrically situated ( that is each room is exactly opposite to one other room). Four guests have to
accommodated in four of the eight rooms (that is, one in each) such that no two guests are in adjacent
rooms or in opposite rooms. In how many ways can the guests be accommodated?

5. There are several tea cup in the kitchen, some with handles and others without handles. The number
of ways of selecting two cups without handle and three with handle is exactly 1200. What is the
maximum possible number of cups in the kitchen?

6. What is the number of ways in which one can choose 60 unit sqaures from a 11 × 11 chessboard such
that no two chosen squares have a side in common?

7. Let N be the number of ways of distributing 8 chocolates of different brands among 3 children such
that each child gets at least one chocolate, and no two children get the same number of chocolates. Find
the sum of the digits N?

8. What is the number of ways in which one can colour the squares of a 4 × 4 chessboard with colours
red and blue such that each row as well as each column has exactly two red squares and two blue
squares?

9. Five persons wearing badges with numbers 1,2,3,4,5 are seated on 5 chairs around a
circular table. In how many ways can they be seated so that no two person whose badge
have consecutive numbers are seated next to each other? ( Two arrangements obtained by
rotation around the around the table are considered different.)

10. In how many ways can a pair of parallel diagonal of a regular polygon of 10 sides be selected?

The END
11. Three couple sit for a photograph in 2 rows of three people each such that no couple is sitting in the
same row next to each other or in the same column one behind the other. How many arrangements are
possible?

12. in how many ways can four married couples sit in a merry-go-round with identical saets such that
men and women occupy alternate seats and no husband seats next to his wife?

13. A 12 × 12 board is divided into 144 unit sqares by drawing lines parallel to the sides. Two rooks plac
ed on two unit sqares are said to be non attacking if they are not in the same column or same row. Find
the least number N such that if N rooks are placed on the unit squares, one rook per square, we can we
can always find 7 rooks such that no two are attacking each other.

14. In the figure below, 4 of the 6 disks are to be coloured black and 2 are to be coloured white. Two
colouring that can be obtained from one another by a rotation or a reflection of the entire figure are
considered the same.

There are only four such colorings for the given two colors, as shown in figure 1. In how many ways can
we color the 6 disks such that 2 are colored black, 2 are colored white, 2 are colored blue with given
identification condition?

15. Unconventional dice are to designed such that the six faces are marked with numbers from 1 to 6
with 1 and 2 appearing on opposite faces. Further, each face is colored either red or yellow with opposite
faces always of the same color. Two dice are considered to have the same design if one of them can be
rotated to obtain a dice that has the same numbers and colors on the corresponding faces as the other
one. Find the number of distinct dice that can be designed.

16. Given a 2 × 2 tile and seven dominoes (2 × 1 tile), find the number of ways of tiling (that is, cover
without leaving gaps and without overlapping of any two tiles) a 2 × 7 rectangle using some of these tiles.

17. In the land of Binary, the unit of currency is called Ben and currency notes are available in
denominations 1,2,22 ,23 ,. . . . Bens. The rules of the Government of Binary stipulate that one can not use
more than two notes of any one denomination in any transaction. For example, one can given a change
for 2 Bens in two ways: 2 one Ben notes or 1 two Ben notes. For 5 Bens one can give 1 one Ben and 1
four Ben note or 1 one Ben note and 2 two Ben notes. Using 5 one Ben notes or 3 one Ben notes and 1
two Ben notes for a 5 Ben transaction is prohibited. Find the number of ways in which one can give
change for 100 Ben, following the rules of the Government.

The END
The END

You might also like