Some of my algorithm ideas to deal with advanced mathematics with cas

[yangyongkang]

The articles I recently published in the forum are all in CAS. This article is no exception, but this is a discussion of some of my ideas for using hp prime or XCAS to handle advanced math problems. The difference between advanced mathematics and elementary mathematics is that elementary mathematics is a finite order operation, while higher mathematics is an infinite number of operations, that is, limit operations. The well-known Weierstrass approximation theorem states that continuous functions on closed intervals can be uniformly approximated by algebraic polynomials. This means that the derivatives and integrals of all functions can be converted into derivatives and integrals of polynomials, so sometimes complex calculus problems can be transformed into squirrel (sum) functional operations of hp prime or XCAS. This requires the sum function to be very strong. In order to solve some of the problem of summing limit, xcas adds sum_riemann(), but I don't think it is enough, such as solving limit(sum((k)^(1/k)/n,k,1,n),n,+infinity ), riemann sum doesn't work, but if we can solve it with Stolz's theorem, enter limit(x^(1/x), x, +infinity) on hp prime to get the answer to 1 to solve the problem. If the student does not have the stolz theorem, it will be difficult to solve. Stolz solves the problem of limit(sum(f(k)/g(n),k,1,n), n,+infinity). There are also some anomalous integrals that XCAS can't seem to solve. The integrand is transformed into a polynomial sum by the Taylor expansion expansion, and then the integral of the polynomial sum is obtained. Finally, the sum is used to find the answer, such as int(ln(1- x)/x,x,0,1), XCAS cannot be solved directly, but using Taylor expansion, ln(1-x)/x=sum(x^(n-1)/n,1,infinity), int(ln(1-x)/x,x,0,1)=sum((int(x^(n-1)/n,x,0,1)|n>0),n,1,infinity)= Pi^2/6

Above we talked about expanding the function Taylor into a polynomial. Below I try to convert the polynomial into a function and see the performance of XCAS. Since XCAS did not define (2n-1)!! as all odd numbers, this forced me to redefine the expression. 1/sqrt(1+x)=Σ((((-1))(2*k-1,k,1,n))/(product(2*k,k,1,n)) ) *x^n,n,0,∞), but the left side of the equation is not on the right side of the XCAS or hp prime input equation, which means that the polynomial and function cannot be fully transformed. Enter \!\( in Wolfram mathematica 11.3)
\*UnderoverscriptBox[\(\[Sum]\), \(n = 0\), \(\[Infinity]\)]
\*FractionBox[\(
\*SuperscriptBox[\(E\), \(I\ n\ \[Pi]\)]\
\*SuperscriptBox[\(x\), \(n\)]\ \(\((
\*FractionBox[\(1\), \(2\)]\ \((\(-1\) + 2\ n)\))\)!\)\), \(
\*SqrtBox[\(\[Pi]\)]\ \(n!\)\)]\), you can get 1/Sqrt[1 + x], the answer we want.

Finally, let me say my opinion: I guess the first step of the sum of sum is to use the summation formula to find the sum and then the limit, or use sum_Riemann to solve, my opinion is that when the above two can not be solved, you can Add Stolz theorem to solve. Solving the definite integral is also the reason. The preferred method is to use the Newton Leibniz formula to find the original function. When the original function cannot be found, the Taylor formula can be used to convert into a polynomial summation.
sorry my poor english

[compsystems]

ENG(GOOGLE T.) Computational symbolic calculation algorithms are very difficult to code, I would like to have the power to help improve the GIAC core, since Bernard Parisse (BP) has done a great job and practically alone, while other symbolic calculation engines (mathematica, matlab-mupad, maple, etc) have many computer engineers and mathematicians working on the development of the nucleus, and also well paid $.

From my humble opinion, I believe that the great power that the HP company has should support the work of BP, that is, not only improve the firmware of hp-prime, but improve GIAC. since there would be mutual benefit, and not only economic, but support in the development of mathematical education.

SPN: Los algoritmos de cálculo simbólico computacional son muy difíciles de codificar, me gustaría tener el poder de ayudar a mejorar el núcleo GIAC, ya que Bernard Parisse (BP) ha hecho un gran trabajo y prácticamente solo, mientras que otros motores de cálculo simbólico (mathematica, matlab-mupad, maple, etc) tienen muchos ingenieros informáticos y matemáticos, trabajando en el desarrollo del núcleo y también bien pagados $.

Desde mi humilde opinión, creo que el gran poder que tiene la empresa HP (Hewlett packard) deberia apoyar el trabajo de BP, es decir, no solo mejorar el firmware de hp-prime, sino mejorar GIAC. ya que habría beneficio mutuo, y no solo economico, sino apoyo en el desarollo de la educacion matemática que tiene tantos problemas a nivel mundial.

[yangyongkang]

Maybe my request for cas is too high, I am very sorry. But these are my real views, and it may be difficult to achieve in the code.

[compsystems]

ENG: A CAS is an expert system only in mathematics, emulating thinking or better human reasoning in this area is difficult, but it may not be impossible.
A software is an AI (artificial intelligence), but as its word says is artificial, perhaps in the future it is an TI (true intelligence).

SPN: Un CAS es un sistema experto solo en matemáticas, emular el pensamiento o un mejor razonamiento humano en esta área es difícil, pero tal vez no sea imposible.
Un software es una AI (inteligencia artificial), pero como su palabra dice es artificial, quizás en el futuro sea un TI (verdadera inteligencia).