I have a difficulty problem. Let F [n] be the number of positive integer divisors of the integer n. for example F [4] = 3 because 4 has 3 divisors which is {1,2,4}. Give two positive integers a and b (a <b; 1<=a<b<10^12). Calculate F[a] + F[a+1] + ... + F[b].↵
INPUT↵
2 5↵
OUTPUT ↵
9↵
PLEASE HELP ME. THANK YOU SO MUCH
INPUT↵
2 5↵
OUTPUT ↵
9↵
PLEASE HELP ME. THANK YOU SO MUCH