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
take different cases
if y=9 then x is bet 1-8 and z bet 0-8
therefore no of ways of choosing x and z is 9(9-1)
for y=r
no of ways is r(r-1)
hence tot no of ways is= [1][ 9] [r(r-1)]
                                      =[1][ 9] [r2-r]

                                                 
= n(n+1)(2n+1)/6 - n(n+1)/2
                                     =285-45=240
 this reply: 0 points  (with Olaaa!! Perrrfect answer.   in 0 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