Find the number of integers greatest tha...

Find the number of integers greatest than 7000 that can be formed with the digits 3, 5, 7, 8 and 9 where no digits are repeated.

Text Solution

Verified by Experts

The correct Answer is:

192

Topper's Solved these Questions

PERMUTATION & COMBINATION
VMC MODULES ENGLISH|Exercise LEVEL-1|125 Videos
PERMUTATION & COMBINATION
VMC MODULES ENGLISH|Exercise LEVEL-2|88 Videos
MOCK TEST 9
VMC MODULES ENGLISH|Exercise MATHEMATICS (SECTION 2)|5 Videos
PROBABILITY
VMC MODULES ENGLISH|Exercise JEE ADVANCED (ARCHIVE)|102 Videos

Similar Questions

Explore conceptually related problems

a. In how many ways can we form 8-digit numbers from the ditigs 0,1,2,3,4,5,6,7? (Repitition not allowed). b How many of these are even? c. How many of these are divisible by 25? e. Find the number of integers greater than 7000 that can be formed with the digit 3, 5,7,8 and 9, no digit is being repeated.

If m numer of integers greater than 7000 can be formed with the digits 3, 5, 7, 8 and 9, such that no digit is being repeated, then the value of (m)/(100) is

Number of even numbes greater than 300 that can be formed with the digits 1 , 2 , 3 , 4, 5 such that no digit being repeated is

How many numbers are greater than 50000 can be formed with the digits 4 , 5 , 6 , 7 and 8 if no digit being repeated ?

Find the number of numbers lying between 300 and 4000 that can be fomed with the digits 0,1,2,3,4,5, no digit being repeated?

Find the number oif numbers between 300 and 3000 which can be formed with the digits 0,1,2,3,4 and 5 no digit being repeated in any number.

The number of numbers less than 1000 than can be formed out of the digits 0,1,2,3,4 and 5, no digit being repeated, as

Find the number of numbers of 4 digits greater than 3000 that can be formed with the digits 0,1,2,3,4 and 5 if repetition of digits is allowed.

The number of numbers greater than 56000 that can be formed by using the digits 4,5,6,7,8, no digit being repeated in any number is (i) 18 (ii) 36 (iii) 72 (iv) 90

How many numbers of four digits greater than 2300 can be formed with the digits 0, 1, 2, 3, 4,5 and 6; no digit being repeated in any number?

VMC MODULES ENGLISH-PERMUTATION & COMBINATION-JEE ARCHIVE

Find the number of integers greatest than 7000 that can be formed with...
Text Solution
|
The number of integers greater than 6000 that can be formed using the ...
Text Solution
|
How many different nine-digit numbers can be formed from the digits of...
Text Solution
|
An n-digit number is a positive number with exactly n digits. Nine hun...
Text Solution
|
In a college of 300 students, every student reads 5 newspapers and eve...
Text Solution
|
Eight chairs are numbered 1 to 8. Two women and three men wish to oc...
Text Solution
|
Ten different letters of an alphabet are given. Words with five letter...
Text Solution
|
let T(n) be the number of all possible triangels formed by joining ver...
Text Solution
|
Find the value of ""^(47)C4+ underset (r=1) overset( 5) sum ""^(52-r...
Text Solution
|
True or false 1. The product of any 2. r 3. 4. consecutive natural ...
Text Solution
|
The letters of the word COCHIN are permuted and all the permutation...
Text Solution
|
The number of arrangements of the letters of the word BANANA in whic...
Text Solution
|
The number of divisors of the form 4K + 2 , K ge 0 of the integers 24...
Text Solution
|
Find the number of ways in which six '+' and four '-' signs can be arr...
Text Solution
|
There are five balls of different colours and five boxes of colours sa...
Text Solution
|
The number of ways of choosing 10 objects out of 31 objects of which 1...
Text Solution
|
Suppose that 20 pillars of the same height have been erected along the...
Text Solution
|
Some identical balls are arranged in rows to form an equilateral trian...
Text Solution
|
There are m men and two women participating in a chess tournament. Eac...
Text Solution
|
A group of students comprises of 5 boys and n girls. If the number of ...
Text Solution
|
Let S be the set of all triangles in the xy-plane, each having one ver...
Text Solution
|