It cannot be proven because it is not true.
Suppose S1 = {0,1,2,3} and S2 = {0,5,10} then S1 u S2 = {0,1,2,3,5,10}
then |S1| = n = 4, |S2| = m = 3
but |S1 u S2| = 6 which is NOT n+m = 7
You can't it equals 2. You can't it equals 2.
2048
This is a very difficult philosophical question. The best way to look at it is that 2 is defined as 1 plus 1 ! (If it isn't, how do you define 2?)
If you mean 2 plus 2 equals 5 it is possible. 2 plus 2 equals 22 (or it could also be 4 if you want it but must be 22 to make 5...it makes sense) V is the 22nd letter in the alphabet and the roman numeral for V is 5. BOOM! 2 PLUS 2 EQUALS 5!
4+1=5. Plus 4 equals 9. Plus 77685769844446473 equals 77685769844446482. Plus 3 equals 77685769844446485. Plus 8 equals 77685769844446493. Plus 1 equals 77685769844446494. Plus 9870998342523322424 equals 1064785604097768918. Plus 4 equals 1064785604097768922.
You can't it equals 2. You can't it equals 2.
No you can not prove that 9 +10 = 21.
Using a calculator
Because there is no way to define the divisors, the equations cannot be evaluated.
2 plus 2 eqauls 4 2 times 2 equals 4
Sinθ plus cosθ2 plus sinθ-cosθ2 equals 2 does not equal 2. It equals 2sinθ. The cosθ2 terms cancel out and you are left with sinθ + sinθ which is 2sinθ.
Yes
This is called the Abel-Ruffini theorem.
No, because technically, it is not true.
This would be a real bear to prove, mainly because it's not true.
Until an "equals" sign shows up somewhere in the expression, there's nothing to prove.
2048