Name: Anonymous 2009-09-22 21:05
How would I solve this problem using characteristic functions?
For some positive integer k, prove that the number of positive integers using only the digits 1 3 and 4, and whose digits sum to 2k, is a perfect square.
I have that the function is x^4 - x^3 - x - 1 = 0 = ... = x^2 - x - 1 = 0, but don't know shit from there
For some positive integer k, prove that the number of positive integers using only the digits 1 3 and 4, and whose digits sum to 2k, is a perfect square.
I have that the function is x^4 - x^3 - x - 1 = 0 = ... = x^2 - x - 1 = 0, but don't know shit from there