摘要： Special subset sums: testingLet S(A) represent the sum of elements in set A of sizen. We shall call it a special sum set if for any two non-empty disj... 阅读全文

摘要： Pandigital Fibonacci endsThe Fibonacci sequence is defined by the recurrence relation:F[n] = F[n-1] + F[n-2], where F[1] = 1 and F[2] = 1.It turns out... 阅读全文

摘要： Special subset sums: optimumLet S(A) represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty dis... 阅读全文