belisarius is forth
Reputation
106/100 score
 4h comment vector integral in mathematica @MichaelE2 BTW Have you seen this beauty stackoverflow.com/questions/5508110/… ? 4h comment vector integral in mathematica See i.stack.imgur.com/5vyll.jpg I've v9 4h comment vector integral in mathematica @MichaelE2 I wrote Integrate and nothing happened. 10h comment Best way to count this? What should it return of f[p]? 11h comment Change some elements at the second level of a list based on some conditions (# /. {a1_, a2_, a3_, a4_, a5 : "Open", a6_, a7 : 0} :> {a1, a2, a3, a4, a5, "Bad", a7} /; RandomVariate[NormalDistribution[]] > 0.2) & /@ myList 13h comment Bug in PiecewiseExpand and Mod with assumptions V9.0.1 on Win32 shows the same result 13h comment External and internal Assumptions on PiecewiseExpand and Mod @rhermans I suggest copying case 5 to a new question and tagging it with bugs instead of tagging THIS question :). Although we aren't a bugs repository it's nice to have a highlights catalog. 14h comment Why does Nearest not support Sqrt? Added the bugs tag then 16h comment Find a sequence given the sums of its terms @AlecTeal The reason why my fellow Mathematica(TM) programmers and scientists found my answer interesting is because it's a literal translation to Mathematica(TM) of the problem exactly as posed by the OP (Solve fizz when buzz happens), without thinking in the math involved, and showing that Mathematica (TM) is able to solve it without human "intervention" 1d comment How to find all possible paths with as many edges between two same vertices? Welcome to Mathematica.SE! I suggest the following: 0) Browse the common pitfalls question 1) As you receive help, try to give it too, by answering questions in your area of expertise. 2) Read the faq! 3) When you see good questions and answers, vote them up by clicking the gray triangles, because the credibility of the system is based on the reputation gained by users sharing their knowledge. Also, please remember to accept the answer, if any, that solves your problem, by clicking the checkmark sign! 1d comment How to find all possible paths with as many edges between two same vertices? I don't have v10, so I can't test. But the standard way to do such things in graph theory is by creating a dummy vertex on each multiedge (or if you don't want to take care of it, on each edge) to differentiate them 1d comment Find a sequence given the sums of its terms @BrettChampion Thinking is cheating :) 1d comment Find a sequence given the sums of its terms @BrettChampion ha! That's why I wrote the comment above :) 1d comment Find a sequence given the sums of its terms "the most efficient way" is the one that takes you less time 1d comment Partitioning Table Thanks a lot... 1d comment Introducing dashing to distinguish curves in a multiple curve plot But it was a trivial modification of your posted code. I believe you're using that code without understanding it :( 1d comment Introducing dashing to distinguish curves in a multiple curve plot You should know that upvoting good questions and answers is the way to tract attention to them. Since you're using the linked result I guess you could upvote it! 1d comment Introducing dashing to distinguish curves in a multiple curve plot Welcome to Mathematica.SE! I suggest the following: 0) Browse the common pitfalls question 1) As you receive help, try to give it too, by answering questions in your area of expertise. 2) Read the faq! 3) When you see good questions and answers, vote them up by clicking the gray triangles, because the credibility of the system is based on the reputation gained by users sharing their knowledge. Also, please remember to accept the answer, if any, that solves your problem, by clicking the checkmark sign! 1d comment Partitioning Table @ciao Could you post that as an answer or vote to close?. Otherwise this will be kept on the unanswered queue 1d comment “renormalising” a list Take a look at GatherBy[ ]