English
Tamil Nadu Board of Secondary EducationHSC Arts Class 11

HSC Arts Class 11 - Tamil Nadu Board of Secondary Education Question Bank Solutions

Advertisements
[object Object]
[object Object]
Subjects
Popular subjects
Topics

Please select a subject first

Advertisements
Advertisements
< prev  1161 to 1180 of 2228  next > 

Count the number of three-digit numbers which can be formed from the digits 2, 4, 6, 8 if repetitions of digits is not allowed

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

How many three-digit numbers are there with 3 in the unit place?
with repetition

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

Advertisements

How many three-digit numbers are there with 3 in the unit place? 
without repetition

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

How many numbers are there between 100 and 500 with the digits 0, 1, 2, 3, 4, 5? if repetition of digits allowed

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

How many numbers are there between 100 and 500 with the digits 0, 1, 2, 3, 4, 5? if the repetition of digits is not allowed

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

How many three-digit odd numbers can be formed by using the digits 0, 1, 2, 3, 4, 5? if the repetition of digits is not allowed

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

How many three-digit odd numbers can be formed by using the digits 0, 1, 2, 3, 4, 5? if the repetition of digits is allowed

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

Count the numbers between 999 and 10000 subject to the condition that there are no restriction

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

Count the numbers between 999 and 10000 subject to the condition that there are no digit is repeated

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

Count the numbers between 999 and 10000 subject to the condition that there are at least one of the digits is repeated

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

How many three-digit numbers, which are divisible by 5, can be formed using the digits 0, 1, 2, 3, 4, 5 if repetition of digits are not allowed?

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

How many three-digit numbers, which are divisible by 5, can be formed using the digits 0, 1, 2, 3, 4, 5 if repetition of digits are allowed?

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

To travel from a place A to place B, there are two different bus routes B1, B2, two different train routes T1, T2 and one air route A1. From place B to place C there is one bus route say B1, two different train routes say T1, T2 and one air route A1. Find the number of routes of commuting from place A to place C via place B without using similar mode of transportation

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

How many numbers are there between 1 and 1000 (both inclusive) which are divisible neither by 2 nor by 5?

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

How many strings can be formed using the letters of the word LOTUS if the word either starts with L or ends with S?

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

How many strings can be formed using the letters of the word LOTUS if the word neither starts with L nor ends with S?

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

Count the total number of ways of answering 6 objective type questions, each question having 4 choices

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

In how many ways 10 pigeons can be placed in 3 different pigeon holes?

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

Find the number of ways of distributing 12 distinct prizes to 10 students?

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined

Find the value of 6!

[4] Combinatorics and Mathematical Induction
Chapter: [4] Combinatorics and Mathematical Induction
Concept: undefined >> undefined
< prev  1161 to 1180 of 2228  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×