Reputation
6,866
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
12 35
Newest
 Nice Answer
Impact
~77k people reached

  • 0 posts edited
  • 0 helpful flags
  • 470 votes cast
Jan
29
answered Goldbach Partition
Jan
29
answered Encoding/Decoding matrices as integers, integers as matrices
Jan
29
comment A function about prime gaps
Yes. For any range of primes, some gaps will not appear. Dale's code hides this by using Flatten to remove missing gaps. Your adjustment to include Fail before Flatten reveals the limitation.
Jan
28
answered A function about prime gaps
Jan
27
revised Artefact at joints within BSplineCurve of low Opacity
added 278 characters in body
Jan
27
answered Detecting components in timeseries
Jan
23
reviewed Approve LogLinearPlot issues
Jan
19
answered Resolve does not resolve this statement with quantifier
Jan
19
answered Finding the smallest starting number producing a Collatz sequence of length 125 which ends with a value > 4
Jan
17
answered Number of solutions for inequality
Jan
6
revised cantor set intervals
added 52 characters in body
Jan
6
answered cantor set intervals
Jan
5
answered Discrete Fourier Transform - Inadequate precision and wrong peak positions
Dec
25
answered Random non-overlapping disks in a square
Dec
25
comment Fastest square number test
@rogerl Having failed before by using Compile on integers greater than 2 billion, my original answer never tested isSq2 on such large numbers. Therefore, the result in the comment is new, and not at odds with the original answer. However, before I trust any compiled result on large integers, I must see a documented source which explains that Compile on 64 bit machines works on integers above 2 billion.
Dec
25
comment Lloyd relaxation on VoronoiMesh
For a neat application (v10) of adaptive Voronoi meshes to images, see the Help page for VoronoiMesh > Applications > Image Processing. With iteration, the cells become nearly circular, and their sizes adapt locally to the image structure.
Dec
25
comment Tell if a point is inside a FilledCurve
With version 10.2, there is a simple modification for the visualization which eliminates the test function f. For example, region=BoundaryDiscretizeGraphics[curve,MaxCellMeasure->0.01], followed by p=RandomPoint[region,5000], and Graphics[{{Red,AbsolutePointSize[1],Point[p]},{FaceForm[],EdgeForm[Black],curve‌​}}].
Dec
25
comment Fastest square number test
@rogerl I don't recall which version was used. On version 10.3, I find isSq2 about 6 to 10 times faster than SquareQ08, which is written for integers of any size. I do not understand how isSq2, which is compiled, works with integers larger than 2 billion. Can you explain?
Dec
16
answered Faster square test for integers
Dec
8
comment Tweaking a code for basins of attraction
Yes. I know this is not what you want; however, it fixes the question you asked at the end of your post about Solve and sol not working for decimal values of $\mu$ and, in addition, there is no need to use the rules variable that you also mentioned as being a problem. Now all you need do is run the Newton iterations with any $x$, $y=0$, and a range of $\mu$ values. Over to you...