def check_decimal(merge_number): count = 0 for idx in range(2, merge_number+1): if merge_number % idx != 0: if idx+1 == merge_number: count = 1 else: continue else: break return count def solution(nums): count = 0 nums_len = len(nums) for idx1 in range(nums_len): for idx2 in range(idx1+1, nums_len): for idx3 in range(idx2+1, nums_len): merge_number = nums[idx1] + nums[idx2] + nums[idx3] count +=..