Having an insatiable interest in science is why you should've cared, but that's not why you failed. Simply put, mathematics is boring to you and you didn't even bother investigating the subject on your own. It's unfortunate that your math teachers didn't know how to inspire you but it's not their fault that you didn't have an interest in understanding mathematics. I actually liked working the equations and solving the problems even though I had a tough time at first memorizing the formulas, but I also understood that math is used to solve problems beyond just learning the equations and processes. As such, I was constantly seeing patterns in numbers and questioning my math teachers about equations that I would solve that predicted cool little patterns that I found.
For instance, in the tenth grade, I learned how to expand binomials, [math](a+b)^n[/math], the hard way by multiplying [math](a+b)[/math] by itself [math]n[/math] times. The first night we had homework, I figured out the binomial expansion theorem myself by developing a process that predicted the coefficients and powers of the expanded binomial. I didn't even know there was a binomial expansion theorem because we hadn't learned it yet, but I showed it to my math teacher the next day. I thought it was cool because it allowed me to do my homework using one line instead of half a sheet of paper, and coach Ware agreed. So, he let me teach it to the class and everyone got to use it until we learned the actual binomial expansion theorem.
Now, you might say that I had a good math teacher, but coach Ware was just teaching us math as is normally taught. After all, he was the school's basketball coach and not a mathematician. If I didn't have an interest in mathematics, I would've never got to teach the class that day and explain how I figured out how to expand binomials.
As Bignose has stated, teachers should focus on problem solving skills. This is what mathematics is all about; being able to solve problems. Martin or Nota, I understand that you feel kind of cheated because instead of learning how to use mathematics to solve problems you learned equations and formulas, which are the tools we use to solve such problems. You were given an equation and asked to plug in numbers to get a result, but you were never given a set of numbers and asked to produce the equation. You see, the first step in mastering problem solving is being able to derive an equation that produces an observed pattern of numbers. However, you can only do this if you know all those little equations and rules like factoring that allow you to develop such equations. The problem you had is that you wanted to be a rock star but you didn't want to put in all that boring, hard work of learning how to play and write the music. Do you see what I'm saying?
The binomial expansion theorem is just another equation that allows us to generate Pascal's triangle and calculate coefficients that occur when we expand binomials. Pretty boring stuff huh? However, did you know that the binomial expansion theorem can be found in just about every single problem in number theory? It still blows my mind to this day. When I was learning trigonometry, I learned that there are polynomials that predicts the summation of [math]x^p[/math]. However, my teacher only knew the polynomial for the summation of [math]x^1[/math], which is
[math]\sum_0^n x=\frac{n(n+1)}{2}[/math]
It took me one year and three months, but I solved the equation that predicts the sum of [math]x^p[/math], which allowed me to derive and extend Newton's interpolation formula:
As you can see in the above quote, the binomial expansion theorem occurs when taking the deltas or products of the set of numbers when interpolating an equation for them. If I didn't know all of those boring formulas, I would never be able to solve such exciting problems. My latest work on the Collatz conjecture, an unsolved problem in mathematics, actually has the binomial expansion theorem embedded in it where the diagonal numbers in Pascal's triangle determines the number of lines that pass through points that occur for each iteration of the Collatz function. For instance, the following graph shows the lines that goes through the points for one iteration of the Collatz function:
Here is the graph for two iterations of the Collatz function:
Here is the graph for three iterations of the Collatz function:
You'll notice that for the first iteration, the points are equally distributed along each line. However, you'll see that the points occur in repeating clusters for the second and third iterations along each line. The pattern for the second iteration is that the top line has its points equally spaced but there are 2 points clustered along the second line. 3 points clustered along the third line and so forth. The pattern again changes for the third iteration. The top line has its points equally spaced with 3 points clustered along the second line. 6 points clustered along the third line and 10 points clustered along the fourth line and so forth. The green line is the function, [math]f(x)=x[/math] and is used to determine where iterations of the Collatz function can cycle, which occurs where the blue lines intersect the green line.
Some really cool, mind-blowing facts from applying my problem solving skills to the Collatz conjecture. First, by analyzing where the blue lines intersect the green line, we can conjecture that cycles can only occur when the points are near zero. The slopes of the blue lines decrease exponentially and therefore diverges from [math]y=x[/math] as [math]x[/math] approaches infinity. This means that there are no hidden cycles greater than 1 for extremely large values of [math]x[/math]. It doesn't completely rule out the possibility of a large value of [math]x[/math] from being a cycle because each point in a cluster defines a line that is parallel to other points in the cluster, and these parallel lines eventually no longer appear to occur on a common line as the number of iterations approach infinity. However, because I have the equation that predicts all possible lines for all point clusters for any iteration of the Collatz function, I have derived the equation that predicts all possible points that cycle by setting the equations that determines the blue lines equal to the equation for the green line and solving for [math]x[/math]. For my own purposes, I will withhold this formula, but I don't mind showing you the expanded form of the equation for the first few iterations (if you want to beat me to the proof, you'll need to do the work ):
The intersection points for the first iteration where [math]m=3[/math] and [math]n=1[/math] as defined by the "normal" Collatz function where [math]\ell[/math] is the index of the line cluster and the number of iterations are expressed as constants (I extended it to work with any set of odd numbers [math]m[/math] and [math]n[/math]):
[math]\left(\frac{\mathit{n}}{2^{1+\ell -1}-\mathit{m}^1}\right)[/math]
The intersection points for the second iteration:
[math]\left(\frac{\mathit{n}\left(2^{\text{$\mathit{x}$1}}+\mathit{m}\right)}{2^{2+\ell -1}-\mathit{m}^2}\right)[/math]
The intersection points for the third iteration:
[math]\left(\frac{\mathit{n}\left(2^{\text{$\mathit{x}$1}+\text{$\mathit{x}$2}}+\mathit{m}\left(2^{\text{$\mathit{x}$1}}+\mathit{m}\right)\right)}{2^{3+\ell -1}-\mathit{m}^3}\right)[/math]
The intersection points for the fourth iteration:
[math]\left(\frac{\mathit{n}\left(2^{\text{$\mathit{x}$1}+\text{$\mathit{x}$2}+\text{$\mathit{x}$3}}+\mathit{m}\left(2^{\text{$\mathit{x}$1}+\text{$\mathit{x}$2}}+\mathit{m}\left(2^{\text{$\mathit{x}$1}}+\mathit{m}\right)\right)\right)}{2^{4+\ell -1}-\mathit{m}^4}\right)[/math]
You'll notice that the above equations have [math]x_1,x_2,x_3[/math] etc.. These variables define the number of twos that actually divide the even numbers that occur when iterating an odd number. However, it doesn't include the number of twos for the last odd number that occurs during a given iteration. If you were to apply the Collatz function to the odd numbers or rational numbers that have odd numerators defined by the above equations, you will find that they do indeed cycle in the specified number of iterations:
Applying the Collatz function to the equation for the cyclic integers / rationals of the first iteration:
[math]\left(\left(\mathit{m}\left(\frac{\mathit{n}}{2^{1+\ell -1}-\mathit{m}^1}\right)+\mathit{n}\right)\div 2^{(1+\ell )-1}\right)=\left(\frac{\mathit{n}}{2^{1+\ell -1}-\mathit{m}^1}\right)[/math]
Applying the Collatz function to the equation for the cyclic integers / rationals of the second iteration:
[math]\left(\left(\mathit{m}\left(\left(\mathit{m}\left(\frac{\mathit{n}\left(2^{\text{$\mathit{x}$1}}+\mathit{m}\right)}{2^{2+\ell -1}-\mathit{m}^2}\right)+\mathit{n}\right)\div 2^{\text{$\mathit{x}$1}}\right)+\mathit{n}\right)\div 2^{(2+\ell )-(\text{$\mathit{x}$1})-1}\right)=\left(\frac{\mathit{n}\left(2^{\text{$\mathit{x}$1}}+\mathit{m}\right)}{2^{2+\ell -1}-\mathit{m}^2}\right)[/math]
Applying the Collatz function to the equation for the cyclic integers / rationals of the third iteration:
[math]\left(\left(\mathit{m}\left(\left(\mathit{m}\left(\left(\mathit{m}\left(\frac{\mathit{n}\left(2^{\text{$\mathit{x}$1}+\text{$\mathit{x}$2}}+\mathit{m}\left(2^{\text{$\mathit{x}$1}}+\mathit{m}\right)\right)}{2^{3+\ell -1}-\mathit{m}^3}\right)+\mathit{n}\right)\div 2^{\text{$\mathit{x}$1}}\right)+\mathit{n}\right)\div 2^{\text{$\mathit{x}$2}}\right)+\mathit{n}\right)\div 2^{(3+\ell )-(\text{$\mathit{x}$1}+\text{$\mathit{x}$2})-1}\right)=[/math]
[math]\left(\frac{\mathit{n}\left(2^{\text{$\mathit{x}$1}+\text{$\mathit{x}$2}}+\mathit{m}\left(2^{\text{$\mathit{x}$1}}+\mathit{m}\right)\right)}{2^{3+\ell -1}-\mathit{m}^3}\right)[/math]
As we can tell by applying the Collatz function to the intersection points, the number of twos that divide the last odd integer / odd rational number is equal to [math](r+\ell)-(x_1+x_2+\cdots)-1[/math]. If [math]x_1,x_2,\cdots[/math] are greater than 0, and [math]r+\ell-1 > x_1+x_2+\cdots[/math], then the numbers defined by the equations for the intersection points do indeed cycle in [math]r[/math] iterations of the Collatz function and define odd integers or rational number where the numerator is odd. The next step is to show that 1 is the only integer greater than 0 that cycles and all other positive numbers are rational. These intersection points combined with other equations that I have derived that maps out the odd integers that occur while iterating the Collatz functions indefinitely for an initial odd number can be used to construct a proof of the Collatz conjecture and solve an 80 year old, unsolved math problem.
So, you can see how important it is to know all of these boring equations and formulas because they allow us to delve into the unknown and solve problems that have remained unsolved for decades and even centuries! Although your teachers could never teach you how to solve the Collatz conjecture, they did try to teach you the tools that you could've used to do it. Ultimately, it was up to you to take the leap into the world of mathematics, but it was boring to you, which is perfectly ok. Not everyone was meant to play with numbers Just remember, if you want to be a rock star, you have to practice playing and writing music. Even if the work to get there is boring, the reward is definitely worth the effort \,,/