User Portlet
| Discussions |
|---|
| Here is a snippet of code I wrote to test the Fly straight damnit from the Amazing graphs 1 episode. an = 1; lst = Reap[Do[gf = GCD[an, n]; If[gf == 1, an = an + n + 1, an = an/gf]; Sow[{n, an}], {n, 2, 1000}]]; lst = ... |
| I am running code that on occasion shows this message "General: Overflow occurred in computation". It then proceedes to display "Further output of General::ovfl will be suppressed during this calculation." and carries on, however on occasion... |
| Here is my Function I use to calculate the number of trailing zeros of a Factorial, It doesn't actually calculate any factorials so is quick for very large factorials i.e. 10^100! Ntz[m_] := Total[Table[Floor[m/5^n], {n, 1,... |
| Hi Bill Thank you for this, I have managed to alter the page width and all is working fine now. |
| Thank you Gianluca that works perfectly. |
| Using For loops is frowned upon in MMa, also using Do loops, though I use Do loops if when trying to fit everything into memory fails. However, there are quite a few ways to achieve your desired result. You could just use the Sum command and forget... |
| More often than not you will need to put some limits on your variables, for example a>0, a |
| To answer your first question, if this is what you mean, try this. Clear[a, b, c]; p = Solve[{a^2 + b^2 == c^2, a > 0, b > 0, c > 0, a |
| Hi Jamie, I'm not sure what you mean by in x, y form perhaps if you were to give an example of how you need to see the output I or some one else might be able to help. |
| Neil, The values I supplied as solutions to the first few variables we found manually, I had found a full set of solutions that worked for all variables and as such I came to the conclusion that the problem is not solvable by the means available... |