I am running a code that loops through some 500 cases, each one considered separate, each working with a matrix of rationals 100x30 to 5000x900 or possibly larger dimensions. The matrices are not preserved and variables are reused. A concerning pattern emerges as more and more memory is slowly added until all ram (32GB) is spent and this makes no sense. Observing kernelopts(heaps); the number of entries increases steadily. Using gc() a few entries will occasionally disappear, but gc() itself takes longer with each loop.

What can I use to manage this condition?
Also why is there an increasing number of "Thread-Local" entries among the heaps?

I need to modify only one entry in a .m file (which happens to be table entry). How do I do this?

Is this valid:

Int(sqrt(x^2+sqrt(x^4+1))/(x+1)/sqrt(x^4+1),x=0..infinity) =
(1/8)*ln((52+36*2^(1/2))*(2+2*2^(1/2))^(1/2)+80*2^(1/2)+113)*(2+2*2^(1/2))^(1/2);

?

Chrome autofills my "Search Questions:" field on https://www.mapleprimes.com/questions/. Does anyone know a prompt way to correct this?

Why is this sum form for tan(x) not reported by FunctionAdvisor?
(sum = ''sum'')(-2/(2*Pi*n+Pi+2*x)-2/(-2*Pi*n-Pi+2*x), n = 0 .. infinity);
FunctionAdvisor(tan);