Euclid's Theorem - Understanding Proofs & Induction Process

  • Thread starter Thread starter nebbione
  • Start date Start date
  • Tags Tags
    Theorem
nebbione
Messages
131
Reaction score
0
Hi everyone! In this period I'm trying to understand how proofs work.
And i don't understand why the induction process is only used sometimes. When can i use it ?

For example in the euclid's theorem http://en.wikipedia.org/wiki/Euclid's_theorem
why this could not be proven with the induction ?
 
Mathematics news on Phys.org
Hi. There is no general formula or template for proving something. You can't just take the "induction template" and use that to prove any old theorem.

I am curious how much math you actually know. Because frankly, I think you should focus on learning more math, because with that education, proofs will become clearer.Edit:
Maybe start by reading this:
http://en.wikipedia.org/wiki/Mathematical_proof
 
Can you explain me why i can't use induction always when talking for examples of euclid's theorem ? we only have natural numbers in this context
 
Go ahead. Try to use induction and post your proof here.

Do you know what induction is? Can you tell me in your own words?

Do you know what Euclids Theorem is? Can you tell me in your own words?
 
sorry i re read the induction and the euclid's theorem and now i understand.
You are right.
I cannot use induction since I'm not considering contigous numbers, but thre prime numbers distributed randomly in N.
 
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