Embibe Experts Solutions for Chapter: Permutation and Combination, Exercise 4: Exercise-4
Embibe Experts Mathematics Solutions for Exercise - Embibe Experts Solutions for Chapter: Permutation and Combination, Exercise 4: Exercise-4
Attempt the free practice questions on Chapter 8: Permutation and Combination, Exercise 4: Exercise-4 with hints and solutions to strengthen your understanding. Alpha Question Bank for Engineering: Mathematics solutions are prepared by Experienced Embibe Experts.
Questions from Embibe Experts Solutions for Chapter: Permutation and Combination, Exercise 4: Exercise-4 with Hints & Solutions
Prove that is divisible by

Let Find the the number of pairs such and

Consider a -sided convex polygon with vertices in that order. Find the number of ways in which three sides of can be chosen so that every pair among them has at least two sides of between them. For example, is an admissible triple while is not.

Find the number of -digit numbers (in base ) having non-zero digits and which are divisible by but not by .

Find the number of all integer-sided isosceles obtuse-angled triangles with perimeter .

Let be a triangle. An interior point of is said to be good if we can find exactly rays emanating from intersecting the sides of the triangle such that the triangle is divided by these rays into smaller triangles of equal area. Determine the number of good points for a given triangle

Let be a permutation of A pair is said to correspond to an inversion of if but (Example : In the permutation there are inversions corresponding to the pairs How many permutations of have exactly two inversions.?

Let is set of all possible planes passing through four vertices of given cube. Find number of ways of selecting four planes from set , which are linearly dependent and one common point. (If planes , and can be written as , where all are not equal to zero, then we say planes are linearly dependent planes).
