**Introduction**

Even though I’m only a senior in high school, I’m taking a course in differential equations. We came to the section where we learn to solve high order linear differential equations with constant coefficients. We went over the characteristic polynomial, and the case where it has a repeated root. We learned that if *r* is a repeated root then, and are both solutions to the differential equation. There was a proof of this using reduction of order. Our teacher also told us that if *r* is repeated more times, then we can keep multiplying our previous solutions by *t* for every time *r* was repeated. This, he said without proof. So, I decided to prove it myself.

**Trial 1**

So, let’s say you have a differential equation with constant coefficients, second order to make it easy, as shown below:

This is completely general, as, if there was a coefficient in front of the term, I could merely divide it out. I haven’t worked with differential operators very much, but I did notice that this could be written as the product of differential operators like this:

because, if you multiply that out you get

which obviously simplifies to the above equation of and .

The advantage of putting it in this form, is that it’s obvious that the solutions to the resulting characteristic equation are and . It’s also obvious that higher order equations can be made easily by multiplying by where *c* will be another solution to the characteristic equation. It’s also worth noting that the order that they’re multiplied in doesn’t matter. You get the same thing.

Now, I considered what happened when is applied to . Doing this you get

Notice that this is very similar to what the normal differentiation operator does to polynomials. It’s exactly the same except that is replaced by . Now, it’s obvious why are also solutions. If we take the nth derivative of , we get 0 if n >= k. In the same way, if we take , we get 0 if n>= k.

**Generaliziminization**

I was satisfied with this result at the time, and didn’t think to take this any further. But recently we started going over Euler Equations. That is, differential equations of the form:

Basic solutions are of the form , and by substituting that for y you can find the characteristic polynomial and solve it like you would the differential equations with constant coefficients. Repeated roots are treated the same way, except you multiply by instead.

This diff eq. can also be written as a product of differential operators, but this time of the form

What if one could derive that the natural log was the appropriate choice using this fact? That is find a function that causes the above differentiation operator to act on like the regular differentiation operator does on . Actually, this is pretty easy to do. Merely solve the equation for .

Obviously is an appropriate function. To generalize even further if you have any differential equation that can be produced by products of

,

and the solutions are of the form , solutions to equations with repeated roots can be found by repeatedly multiplying the base solution, by any that satisfies:

For example, with linear differential equations with constant coefficients and . In the case of Euler equations and .

Knowing this probably isn’t very useful but finding connections in mathematics is always interesting. I do wonder, though, if there is a name for this. But whether or not there is, I think this is a fun way to see things.