Explain
Help me understand a topic that is still unclear.
35 minutes · zero magic · real mathematics
How to use AI for thinking-intensive tasks without giving up control of the reasoning.
Help me understand a topic that is still unclear.
Write code, a text, or a presentation, or solve a problem.
Find the first error, test a case, or ask a question.
Most of us find ourselves in all three situations. This is not about guilt. It is about control.
Today's claim
It does not take over your responsibility for understanding, verification, and choice.
The model predicts a token from structures learned during training. This is not random guessing, but neither is it a guarantee of understanding.
The percentages are illustrative. A model may sample an answer rather than always choosing the most likely token.
A token may be a word, part of a word, a symbol, or a fragment of code.
The split depends on the tokenizer. A token is not a “concept” in the human sense.
At each position, the model computes how strongly to connect it with each earlier position.
This is an algebraic operation, not conscious attention. The weights alone do not fully explain the answer.
`M` is the causal mask: a position cannot use future tokens.
A row describes one weighted combination of earlier values.
Multiple heads can capture different relationships in parallel.
Each layer combines contextual information and transforms the vectors representing the tokens.
There is no single drawer labelled “Pythagorean theorem.” Knowledge and procedures are distributed across many parameters and activations.
Training on token prediction changes the model's parameters.
Pretraining: L(θ) = −Σ log pθ(xt|x<t)Further training on instructions, evaluations, preferences, and verifiable signals.
Post-training still changes the parameters.While answering, the model may perform more steps, attempts, and checks.
A conversation does not usually train the model live.The system lets the model read files, run code, and analyse tool outputs.
This is an action loop around a trained model.Definitions, proofs, and code contain recurring rules.
A calculation, test, or verifier often provides an unambiguous signal.
More computation time allows several solution paths to be checked and errors to be corrected.
Python, computer algebra systems, tests, and proof checkers provide an external scratchpad.
Mathematics is a good testing ground for AI. That does not make AI consistently reliable at it.
Codex is one example. The same method can work with other AI agents.
It combines known techniques and analogies into new proposals.
It rapidly explores many variants, examples, and counterexamples.
It cannot reliably judge whether a proposal is genuinely new, important, and correct.
It has neither human experience of the problem nor responsibility for the direction of inquiry.
Intuition often means rewriting a problem so that its structure becomes visible.
0.999… := limn→∞(1 − 10−n) = 1
x = 0.999…
10x = 9.999…
9x = 9
x = 1
The finite approximations are 1 − 10−n.
As n grows, 10−n → 0.
The limit is 1.
Assume: a = b ≠ 0
a² = ab
a² − b² = ab − b²
(a − b)(a + b) = b(a − b)
a + b = b
2b = b, therefore 2 = 1
Which transition contains the first error?
Do not judge only by the absurd conclusion.(a − b)(a + b) = b(a − b)
a + b = b divide by a − b
Division by zero is not allowed.
A good audit checks each step separately and the conditions required for it, not just the final statement.
Every line looks familiar, but one violated condition destroys the entire proof.
A model may invent a source, date, or quotation that sounds perfect but does not exist.
The board has m rows and k columns. We count rectangles whose sides lie on grid lines; squares count too.
That is the number of cells, not all rectangles.
Two horizontal lines determine the top and bottom sides.
Two vertical lines determine the left and right sides.
C(m+1,2)·C(k+1,2)
Choose two of the m+1 horizontal lines and two of the k+1 vertical lines.
C(m+1,2) · C(k+1,2)- range(width)+ range(width + 1)
$ ready to run tests
n²+n+41
For n=0,1,…,39, the values are prime.for (let n = 0; ; n++) {
const value = n*n + n + 41;
if (classify(value) !== "prime") {
console.log({n, value});
break;
}
}
fc(n) = n²+n+c
fc(c−1) = (c−1)²+(c−1)+c
= c²
f41(40)=41²=1681
The value 1 is neither prime nor composite.
“Solve this.”
It defines neither the goal, the role, nor when to stop.“I am learning this topic. Do not solve the whole problem. First ask one diagnostic question. Then give one hint and wait. At the end, ask me to explain the method in my own words. Here is my attempt: …”
For every integer a.
This form leads to the Fermat test.
If nevertheless an−1 ≡ 1 (mod n), then n is a pseudoprime to base a.
$ waiting to run the test
10 | 340 and 210≡1 (mod 11); 5 | 340 and 25≡1 (mod 31). Since gcd(11,31)=1, we obtain 2340≡1 (mod 341).
nasqret.github.io/czy-ai-zastapi-nasza-glowe
The answer after 35 minutes
Delegate calculations, drafts, and tests. Keep understanding, control, and the choice of direction.
A correct answer does not establish whether a model has human intuition or experience of the world.
A new combination may be useful, but novelty, significance, and authorship require independent evaluation.
Trust is justified only where we know how to check the result and accept the cost of error.