User Portlet
| Discussions |
|---|
| Here is a linear-time method. The idea is to `Sow` positions where a cleave should occur, then construct the sublists from those positions. cleaveList[ll_List, val_, rlen_] := Module[ {j = 0, k = 0, posns, td, res}, posns = ... |
| Please use the button (third from left) to provide some example rows of your table and also the operations you are trying to use. |
| Principle of computational equivalence (discovered by S. Wolfram): [https://www.inc.com/allison-fass/stephen-wolfram-principle-of-computational-equivalence.html][1] [1]:... |
| Wow Rohit. You made my day. Much obliged. Much to be learned.. Thanks! //Mike |
| You could use `wmic` and `RunProcess` like so: RunProcess[{"wmic", "cpu", "get", "name"}]["StandardOutput"] "Name Intel(R) Core(TM) i7-4930MX CPU @ 3.00GHz " |
| At least numerically the solutions are if not equal, but almost equal. The negative values of alpha1 are missing, here for alpha1 = .237: w1a = W1 /. {Cos[\[Alpha]1] -> c1, Cos[\[Alpha]3] -> c3, Sin[\[Alpha]3] -> Sqrt[1 - c3^2]}; w2a =... |
| Thanks to your help, I made the code I wanted. Thank you very much. |
| Thank you. That works, and {Right, Top} is better than my absolute placement. |
| Rohit, Thank you for the tips. I have been misunderstanding ':=' as 'define', and also was unaware of RandomSample[] - which I'm reading has the desired properties. |
| Hello Henrik, thank you for the clarification. This is actually a very elegant way of computing the solution in a simple way, without having to calculate any coefficients! Funnily (and understandibly), it is converging faster when n gets larger. ... |