Least common multiple: Difference between revisions
Content added Content deleted
No edit summary |
m (→{{header|J}}) |
||
| Line 1,590: | Line 1,590: | ||
0 1</lang> |
0 1</lang> |
||
Note: least common multiple is the original boolean multiplication. Constraining the universe of values to 0 and 1 allows us to additionally define logical negation (and boolean algebra was redefined to include this constraint in the early 1900s - the original concept of boolean algebra is now known as a boolean ring). |
Note: least common multiple is the original boolean multiplication. Constraining the universe of values to 0 and 1 allows us to additionally define logical negation (and boolean algebra was redefined to include this constraint in the early 1900s - the original concept of boolean algebra is now known as a boolean ring (though, talking to some people: there's been some linguistic drift even there)). |
||
=={{header|Java}}== |
=={{header|Java}}== |
||