My hunch on the difficulty of higher math

  • Thread starter Thread starter bobsmith76
  • Start date Start date
  • Tags Tags
    Difficulty
bobsmith76
Messages
336
Reaction score
0
Just about all of the problems in my calculus textbook range on average range between 4 and 8 steps. Once you know the algorithm the problems are usually easy and routine. It is simply a matter of understanding what the algorithm requires. Ironically the hardest part about math is understanding the vocabulary and the special language that it is written in. As everyone know, all math builds on other math. I have a feeling that higher math problems will continue to range between 4 and 8 steps, it's just a matter learning all the algorithms and learning all the prerequisite math. Is this true? Adding new knowledge to math, that of course is hard, but learning something else that someone has discovered is easy. To illustrate this is easy. Think of how easy it is to understand that F = MA, yet it took centuries for man to discover.
 
Mathematics news on Phys.org
Higher math bears no resemblance to the math you're doing right now. In particular, you will rarely be performing calculations, and there will almost never be an algorithm for you to follow. Most of the time, you won't even be working with numbers.
 
It will get to a point when the whole lecture is spent on proving a *single* theorem, and the homework takes days to *think* about, with a single question taking pages to write down its proof.
 
bobsmith76 said:
learning something else that someone has discovered is easy.

Ha ha, no. Easier sure. But easy? The amount of required reading you need for, say, K-theory will send you back months, if not years.
 
Guess, I was wrong. I am aware of the difficulty of the theorem for finite simple groups:

one cannot command a clear view of the classification theorem for finite simple groups. Though the statement of the theorem requires but half a page, its proof required 10,000 pages and employed the joint effort of hundreds of mathematicians spanning several decades. The mathematical community considers the theorem proven, but no one mathematician is able to survey the entire proof. - William Dembski
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top