The fraction 103 can be written as the sum of two positive fractions with numerator 1 as follows: 103=51+101 and also 103=41+201. There are the only two ways in which this can be done. In how many ways can 19843 be written as the sum of two positive fractions with numerator 1?
Is there a positive integer n, not divisible by 3, such that n3 can be written as the sum of two positive fractions with numerator 1 in exactly 1984 ways? combinatorics unsolvedcombinatorics