Learn to Create a Robotic Device Using Arduino in the Free Webinar. Register Now
One of our academic counsellors will contact you within 1 working day.
Click to Chat
1800-1023-196
+91-120-4616500
CART 0
Use Coupon: CART20 and get 20% off on all online Study Material
Welcome User
OR
LOGIN
Complete Your Registration (Step 2 of 2 )
Free webinar on Robotics (Block Chain) Learn to create a Robotic Device Using Arduino
30th Jan @ 5:00PM for Grade 1 to 10
There are 'n' people and there are 'n 2 ' marbles on the whole.No two of them collect the same number of marbles and each person collects at least one marble.What is the maximum number of marbles any one of them can collect. please provide me the solution as soon as possible. There are 'n' people and there are 'n2' marbles on the whole.No two of them collect the same number of marbles and each person collects at least one marble.What is the maximum number of marbles any one of them can collect. please provide me the solution as soon as possible.
There are 'n' people and there are 'n2' marbles on the whole.No two of them collect the same number of marbles and each person collects at least one marble.What is the maximum number of marbles any one of them can collect.
please provide me the solution as soon as possible.
let first peson gets minimum marble = 1 second gets minimum 2 marbles , third gets minimum 3 marbles & so on....... this is an AP series whose first term is 1 & common difference is 1 ... now total marbles distributed to n-1 people = k k = [(n-1)/2][2+(n-2)] = n(n-1)/2 now , last person gets all remaining marbles .. remaining marbles = total - distributed = n2 - (n(n-1)/2) = n(n+1)/2 this is the maximum number of marble which any 1 of them can get ... approve if u like my ans
let first peson gets minimum marble = 1
second gets minimum 2 marbles , third gets minimum 3 marbles & so on.......
this is an AP series whose first term is 1 & common difference is 1 ...
now total marbles distributed to n-1 people = k
k = [(n-1)/2][2+(n-2)] = n(n-1)/2
now , last person gets all remaining marbles ..
remaining marbles = total - distributed
= n2 - (n(n-1)/2)
= n(n+1)/2
this is the maximum number of marble which any 1 of them can get ...
approve if u like my ans
Post Question
Dear , Preparing for entrance exams? Register yourself for the free demo class from askiitians.
points won -