Karnauh method calculation for Турнир based on the last 20 draws: Field 1: 1 of 3 numbers are due (N ≤ 0): 2 (N=-0.89). Field 2: 1 of 3 numbers are due (N ≤ 0): 2 (N=-0.33). Field 3: 2 of 3 numbers are due (N ≤ 0): 2 (N=-2), 1 (N=-0.62). Field 4: 2 of 3 numbers are due (N ≤ 0): 1 (N=-1), 2 (N=-0.33). Field 5: 2 of 3 numbers are due (N ≤ 0): 1 (N=-5.75), 2 (N=-0.89). Field 6: 1 of 3 numbers are due (N ≤ 0): 1 (N=-2.87). Field 7: 2 of 3 numbers are due (N ≤ 0): 0 (N=-3.33), 2 (N=-0.18). Field 8: 1 of 3 numbers are due (N ≤ 0): 1 (N=-2.2). Field 9: 1 of 3 numbers are due (N ≤ 0): 1 (N=-0.62). Field 10: 1 of 3 numbers are due (N ≤ 0): 2 (N=-2.2). Field 11: 2 of 3 numbers are due (N ≤ 0): 0 (N=-5.67), 1 (N=-0.18). Field 12: 1 of 3 numbers are due (N ≤ 0): 1 (N=-13).Data includes draw #038731 of 10.07.2026.
The method was described by Pyotr Karnauh in his book “Secrets of Number Lotteries”. The formula combines the Bernoulli scheme with Markov’s theorem on the most probable number of successes: a number’s frequency and the draw of its last hit yield an estimate of the draw in which it should appear again. N shows how many draws remain until that point.
N = ((m + 2) · (n + 1) / (m + 1)) − 1 − k − 1
Calculated over the selected period of draws:
- m — how many times the number was drawn during the period;
- n — the draw number of its last hit (counted from the start of the period);
- k — total draws in the period;
- N — the offset of the estimated hit relative to the latest draw: N = 0 — the very next draw, N < 0 — the estimated hit is already overdue.
N is a statistical estimate, not a guarantee: every draw is independent, and a “ripe” number is not obliged to come up. As a selection system, though, the method works: the table gives you a consistent rule for picking numbers instead of guessing. Clicking a number in the table adds it to the combination generator.
How to read the N values
Next-draw candidate
The estimated hit is the very next draw. These are the numbers the Karnauh method suggests putting into a combination first.
Time in reserve
The estimated hit is still N steps away: the number was drawn recently or comes up often, so the formula pushes its next appearance further out.
Overdue number
The estimated hit is already |N| steps behind — in the method’s logic the number is “ripe”. Statistically every draw is independent: being overdue does not raise the odds; it is a selection rule, not a forecast.
Where to next
Hit intervals
A free map of overdue numbers for Турнир: each number’s gap versus its typical interval.
OpenNumber frequency
How many times each Турнир number has been drawn — the m value in the Karnauh formula.
OpenRepeat hits
How many draws it usually takes Турнир numbers to come back — the interval histogram.
OpenKarnauh method FAQ — Турнир
What is the Karnauh method and who created it?
The method was described by Pyotr Karnauh in his book “Secrets of Number Lotteries”. It combines the Bernoulli scheme with Markov’s theorem: a number’s frequency and the draw of its last hit estimate the draw in which it should appear again. On this page the formula runs on the real Турнир archive.
How do I read the N value?
N is the offset of the estimated hit: N = 0 — the number is expected in the very next draw, N > 0 — several draws away, N < 0 — the estimated hit is already overdue. The table is sorted from overdue numbers to distant candidates.
Are overdue numbers the same as numbers that simply have not been drawn for a long time?
Not quite. The gap only counts draws since the last hit. Karnauh adds frequency to it: a frequently drawn number becomes overdue sooner than a rare one. A free estimate of overdue numbers — the gap versus the typical interval — is on the hit intervals page.
How many draws should the calculation use?
Pyotr Karnauh recommended analysing at least 33 draws. On a short window the N values jump noticeably after every draw — the picture is more stable on a period of 30–50 draws, recalculated after each new draw.
Does the Karnauh method guarantee a Турнир win?
No. Every draw is independent, and no calculation raises the probability of a combination. The method works as a selection system: it gives a rule for which numbers to put on a ticket instead of guessing. The generator on this page builds combinations from the due numbers, and the summary table compares Karnauh’s verdict with other methods.
What if there are no overdue numbers (all N > 0)?
That happens after a run of draws in which the “ripe” numbers already came up, and on short periods. Extend the analysis period or take the numbers with the smallest positive N — the nearest candidates. It also helps to check the picture against number frequency.