
#1
Mar1711, 10:17 PM

P: 1

I'm having some trouble with a particular question brought up in class. It says given F(n)= to the total # of integer solutions what is the smallest n such that F(n)=24. I know how to find F(n) given n, but i can't figure out how to work backwards. Any hints would help.




#2
Mar1811, 04:24 PM

Sci Advisor
P: 5,939

"integer solutions" to what????




#3
Mar1811, 04:45 PM

P: 36

By sums of squares it depends on the amount of terms your adding. There is no answer for 2 squares to equal 24 but for 3 squares theres 4^2+2^2+2^2 and then for 6 squares it could be 2^2+2^2+2^2+2^2+2^2+2^2 so i would guess 2? Please fully explain the problem though.



Register to reply 
Related Discussions  
Sequences, Cumulative Sums, Partial Sums Plot  Ti89 Titanium  Calculators  0  
Finding sums and squares  Precalculus Mathematics Homework  10  
(Ugly?) Inequalities  Squares and sums  Calculus & Beyond Homework  1  
Sums of Squares  Linear & Abstract Algebra  10  
Sums of digits of Perfect Squares  Linear & Abstract Algebra  25 