# Tag Info

Accepted

### Association vs Pair - Creation performance, Selection performance

Simply use keys = Range[1000000]; vals = Range[1000000]^2; result = Pick[vals, PrimeQ[keys]]; to get the best of both worlds (zero construction cost and even ...
• 94.6k

### How to Create an Efficient Word Square Algorithm?

I have created an algorithm that takes about 2.4 seconds to find the word squares for "hair" and 10.5 seconds for "dogs". ...
• 1,037
Accepted

### Replacement, PatternTest, Module related Question

The reason your attempt fails is that at the time the Function is applied to its arguments, m has not yet been replaced by ...
• 23.2k
Accepted

### Classifying elements, by the value of a fixed function, using Replace

L = Table[ConstantArray[1, RandomInteger[999]], 100000]; m = Replace[L, {x_List :> Quotient[Length@x, 100]}, {1}]; \{7,2,8,8,6,5,1,5,2,1,1,3,6,7,2,4,7,2,1,8,...
• 14.2k
Accepted

### While inside a function body does not work as expected

You may wish to disambiguate your description as it seems you're creating rational functions made up of polynomials. Below I modularized CreateDiscontinuityPoly ...
• 1,084
1 vote
Accepted

### get positions satisfying multiple criteria

Granted that your example may not be actually representative of what you ultimately want, here's an attempt: ...
• 3,452

### How to remove duplicates from a pair with some conditions?

How about listNoDuplicates = DeleteDuplicates[Sort /@ list]? Each list inside list gets sorted with ...
• 1,393

### How to remove duplicates from a pair with some conditions?

Here's a stab, but I suspect it can be made more elegant. I'll walk through the development step by step before putting together a complete function. ...
• 3,452

### How can I use variables instead of slots in DeleteCases?

Pick could also be useful: Pick[tuples, Function[{a, b, c}, a + 2 b + c == 0] @@@ tuples, False]
• 4,809

### How can I use variables instead of slots in DeleteCases?

g[{a_, b_, c_}] := a + 2 b + c == 0 Using the operator form: DeleteCases[x_ /; g[x]][tuples]
• 14.2k
Accepted

...
• 51.3k

### How can I use variables instead of slots in DeleteCases?

Perhaps (Thanks to comment/correction @BenIzd ) DeleteCases[tuples, _?(Apply@Function[{a, b, c}, a + 2 b + c == 0])] is what you are looking for?
• 36.3k
1 vote

### How to generate all commutative pairings of list elements?

Here is one more recursive answer that I find slightly easier to read: ...
• 2,791
Accepted

### How to simplify function with Abs?

PiecewiseExpand does it. Edit and // ComplexExpand // Simplify does it ...
• 15.1k

### How to simplify function with Abs?

Here's the ComplexityFunction way I referred to in my comment just to illustrate the alternative: ...
• 213k

### How to simplify function with Abs?

Try this: Refine[Simplify[mylist], Assumptions -> x \[Element] Reals]
• 3,648
Accepted

### Tallying over columns of matrix

Not sure what would be the best representation in your case, but here's a possible way to start. Let's start with a simplified case of one isolated column (as a List): ...
• 3,452

### How to test a recursive formula using Mathematica?

For a fully recursive implementation, for which @kenric gives an outline, the definition must be inductive. In particular, you need a base case (or more in some cases, like for the Fibonacci recursion)...
• 213k
Accepted

### RunProcess : Save directly to Mathematica Variable

It might be possible to do what you say, if myprogram.exe can output the image data directly to stdout. But I wouldn't lose any sleep over having to create a ...
• 62.4k

### How to find palindromic numbers (Project Euler #4)?

This is a report on an upgrade in later versions. Things changed for the best with regards to this question. Since V10.3 we have ...
• 5,684
1 vote

### How can I efficiently define functions with different names but doing the same stuff?

If I understand your question correctly, this is how I usually implement this. ...
• 1,180
1 vote

### How can I efficiently define functions with different names but doing the same stuff?

Just to show another perspective that could also work on multiple definitions. Define your base function (which could have multiple definitions) ...
• 4,809
Accepted

### How can I efficiently define functions with different names but doing the same stuff?

To define identical functions with SetDelayed use (#[x_] := x^2 + x) & /@ {f, g, h}; This approach is also useful when ...
• 119k