I think it does explain it.

The recommended form is evalf[4](expression) and the help says:

"To specify the numeric precision for an evalf computation without
changing the value of Digits, use the optional index in the calling
sequence, that is, evalf[n](expression)."

But then the expression fsolve is treated with precision Digits = 4

Digits:=4 does not mean that 4 decimals are correct, it sets the
working precision

I think it does explain it.

The recommended form is evalf[4](expression) and the help says:

"To specify the numeric precision for an evalf computation without
changing the value of Digits, use the optional index in the calling
sequence, that is, evalf[n](expression)."

But then the expression fsolve is treated with precision Digits = 4

Digits:=4 does not mean that 4 decimals are correct, it sets the
working precision

can we have it math notations = classical sheet ?

I never would write

`ε` := 1/4;
^^       ^^
but just epsilon:= 1/4;

int(0, x=0 .. 1000) gives zero :-)

If my guessing was not the right one then you may wish to post your concrete problem

where I will never understand what is the advantage to use a space (which can be difficult to see) over a multiplication sign * (which is clearly to see)

where I will never understand what is the advantage to use a space (which can be difficult to see) over a multiplication sign * (which is clearly to see)

@Markiyan Hirnyk 

It should be correct, though I mixed up with notations, which have been used already.

Please find attached a sheet, which regards the notations used by fallen flame

rec_fct_example.mws

@Markiyan Hirnyk 

It should be correct, though I mixed up with notations, which have been used already.

Please find attached a sheet, which regards the notations used by fallen flame

rec_fct_example.mws

Sorry, seems you got me wrong - it is not a critique about you as person at all.
It was meant as suggestion to improve the presentation, nothing else.

Though I do not know about Engineering at all and can not digest that:

I have not a problem at all with this restrained kind of self-advertising :-)
But suggest, that you provide English texts as well, it would help ...


PS and a bit off topic: being a bit neurotic on privacy I wonder why your linked
page needs so much of external links, my security setting blocks 22 scripts and
all of the 5 'web 2.0' embeddings & tracking SW ...

adding to http://www.mapleprimes.com/questions/124552-Interactive-Stock-Quote-Importer#comment125747

Not sure if your problems are through a slow connection, mine is DSL
(though a lot is locked, but it should not for Maple ...).

Being not used to that *.mw I can not see the web query (but vaguely
remember, that Samir undisclosed the code, can not find it).

For the tech env: XP SP2 Win 32 on AMD 64 bit analog to TFT

When I was in that stuff it was quite convenient to use Excel (besides
changing formats on the www), easy after learning, fast and stable.
And being able to interchange with others.

Does not work for me, neither M12 nor M15. It reads data, but then

Error, (in LinearAlgebra:-Dimension) invalid input: LinearAlgebra:-Dimension 
  expects its 1st argument, A, to be of type {Matrix, Vector} 
  but received KOHistoricalClose
Error, unable to execute seq
Error, unable to execute seq
Error, unable to execute seq
Error, unable to execute seq
Error, unable to execute seq
Error, (in plots:-display) expecting plot structure but received: p1

[Edited for line break (Markiyan, you are right ...)]

For posting such a brute routine may help (using 'preformatted' = fixed font),
providing 'readable' stuff ready for copy & paste:

split_for_print:=proc(expr, len)
# expr = some Maple expression
# len  = length to split with line breaks
local L,s,tmp,j;
s:=convert(expr, string);
L:=[StringTools:-LengthSplit(s, len)];
for j from 1 to nops(L) do
  if j = nops(L) then printf("%s ;", L[-1]) 
  else printf("%s\\\n", L[j]); 
  end if;
end do:
end proc;

split_for_print(exprHirnyk, 80);

exp((ln(2)*ln(6)^2+ln(5)*ln(6)^2+ln(2)*ln(3)^2+ln(3)^2*ln(5)-ln(17)*ln(2)^2+ln(1\
7)*ln(3)^2+ln(17)*ln(5)^2+ln(17)*ln(6)^2+ln(10)*ln(5)^2+ln(10)*ln(6)^2+ln(26)*ln\
(3)^2+ln(26)*ln(6)^2+ln(37)*ln(3)^2+ln(37)*ln(5)^2+2*ln(2)^2*ln(5)+5*ln(10)*ln(2\
)^2+5*ln(26)*ln(2)^2+5*ln(37)*ln(2)^2+5*ln(2)^3+ln(5)^3-ln(2)*ln(3)*ln(5)-3*ln(3\
7)*ln(2)*ln(6)-3*ln(10)*ln(2)*ln(3)-ln(2)*ln(5)*ln(6)-3*ln(26)*ln(2)*ln(5)-2*ln(\
17)*ln(2)*ln(5)-2*ln(17)*ln(2)*ln(6)-ln(10)*ln(3)*ln(5)-ln(10)*ln(3)*ln(6)-ln(26\
)*ln(3)*ln(5)-ln(26)*ln(5)*ln(6)-ln(37)*ln(3)*ln(6)-ln(37)*ln(5)*ln(6)-2*ln(17)*\
ln(2)*ln(3))/(21*ln(2)^2-6*ln(2)*ln(3)-6*ln(2)*ln(5)-6*ln(2)*ln(6)+5*ln(3)^2-2*l\
n(3)*ln(5)-2*ln(3)*ln(6)+5*ln(5)^2-2*ln(5)*ln(6)+5*ln(6)^2))*x^(-(3*ln(2)^2+ln(5\
)^2+ln(2)*ln(3)-2*ln(2)*ln(5)+ln(2)*ln(6)+ln(3)*ln(5)+ln(5)*ln(6)-5*ln(3)*ln(10)\
-9*ln(2)*ln(17)-5*ln(5)*ln(26)-5*ln(6)*ln(37)+3*ln(2)*ln(10)+3*ln(2)*ln(26)+3*ln\
(2)*ln(37)+ln(3)*ln(17)+ln(3)*ln(26)+ln(3)*ln(37)+ln(5)*ln(17)+ln(5)*ln(10)+ln(5\
)*ln(37)+ln(6)*ln(17)+ln(6)*ln(10)+ln(6)*ln(26))/(21*ln(2)^2-6*ln(2)*ln(3)-6*ln(\
2)*ln(5)-6*ln(2)*ln(6)+5*ln(3)^2-2*ln(3)*ln(5)-2*ln(3)*ln(6)+5*ln(5)^2-2*ln(5)*l\
n(6)+5*ln(6)^2)) ;

