profile-img
Aparna Dash Asked a Question
January 25, 2021 6:05 pmpts 30 pts
A box contains n tickets each bearing one of the numbers from1 to n exactly once. m tickets are drawn from the box one by one with replacement. The chance that the largest number drawn is k is (B) (A) n (C) -k-1 (D) none ot these
  • 2 Answer(s)
  • 0 Likes
  • 2 Comments
  • Shares
  • Priyanshu kumar thankyou
    option C
    Likes(0) Reply(0)
  • Suman Kumar thankyou
    This is for preparation in case someone needs Iit jam 2005-2018 full solution https://iitjamchemistrysolvedpapers.blogspot.com/
    Likes(0) Reply(2)
    Suman Kumar
    please comment if you don't find any solution