Introduction

Higher mathematics and system modeling may sound abstract, but they are simply ways to describe, predict, and improve real systems — from train schedules at Bryansk’s rail junction to timber supply chains and local flood response on the Desna. This article explains the key ideas in plain language, gives small practical demonstrations you can run in a spreadsheet or simple script, and uses local analogies so the concepts stick.

Why it matters for Bryansk

— Bryansk is a regional transport and industrial hub: railway flows, timber processing, manufacturing, and riverine risks are all systems with interacting parts.
— Modeling helps answer questions like: How long will trains queue at a crossing? How much timber inventory do you need to avoid shortages? How fast will an infection spread in a small town?
— Good models can save time, money, and lives by turning intuition into numbers.

Core concepts (in plain language)

— Function: a rule that turns inputs into outputs — like a machine where you feed wood and get furniture.
— Derivative: a speedometer — it tells how fast something is changing (e.g., how fast the number of passengers on a platform is growing).
— Integral: an accumulator — it sums up small contributions over time (e.g., total water volume passing a gauge).
— Matrix: a compact table of coefficients that describes how many parts influence each other — useful for networks and multi-department interactions.
— Probability & queues: randomness matters — arrival times, service times, and delays are often stochastic.

Practical demonstration 1 — Railway crossing queue (simple, immediate insight)

Situation: A small Bryansk freight siding handles incoming trains. Trains arrive randomly at average rate λ (trains/hour). The crossing processes trains at average rate μ.

Model: M/M/1 queue (Poisson arrivals, exponential service)
— Utilization ρ = λ / μ (must be < 1 for stability)
— Average number in system L = ρ / (1 − ρ)
— Average waiting time W = L / λ = 1 / (μ − λ)

Analogy: Think of the crossing as a single cashier. If trains come faster than the cashier serves, the line grows without bound.

How to try it:
— Choose λ = 2 trains/hour, μ = 3 trains/hour → ρ = 0.67, L ≈ 2, W ≈ 1 hour.
— Vary μ (e.g., faster switching crews) to see large reductions in waiting time.

Use case in Bryansk: estimate the effect of adding a second track or faster shunting on average queue length.

Practical demonstration 2 — Timber inventory in a spreadsheet (discrete, hands-on)

Situation: A sawmill wants to avoid stockouts while minimizing stored timber.

Simple inventory model (discrete time, daily steps):
— I_{t+1} = I_t + R_t − D_t
— I_t: inventory at day t
— R_t: receipts (reorder arrivals) on day t
— D_t: demand (consumption) on day t

Reorder policy: place order of size Q when I_t ≤ s (reorder point), lead time L days.

How to set up in Excel or Google Sheets:
— Columns: Day | Demand D | Inventory start I | Receipt R | Inventory end I_next | Order placed?
— Fill a demand column with historical daily demand or a random draw around average.
— Formula examples (in words):
— I_next = I_start + R − D
— If I_next <= s and no outstanding order, set OrderPlaced = Q and schedule R on day t+L.

Analogy: A kitchen: if your flour runs low and delivery takes 3 days, you reorder at the moment you hit the last bag you’re willing to risk using.

Try it with numbers: starting inventory 100 m^3, daily avg demand 8 m^3 (σ = 2), reorder Q = 200, s = 40, lead time L = 5. Simulate 100 days and count stockouts.

Practical demonstration 3 — Simple SIR epidemic model for a small town

Situation: You want a rough idea of how a respiratory infection might spread in a Bryansk neighborhood.

Equations:
— dS/dt = −β S I
— dI/dt = β S I − γ I
— d