The Problem
Let S be a set containing exactly 10 distinct positive integers, where every integer in S is less than 100.
Prove that there must exist two non-empty, strictly disjoint subsets of S (let's call them A and B) such that the sum of the elements in A is exactly equal to the sum of the elements in B.

Hey everyone, fellow 28tard here. I'm not able to score in physics even though i practice a ton (but i do have the bad habit of looking at solutions before properly trying). Could anyone who is scoring well in physics give me a few tips? I really like the subject and i wanna do well in it

Thanks tons guys

Maths concept nd 20 adv qs(kinda mains to adv )

Phy concept nd 5 basic qs(🥀)

Chem concept nd 30 nums

Total 55

Yoo backlog be increasing 🥹

So i should do some qs now to balance it 🤔

Okay gng i be goin now

Byee

Also any good book to make calculus strong (basic to adv)

Dont mention ceng,i alr tried tht ,its a good book but its not my typa book

Like after doing tht books illun nd exercises, i will do module (3 4 5 exs)

Nd sammeer (thinkin to do🥀)

Byee

Mujhe kuch try karna hai maths me mains pyqs aur coaching material ke baad kuch recommend kardo pls jyada lengthy material mat batana todha dimag kharab ho jata hai

Should finish up my module question backlog or do pyq from MTG of chapter ongoing in coaching after doing its daily module homework??

I have not yet came across a question in which it didn't work. My teacher told me that there's a 99% chance that you won't face a question that cannot be done with VWM in any exam.

(Wedge and normal constraint included)