Dragonfall
- 1,023
- 5
Mentallic said:Yes, if N=1 :D
Or P = 0
Mentallic said:Yes, if N=1 :D
Mentallic said:Yes, if N=1 :D
It's not so difficult. Whitehead and Russell needed only 379 pages to prove this.zoki85 said:1+1=2
Ah, but take a look at your post here:Demystifier said:It's not so difficult. Whitehead and Russell needed only 379 pages to prove this.
http://en.wikipedia.org/wiki/Principia_Mathematica
http://quod.lib.umich.edu/cgi/t/tex...3201.0001.001&frm=frameset&view=image&seq=401
Demystifier said:The problem has been considered a lot. The most important result (by Cohen) is a proof that the problem is unsolvable by using standard axioms of set theory. Different non-standard axioms of set theory may lead to different solutions, but then the problem is how to know which axioms, if any, are the "right" ones?
For more details see
http://en.wikipedia.org/wiki/Continuum_hypothesis
Shyan said:You should still note that no single algorithm exists for finding the integral of a function, even if we exclude integrals which can't be expressed in terms of elementary functions(Oops...its not applicable to such integrals, right?). So finding such an algorithm is an open problem and it seems to be very hard.
What do you mean by difficult?Demystifier said:What, in your opinion, seems to be (one of) the most difficult equation(s) in mathematics?
Here is my choice:
Find the solution ##k## of the equation
$$2^{\aleph_0}=\aleph_k$$