User Portlet
| Discussions |
|---|
| A reference implementation of a recent variant can be found in [this prior Community thread](https://community.wolfram.com/groups/-/m/t/2344199?p_p_auth=UZ0BHnEu). |
| See also: [OEIS A127824][1] : "The Collatz conjecture asserts that every positive integer occurs in some row of this triangle". And here's another student project on [generalized collatz][2]. [1]: https://oeis.org/A127824 [2]:... |
| It performs exactly as I would expect. In some cases the `test` you wish to run is very fast, so that it is faster to run that test on all the inputs and check the results after than it is to do the incremental checks needed for the short circuit. ... |
| I want to say your post inspired me. I'm going to figure out a way to do the whole thing in Javascript. |
| A back-of-the-envelope computation suggests that to get `n` digits, one requires in the ballpark of `LogIntegral[Log[10.]*10^n]` primes. For `n=10^9`, that's around 112,307,000. Quick check at 10^5. Approximate the count: In[1002]:=... |
| So, is there like a "complete code" or a "workbook" version we can play with? As opposed to attempting to assemble it ourselves from scratch? ^_^ I'd love to play with this, at some point. And can it only work with neural networks trained on a... |
| Here is the sqrt function with only one call to Sqrt: sqrt[x_] := Module[{sq = Sqrt[x]}, {sq, -sq}] It's about the same speed as two calls to Sqrt. But my real point was that if you want different behaviour from a function, go ahead and... |
| > ...the results it spits out seem to in some cases be a bit too simplified (has hoped for everything to be simplified as far as possible in the Cosine format, without necessarily evaluating to radicals, etc.), and other parts feel like they're maybe... |
| Funny, somehow, I was working on something and accidentally got it to evaluate and then hold form correctly, thus: [mcode]HoldForm[PolarPlot[{(Abs[Cos[4Pi/4]]+Abs[Cos[6Pi/4]])/((Abs[Cos[x+4Pi/4]]+Abs[Cos[x+6Pi/4]])),... |
| The questions which are practical and narrow are easier to answer. I would research online if something was done already, if there are typical algorithms and data. Then I'd start working one step at a time and ask if a specific issue is encountered.... |