On page 99 of Dr. Euler's Fabulous Formula, Nahin says that:

int(int(`f`(s), s = 0 .. t), t = 0 .. x) = int(`f`(s)*(x-s), s = 0 .. x)

is true and I believe it, but I can't get Maple to confirm it.  How can I get Maple to agree with Nahin?  Are there assumptions that will make it happen?

 

This is from Introduction To Maple by Andre Heck page 63, exercise 4(b): "with(numtheory); ... Find the prime number that is closest to 9876543210123456789." Here is a solution that does not use numtheory: View 4937_IntroductionToMaplePage63Exercise4b.mw on MapleNet or Download 4937_IntroductionToMaplePage63Exercise4b.mw
View file details

This is from Introduction To Maple by Andre Heck page 63, exercise 3(c): Use Maple to "fator the polynomial x^8+x^6+10*x^4+10*x^3+8*x^2+2*x+8 modulo 13". I think that my problem is that I don't know what it means to factor a polynomial modulo and integer.

On page 121 of the 2007 edition of the Maple 11 Introductory Programming Guide in section 3.6 Exercises, problem 3, it says: "... Find the inverse of (a*b)/c+((a-d)/(b*e))*I) in standard form, where a, b, c, d and e are real." Here is my failed attempt: View 4937_Problem_3.mw on MapleNet or Download 4937_Problem_3.mw
View file details TIA

I am reading Dr. Euler's Fabulous Formula by Nahin. I'm trying to reproduce the graphs that Nahin shows on page 88 using Maple 11. Nahin is a Matlab man. Here is a Maple file that doesn't work: 4937_Page 87F.mw