For posting such a brute routine may help (using 'preformatted' = fixed font),
providing 'readable' stuff ready for copy & paste:

split_for_print:=proc(expr, len)
# expr = some Maple expression
# len  = length to split with line breaks
local L,s,tmp,j;
s:=convert(expr, string);
L:=[StringTools:-LengthSplit(s, len)];
for j from 1 to nops(L) do
  if j = nops(L) then printf("%s ;", L[-1]) 
  else printf("%s\\\n", L[j]); 
  end if;
end do:
end proc;

split_for_print(exprHirnyk, 80);

exp((ln(2)*ln(6)^2+ln(5)*ln(6)^2+ln(2)*ln(3)^2+ln(3)^2*ln(5)-ln(17)*ln(2)^2+ln(1\
7)*ln(3)^2+ln(17)*ln(5)^2+ln(17)*ln(6)^2+ln(10)*ln(5)^2+ln(10)*ln(6)^2+ln(26)*ln\
(3)^2+ln(26)*ln(6)^2+ln(37)*ln(3)^2+ln(37)*ln(5)^2+2*ln(2)^2*ln(5)+5*ln(10)*ln(2\
)^2+5*ln(26)*ln(2)^2+5*ln(37)*ln(2)^2+5*ln(2)^3+ln(5)^3-ln(2)*ln(3)*ln(5)-3*ln(3\
7)*ln(2)*ln(6)-3*ln(10)*ln(2)*ln(3)-ln(2)*ln(5)*ln(6)-3*ln(26)*ln(2)*ln(5)-2*ln(\
17)*ln(2)*ln(5)-2*ln(17)*ln(2)*ln(6)-ln(10)*ln(3)*ln(5)-ln(10)*ln(3)*ln(6)-ln(26\
)*ln(3)*ln(5)-ln(26)*ln(5)*ln(6)-ln(37)*ln(3)*ln(6)-ln(37)*ln(5)*ln(6)-2*ln(17)*\
ln(2)*ln(3))/(21*ln(2)^2-6*ln(2)*ln(3)-6*ln(2)*ln(5)-6*ln(2)*ln(6)+5*ln(3)^2-2*l\
n(3)*ln(5)-2*ln(3)*ln(6)+5*ln(5)^2-2*ln(5)*ln(6)+5*ln(6)^2))*x^(-(3*ln(2)^2+ln(5\
)^2+ln(2)*ln(3)-2*ln(2)*ln(5)+ln(2)*ln(6)+ln(3)*ln(5)+ln(5)*ln(6)-5*ln(3)*ln(10)\
-9*ln(2)*ln(17)-5*ln(5)*ln(26)-5*ln(6)*ln(37)+3*ln(2)*ln(10)+3*ln(2)*ln(26)+3*ln\
(2)*ln(37)+ln(3)*ln(17)+ln(3)*ln(26)+ln(3)*ln(37)+ln(5)*ln(17)+ln(5)*ln(10)+ln(5\
)*ln(37)+ln(6)*ln(17)+ln(6)*ln(10)+ln(6)*ln(26))/(21*ln(2)^2-6*ln(2)*ln(3)-6*ln(\
2)*ln(5)-6*ln(2)*ln(6)+5*ln(3)^2-2*ln(3)*ln(5)-2*ln(3)*ln(6)+5*ln(5)^2-2*ln(5)*l\
n(6)+5*ln(6)^2)) ;

Number Theory

It is decades ago, so a vague answer. And please do not take it as one to
look sooo much educated, it is just since nobody else takes the question.

The guys in Number Theory use it in arithmetics Geometry, making heavy use
of cohomology theories (plural) in translating problems. One should find
more around "Weil Conjecture" on Wikipedia. Or Serre's book on Falting's
proof (in the bookshelf, section "I should ... but later or never ...").

Never made up my mind to 'learn' it seriously, it is a tough machine ...

Being ignorant I hesitate to say more.