7,316 reputation
1942
bio website
location
age
visits member for 1 year, 5 months
seen 6 hours ago
stats profile views 373

Jun
15
comment How can I revise my program to avoid “No more memory available”?
All the solutions consist of a list beginning with 1, followed by permutations of Range[2,2n], such that the odd elements of the full lis increase monotonically. This suggests an approach of producing the odd elements first (always beginning with 1), and then Riffle-ing with all permutations of the remaining elements, which are the Complement[Range[2, 2n], odd elements] . I have to run so someone else can implement this if they wish.
Jun
5
comment Why does MemberQ need {} around the expression?
I believe that MatchQ[RealDigits[344444][[1]], {x___, 3, 4, y___}] is what you want.
Jun
4
comment Most efficient way to sum over matrix products?
@Rod Lm Correct. I was just having a little fun.
Jun
4
comment Most efficient way to sum over matrix products?
@Rod Lm The sum is zero even if the matrix is really, really large? ;}
Jun
4
comment Introduction of straight Line into Manipulate function
@Milan I suspect there is an earlier definition of one of your variables that is causing the problem. ClearAll your variables before running the code. (No, I don't get that mistake.) I do get a continuous running of the code however. Perhaps someone can suggest how to clear up that problem.
Jun
4
answered Introduction of straight Line into Manipulate function
Jun
4
comment Introduction of straight Line into Manipulate function
Is the line vertical? Is it controlled via the mouse or by a controller? What is its purpose?
Jun
3
comment Importing strings in Mathematica
Anything strange when you try data1//FullForm ?
May
30
comment Programatically adding/retaining comments within a nested list
+1 y : ("(*" ~~ ___ ~~ "*)") is nice.
May
28
answered Is there any function that creates an array from 1 to n, repeating each value m times?
May
23
revised Counting multiplications (complexity function)
added 114 characters in body
May
23
revised Counting multiplications (complexity function)
t placed at beginning
May
23
revised Counting multiplications (complexity function)
t placed at beginning
May
23
answered Counting multiplications (complexity function)
May
22
comment Are there any functions that can determine the disorder between two lists?
SpearmanRankTest, which assumes ordinal rather than interval data, returns the same result as the Pearson test.
May
22
comment Are there any functions that can determine the disorder between two lists?
@FredKline. Actually, Correlation doesn't do just what I was looking for. I switched to PearsonCorrelationTest.
May
22
revised Are there any functions that can determine the disorder between two lists?
pic2
May
22
revised Are there any functions that can determine the disorder between two lists?
pic2
May
22
answered Are there any functions that can determine the disorder between two lists?
May
21
comment Behaviour of prediction bands
The magnitude of the noise depends of the value of the function. (As I understand it, your noise is heteroscedastic.). Note that the noise for larger values is proportionately greater than for smaller values. Sure you want to add noise in this way? Or do you want noise that's independent of the value?