Ask your own question, for FREE!
Mathematics 24 Online
OpenStudy (anonymous):

Find the least number of ways of choosing 3 different numbers from 1 to 10 so that all choices have the same sum

OpenStudy (anonymous):

\[=\]I think this has to do with probability, if so then it'll be : \[= 10!/3\] maybe, not sure though ^_^

OpenStudy (anonymous):

what about the sum ?how to find, how many number of sums we get?

OpenStudy (anonymous):

hmmm, not sure.

OpenStudy (anonymous):

sorry :)

OpenStudy (anonymous):

i have another question...

OpenStudy (anonymous):

I'll try to help ^_^ what is it?

OpenStudy (anonymous):

how to know if a recurrence relation is linearly homogeneous ?

OpenStudy (anonymous):

all I can say is , read this :) and I hope it answers your question : http://www.math.uiowa.edu/~sokratov/2008m150/recurhom.pdf

OpenStudy (anonymous):

because I'm not sure that I have taken it yet ^_^

OpenStudy (anonymous):

okei..thats fine..lemme quickly try this link...i'll post questions if i have doubts

OpenStudy (anonymous):

lol, alright. Good luck ^_^

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!