Sum of all subsets of a set formed by first n natural numbers | Java program to find sum of all subsets of a set . ; sum of subsets is ( n * ( n + 1 ) / 2 ) * pow ( 2 , n - 1 ) ; Driver code
class GFG { static long findSumSubsets ( int n ) { return ( n * ( n + 1 ) / 2 ) * ( 1 << ( n - 1 ) ) ; } public static void main ( String [ ] args ) { int n = 3 ; System . out . print ( findSumSubsets ( n ) ) ; } }