# User Portlet

Sander Huisman
Discussions
The functionality of this post has been summarized in the function GeneralizedChaosGame, available on the Wolfram Function Repository: https://resources.wolframcloud.com/FunctionRepository/resources/GeneralizedChaosGame So you can now try this...
10 and 11 (among others) are hard-coded: Cases[DownValues[NKSSpecialFunctionsSpherePointsDumpiSpherePoints],HoldPattern[NKSSpecialFunctionsSpherePointsDumpiSpherePoints[x_Integer]]:>x,\[Infinity]] {1, 2, 3, 4, 5, 6, 7, 8, 9, 10,...
The functionality of this post has been summarized in the function GeneralizedChaosGame, available on the Wolfram Function Repository: https://resources.wolframcloud.com/FunctionRepository/resources/GeneralizedChaosGame So you can now try this...
An exact way, would be to create something like this: cp = N@CirclePoints[18]; p1 = Append[#, -0.5] & /@ cp; p2 = Append[#, 0.5] & /@ cp; p3 = 2.5 {{0, 0, 1}, {0, 0, -1}}; ConvexHullMesh[Join[p1, p2, p3]] ![enter image...
I looked at different things: how many sides, angles, area, perimeter, and many conditionally averaged quantities. But area of the PDF as well. But no analytical shape is known for it. I believe that there is something known for perimeter.
Out the top of my head: DeleteCases[data, {0, _}||{_,0}]
I think the answer is: {7, 9, 3, 7, 8, 7} num=(9^9)!; (* compute the huge number: 3 billion digits *) IntegerLength[num]-97550930 (* how many digits can we cut away on the right? *) ...
This would replace just the first occurrence of it, and is therefore very different.
Yes Mojave is supported. Version 12 is fully 64 bit and will come out soon, though exact dates are not known by me, but think months, not end of the year… In fact, I already have a prerelease version for testing that is fully 64 bit.
Thanks for clarifying. Looks quite a nice project! not sure if this can be sped up a lot? Primality testing is—i guess—been highly optimized in Mathematica, so going to C or so would probably not help… What about right-truncatable primes? if you...