sign up I login
 advanced
refer a friend - earn nickels!!

Ask & Discuss Questions with Community & Experts

Moderation Team
Ask iit jee aieee pet cbse icse state board community Discussion Response Post to: find no of three digits that can b formd
Forum Index -> Algebra -> View Full Question like the article? email it to a friend.  
Author Message
a5hw1n_5 (184)

Hot goIITian

Olaaa!! Perrrfect answer. 30  [47 rates]

a5hw1n_5's Avatar

total posts: 134    
offline Offline
if y=9 x can take value 1,2...or 8 ie there are 8 ways of choosing x. similarly z can take values 0,1,...or 8 so there are 9 ways of choosing z
  hence the total number of ways of choosing x and z if y=9 is 9*8= 9(9-1)
  therefore if y=r (1<r<=9) then the total number of ways of choosing x and z is obviously r(r-1)

     so as y takes the values from 2-9 the number of combinations is given as
       [2][ 9] [r(r-1)]
  i given the previous ans as [1][ 9] [r(r-1)]. but u get the same ans anyways as  1(1-1)=0.
note- y cant take the val 1 as x cannot be 0 and x<y.
hope i cleared it for u. cheers!!
 this reply: 2 points  (with Olaaa!! Perrrfect answer.   in 1 votes )   [?]
 
You have to be logged on to rate
  
 

Top Offers for goIITians
Correspondence Courses
Brilliant Tutorials
Narayana Institute
Aakash Institute
Classroom/Crash Courses
Narayana - Kota , Delhi , Others
Brilliant Tutorials - Class , Crash
Aakash Institute - Medical , Engg
Online Test Series
Brilliant Tutorials
Narayana Institute
Aakash Institute
Mahesh Tutorials
AMITY      Sri Chaitanya