Some time ago i posted a question about the CP couldn?t solve the sum(1/x^2) with more than 250 steps, and take a long time to solve it with 250 steps or less. But if i write sum(x, 1, 100000) or even more, the CP calculates it and very fast.
Can somebody explain this ?
regards
fiberoptik
Once Again The Sum() Function
Started by
fiberoptik
, Feb 24 2005 12:20 AM
2 replies to this topic
#1
fiberoptik
-
- Members
-
- 70 posts
Casio Addict
-
Calculators:
ClassPad 300, FX-850P, FX-7700G, Voyage 200
Posted 24 February 2005 - 12:20 AM
#2
Lovecasio
-
- Members
-
- 242 posts
Casio Freak
- Location:Hochiminh city Vietnam
- Interests:Organic chemistry.<br />Pharmacy
-
Calculators:
fx 570 MS, Casio AFX 2.0+, ClassPad 300
Posted 24 February 2005 - 05:52 AM
Hi. 
If your function is sum(x,1,n), in fact the ClassPad just calculate n(n+1)/2. I think it first check the type of your input function, and if it "realize" the pre-programed type, it will solve it very fast ( just calculate some simple things). If the function is strange, it will add the sum step by step, and you know, all internal calculations are "Algebra type", I mean it will return exact value. So, it would take considerable time.
Oh? How about the result on OS 2.0?
If your function is sum(x,1,n), in fact the ClassPad just calculate n(n+1)/2. I think it first check the type of your input function, and if it "realize" the pre-programed type, it will solve it very fast ( just calculate some simple things). If the function is strange, it will add the sum step by step, and you know, all internal calculations are "Algebra type", I mean it will return exact value. So, it would take considerable time.
Oh? How about the result on OS 2.0?
#3
Guest_Guest_*
Guest_Guest_*
-
- Guests
Posted 24 February 2005 - 02:59 PM
The result in OS 2.00 was exactly the same as in OS 1.24
We must wait for another OS release...
regards
fiberoptik
We must wait for another OS release...
regards
fiberoptik
0 user(s) are reading this topic
0 members, 0 guests, 0 anonymous users
