Tag Info

New answers tagged

1

Given a matrix mat replace the 0s in mat with an expression that depends on the indices. randommatrix = RandomInteger[1, {6, 6}]; randommatrix // MatrixForm MapIndexed[# /. {(0) -> Quiet@Style[Evaluate[diff2 @@ #2], Red], _ :> 0} &, randommatrix, {2}] // MatrixForm mat = 1 - Unitize[tttt2]; args = Table[{w, Pprobe}, {w, 2.5, 3., 0.1}, ...


3

I guess you are looking for this. Solve[x1 == !x2 && x2 == !x1, x1] // Quiet {{x1 -> ! x2}} I transpose Unequal to Not Equal like following code. Solve[x1 != !x2 && x2 != !x1 /. a_ != b_ :> (!a) == b, x1] // Quiet {{x1 -> x2}}


3

Unless I'm misunderstanding your question, I think its worth pointing out that {{x1 -> x2}} is not a valid solution to your original equation. Indeed, if x1 == x2, then $$x_1=1-x_2=1-x_1$$ which is always false modulo 2. Mathematica's solution {{x2 -> 1 - x1}} is correct since the two original equations are not linearly independent, and thus ...



Top 50 recent answers are included