A very very hard college algebra problem

Click For Summary
SUMMARY

The forum discussion revolves around a challenging college algebra problem involving the binomial theorem and polynomial functions. The main objective is to find a polynomial \( f_k(x) \) such that \( f_k(x) - f_k(x-1) = x^k \). Participants clarify that the problem requires expressing \( f_k(x) \) in terms of previous polynomials \( f_{k-1}, f_{k-2}, \) etc., and discuss the role of an arbitrary constant \( C \) in the context of polynomial manipulation.

PREREQUISITES
  • Understanding of the binomial theorem
  • Familiarity with polynomial functions and their properties
  • Knowledge of recursive relations in algebra
  • Ability to interpret mathematical notation and expressions
NEXT STEPS
  • Study the binomial theorem and its applications in polynomial equations
  • Explore recursive relations in polynomial sequences
  • Learn about polynomial interpolation techniques
  • Investigate the properties of combinations and their role in algebraic expressions
USEFUL FOR

Students tackling advanced algebra problems, educators seeking to explain polynomial relationships, and anyone interested in deepening their understanding of the binomial theorem and recursive functions in mathematics.

nmego12345
Messages
21
Reaction score
0

Homework Statement


Note: I'm saying it's very very hard because I still couldn't solve it and I've posted it in stackexchange and no answer till now.

I'm posting here the problem statement, all variables and known data in addition to my solving attempts. Because I'm posting an image of my question and that it would be hard to separate my solving attempts from the problem statement etc.., but they are obvious in the image. I'm posting an image because I'm not familiar to the formatting here yet, and I don't have time to format all this problem again ( took me 1.5 hours to format)

https://s3.amazonaws.com/diigo/thum...][/B][/B] [h2]The Attempt at a Solution[/h2]
 
Physics news on Phys.org
We need to state the problem correctly. Isn't the problem to find a polynomial ##f_k (x)## such that ##f_k(x)- f_k(x-1) = x^k## ?
 
I'm not sure If I understand the problem correctly, I found it on a textbook, I didn't invent it, but I think
that you're correct
 
Let ##p(x) = x^{k+1} + ...## other terms. Suppose, for example, that ##p(x) - p(x-1)## has the term ##Cx^3##.

By part 2) , if you form the new polynomial ## q(x) = p(x) - C f_3(x) ## then

##q(x) - q(x-1) = p(x) - p(x-1) + C (f_3(x) - f_3(x-1)) = x^{k+1}+ ... Cx^3 + ... - C x^3## so you can eliminate the ##Cx^3## term by subtracting a multiple of ##f_3(x)##.

I think what the problem wants you to do is express ##f_k(x)## as ##x^k## minus multiples of ##f_{k-1}, f_{k-2},...##.

After you do that, you may be able to find the numerical values of the coefficients, but perhaps the problem only wants you to write the "recursive" relation between ##f_k## and ##f_{k-1}, f_{k-2} ... ##.
 
First of all, what is Cx3?, is it combinations? but combinations are defined over 2 numbers not 1 number. Is it an arbitary constant?
 
nmego12345 said:
First of all, what is Cx3?, is it combinations? but combinations are defined over 2 numbers not 1 number. Is it an arbitary constant?

C is an arbitrary constant.
 
nmego12345 said:
First of all, what is Cx3?, IIRC, aren't combinations have 2 numbers to begin with?

Oh Ok, I reread your answer, that makes sense.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 5 ·
Replies
5
Views
5K
Replies
4
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 105 ·
4
Replies
105
Views
9K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K