Smarandache multispace

Scilogs, V: joining the dots

Further, we tried to generalize the 3n-1 Conjecture to k∙n-1 Conjecture, where k is a positive odd number: 3, 5, 7, ... , in the following way: Take any positive integer n. If n is even divide it by 2 to get n/2. If n is odd multiply it by k and subtract 1 to obtain k∙n-1. Repeat the process (which we called Half

Or k Times Minus One or HOKTMO) indefinitely. The conjecture states that if the number is a power of 2, or after certain iterations one gets a power of 2, then one ends up with 1; but if the number is not a power of 2 and one never gets to a power of 2 after doing iterations, then one diverges to infinity. Similarly for the k∙n+1 Conjecture.

Smarandache multispace

To Linfan Mao I read your paper on biological n-system and on non-solvable systems. Good work! What would be the solution on non-solvable system: x+y = 1, x+y = 2 ?

Linfan Mao Have no solution in classical meaning, but a solution of points on x+y=1 union with that of x+y=2, i.e., a

Smarandache multispace, which is the entire state of system characterized by the two equations.