![]() ![]() So, what's happening here is that it's calculating p-th roots of unity times a number o which is exactly right to make the (p*n)th power of the root multiply by q every time n increments. I guess they must have added atan2 more recently. I searched for such a thing and never found it. I think it would be difficult for them to implement this but I would like to see what they could come up with. ![]() However, a lot of recursive function can be converted into an iterative form that can usually be solved with summations and products which desmos can handle much easier but this does take more work when trying to create them. Actual recursion has a similar issue where it becomes exponentially more complex to compute the more recursive layers there are especially when it's computing for a whole range of values in a plane simultaneously. ) like this, but it quickly reaches desmos' limit in terms of function complexity and gives up. Like this you can then iterate a function on itself ( f(f(f(f(f(z))))), etc. Then you can combine these functions together to make more complicated complex functions. Then you have to write some simple functions in terms of those, such as add, multiple, divide, log, etc.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |