User Portlet
Featured Contributor
| Discussions |
|---|
| This is fairly complicated and I cannot say I follow all of it. But perhaps `LongestSubsequence` would be useful for the task at hand. It is not difficult to determine from the result whether a "near" match occurred, based on whatever criteria you... |
| Restating slightly the comment by Michael Rogers, the difference between WL and the others is not in the arithmetic but rather in the comparison for equality. |
| [An Elementary Introduction to the Wolfram Language](https://www.wolfram.com/language/elementary-introduction/3rd-ed/) is a good place to start. |
| Some functions from the WFR get migrated to the system. Not my call whether this one would. But if you want it to be made generally available, the WFR is the best place unless and until it gets adapted into the Wolfram Language. |
| No idea. I’d raise that as a new question so it has a better chance of getting answered. |
| Probably a longer time since you had to deal with me Howard (as undergrad advisor of a fair-to-middling student). I hope things are going well. I have no advice to offer but I’ll mention this issue in-house. My own headache is more commonly the... |
| It is difficult to discern what is the goal of the computations, other than that it has to do with computing integer factors of a product. Can `NSolve` of polynomials be used for this purpose? I have no reason to believe that would be a possibility.... |
| I do not know what it means to permute 3 of 4 elements. Keep one fixed? As for reversals, (1,4,3,2) is the same on a circle as (1,2,3,4)— just travel ccw from 1 instead of cw. |
| I do not think the methods changed. All that changed, to my recollection, was adding the message for cases where the computation hit ill conditioning. Results should be the same as before |
| The problem you'd face is that the modulus has ~100 million bits. So the result could be in that ballpark. Maybe not insurmountable, but it would take substantial time and memory using `PowerMod`. |