Check my ig @ammarpvl

Problem

Prove that the set {1,2,3,…,n} can be partitioned into k subsets with the same sum if and only if k divides

1
n ( n+1 ) and n ≥ 2 k−1
2

Solution :

By induction for n=1 , 2 ther e ' s nothing ¿ be proven

lemma: assume theresult is proved for< n alsothe case for n
Case 1 : n is odd

Establish the case for n by induction , example on l , if n isthe smallest odd possible value of l , then

l=n ,∧w e' ≪have

1 1
n=( n−1 )+1=( n−2 )+ 2, ..∧so on , thus= ( n+1 )+ (n−1)
2 2
1
the result is also true for l=n<¿> k= ( n+1)
2
Case 2 : n is even

if n is even thus the smallest value of l=n+ 1, w e' ≪have

n+1=( n−1 )+2=( n−2 )+ 3 ,…∧so on , we gonna have= ( n2 + 1)+ n2

n
¿ the result also true when n is even l=n+1∧k=
2
Case 3 : 2n > l > n+1 and l is odd

lemma: consider 2 n>l>n+1 is true for<l when lis odd

1 1
w e' ≪have n+ ( l−n )=( n−1 ) + ( l−n+1 ) =…= ( l+1 ) + (l−1)
2 2
These will use up the value of l−n , l−n+1 , …∧so onuntil … , n . By induction the rem−¿
ainders of 1,2 , … ,l−n−1 giveus the remaining ∑ of l
Case 4 : 2n > l > n+1 and l is even
¿ if l iseven w e ' ≪have n+ ( l−n ) =( n−1 ) + ( l−n+1 )=…= ( 2l +1)+( 2l −1)
l
That used up the numbers l−n ,l−n+1 , … , n expect for the . By induction the remaining
2
l
2
numbers such as 1,2 , … ,l−n−1 can bed divided into groups ∑ . But the numbers such
l
2
l
as 1 , … , l−n−1 , must total of multiple l , then we can divide the groups of ∑ into
2
l
pairs which is ∑ .
Case 5 : l ≥2 n

If l≥ 2 n we can formthe k groups n+ ( n−2 k +1 ) , ( n−1 ) + ( n−2k + 2 ) , … … . , ( n−k +1 ) +¿

2
( n+ k ) . Which each ∑ n−2 k +1.∧by induction we can groupthe remaining integ−¿

ers such as 1,2 ,… . , n−2k into k groups each with ∑ l−2 n+2 k−1 , since

2 n ( n+1 )
( l−2 n ) ( l−n−1 ) ≥ 0 hence l−3 n−1+ ≥ 0 , so l−3 n−1+ 4 k ≥ 0∧w e' ≪get
l
l−2 n+2 k =n ≥ 2k −1