Given an array, find the number of increasing sub-sequences having GCD=1 Example: A={1, 2, 3} Output: 5 The increasing sub-sequences are {1},{1,2},{1,2,3},{1,3},{2,3} The only approach I can think is to try all the possible sub-sequences and calculate their GCD.