imprime

The <input type="hidden" name="__VIEWSTATE" id="__VIEWSTATE" of the page contains text, ordering the letter by their frequency we obtain the reverse of the lexicographic order, so there is some pattern there.

Ordering by frequencies, j code where u is the hidden text (~. u) /: +/"1 (~. u) I."(0 1) u

zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA=9876543210/+

The text asfasfasdfasfdasdfasfasfasfsadffffffffffffffffffffasdfsfsafsfdwfgasdgbdfbgdsgasdgdsbdb

could be a base seven number (and seven letters) that could be used to generate some permutation or pattern to reveal the hidden message. Trying the permutations with A. in J don't give good results so the seven letters could mean some kind of cut to the text to determine fragments. Just some ideas.

  I don't like being downvoted so this user will be removed (by changing the password to be a random password)

To prove that you divide both sides by x and take the limit for x -> inf, applying L'Hopital rule the limit is zero, so there is such a C, any number greater than zero. The existence of such X is just the definition of limit when x tends to inf.

Another way, just using a cas (like maxima) to compute such limit: (%i1) limit( (log(x^2 + 1) + sqrt(x) + x/exp(sqrt(4*x + 3)))/x,x,inf); the result is zero.

Prime numbers, in their spirit, are like decomposing a problem into independent smaller problems. It is a search for a divide and conquer algorithm. So when people learn how to decompose and put together new problems there is a source for new knowledge. One of the most trivial examples is how if you can factorize a polynomial into factors you have a simple way to solve for the roots of that polynomial by solving the smaller problem of finding the roots of the factors and the union of all roots is the root of the initial polynomial. In that example the three parts: decompose, solve subproblems and finally compose the final solution are clearly exposed.

Nowadays we are wondering if LLM are going to be the next prime numbers. The question is if solving the language problem is going to provide us the key for solving the AGI problem. We still don't know what is the equivalent of a prime for a LLM, that is the smaller independent part that allow it to express some knowledge, the pieces could be embeddings or the topology of the layers or some new insight.

Some more random ideas, just like Norvig see python as a more practical Lisp, the basic ideas from prime numbers impregnate a great part of mathematics. You can be really far from the root but the principles are always with you, primes are a second nature, you have internalized all their properties and dynamically you learn to see primes like features in many fields (prime ideals, spectrum of a ring, points in commutative algebra).

The problem of how many primes (in relation to positive integers) is like wondering whether a given decomposition exists in a general sense that could allow us to solve the general problem. So few primes implies that the theory could solve some kind of problems but not many. What are LLMs number?, that is the question if solving the language problem will allow us to solve some very general problems, like a good approximation to AGI. The problem of whether LLMS will open the way to AGI could be the next Riemann hypothesis once we succeed in defining what is a prime number in relation to a LLM.

We are trying to prove escalating laws for how LLM improve when increasing the number of parameters, this is like trying to guess the convergence of an infinite serie by using a finite sum. The analogous of a Riemann hypothesis could be defining certain kind of LLM and conjecturing if it could obtain AGI pass some threshold for the number of parameters.

Edited: Sorry for being overly verbose this mornig!