| We hope you enjoy your visit. You're currently viewing our forum as a guest. This means you are limited to certain areas of the board and there are some features you can't use. If you join our community, you'll be able to access member-only sections, and use many member-only features such as customizing your profile, sending personal messages, and voting in polls. Registration is simple, fast, and completely free. Join our community! If you're already a member please log in to your account to access all of our features: |
- Pages:
- 1
- 2
| 1=2 ? | |
|---|---|
| Tweet Topic Started: Dec 2 2008, 02:58 PM (1,389 Views) | |
| Chris | Feb 11 2009, 07:29 PM Post #16 |
|
Member
![]() ![]() ![]() ![]() ![]() ![]() ![]()
|
That is wrong. I don't understand mod math, but by your rules (3+2) mod 4 would = 1, not 5. 3 + 2 = 5.. divide by 4 and you have a remainder of 1. Hmm confused my self... ill take a look at this later. Edited by Chris, Feb 11 2009, 07:30 PM.
|
![]() |
|
| ico | Feb 11 2009, 07:55 PM Post #17 |
|
Member
![]() ![]() ![]()
|
Equation 6 assumes that modular addition is distributive, which is true only when the integer quotients from division are equal. It's like saying that 24 minutes are as long as 84 minutes because on a digital clock they both appear as :24. The remainders from dividing each length by 60 are both 24, yet the integer quotients are 0 and 1. That means the 60 minute discrepancy was lost to the mod operator. If the quotients were 2 and 2 (equal, unlike 0 and 1) then that would mean both equal time periods were 2*60+24 = 144 minutes. Here's one with complex numbers.
Edited by ico, Feb 11 2009, 08:20 PM.
|
![]() |
|
| Garath531 | Feb 11 2009, 08:41 PM Post #18 |
|
Look, up in the sky! It's a bird! It's a plane! It's Superman!
![]() ![]() ![]() ![]() ![]() ![]()
|
You forgot that sqrt(1) = +/-1. I fixed the problem for you.
|
![]() |
|
| Chris | Feb 11 2009, 10:41 PM Post #19 |
|
Member
![]() ![]() ![]() ![]() ![]() ![]() ![]()
|
Actually in a certain, VERY weird way you can divide by 0 and still have a true equation. When you are using variables, that is. You actually need TWO (probably can have more.. but you need at least 2) variables to remain. x + y = y So far this can still be true. Subtract y from both sides and get x = 0. Subtract x from both sides, replace the right-bound x with y, get y = 0. x = 0 = y However, once you combine variables and remove them all together.. then it becomes fallacious. This is very interesting. It seems like part of the conundrum is a proof that x = 0 and y = 0, and nothing else. I mean.. can you prove that they equal anything else? Can you prove that 1 = 1? 2 = 2? You just accept them as equal, but there isn't really a proof to it. Edited by Chris, Feb 11 2009, 10:45 PM.
|
![]() |
|
| cvn-tv-dip | Feb 11 2009, 10:51 PM Post #20 |
|
Member
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]()
|
1=1, or A=A, is a fundamental logical property (reflexive property). Nothing makes sense if A doesn't equal to itself. |
![]() |
|
| IceMetalPunk | Feb 15 2009, 04:29 PM Post #21 |
|
We are all IMPerfect. Be proud!
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]()
|
Xenogale got mine right. Mod is not a function; it is an operator. Just as you cannot "distribute" a square root or exponent over addition, you can't do it with mod, either. For example, (3+2)^2 [=25] DOES NOT EQUAL (3^2+2^2) [=13]. And so, while 3+2=5, (3+2)mod 4 [=1] does NOT equal [(3) mod 4] + [(2) mod 4] [=5]. Basically, 5=/=1, so the proof dies on line 5, when I try to distribute an operation. -IMP
|
![]() |
|
| 1 user reading this topic (1 Guest and 0 Anonymous) | |
| « Previous Topic · Community Games · Next Topic » |
- Pages:
- 1
- 2
| Track Topic · E-mail Topic |
3:07 PM Jul 11
|



![]](http://b1.ifrm.com/0/1/0/p601690/pipright.png)



3:07 PM Jul 11