`range()` — start, stop, step — Coding notes

WHAT it is

Formula The numbers

range(start, stop, step) produces We derive the rule, not memorise it. The $k$ -th term ( $k = 0, 1, 2, \dots$ ) is: $a_k = \text{start} + k \cdot \text{step}$ We keep producing terms while they have not reached stop:

If step > 0: include $a_k$ while $a_k < \text{stop}$ .
If step < 0: include $a_k$ while $a_k > \text{stop}$ .

Number of elements $n$ : we need the largest integer $k$ with $a_{n-1}$ still valid. Solving $\text{start} + (n-1)\cdot\text{step}$ against stop: $n = \max\!\left(0,\ \left\lceil \frac{\text{stop} - \text{start}}{\text{step}} \right\rceil\right)$

Deriving the count formula from scratch — WHY this form?

Terms are start, start+step, start+2·step, ….
We want the count of valid terms before crossing stop.
The "distance" to cover is stop - start; each step covers step. Dividing gives the number of steps that fit: (stop - start) / step.
Because stop is excluded, we round up (ceil): even a tiny leftover distance still needs one more term to reach/pass the boundary... but we stop before it, so the count is exactly that ceiling.
If the division is negative (e.g. going the wrong direction), no terms fit → max(0, …).

A handy integer-only version (no ceil): with step > 0, $n = \frac{\text{stop} - \text{start} + \text{step} - 1}{\text{step}} \quad(\text{integer floor division})$

HOW to use it

Worked example Example 1 —

range(5)

list(range(5))      # [0, 1, 2, 3, 4]

Why start = 0? Single-argument form defaults start to 0. Why this step? Because indexing in Python begins at 0, so loops align with positions.
Why no 5? stop = 5 is excluded → we get exactly 5 numbers (0..4). Why this step? The half-open rule guarantees len(range(5)) == 5, no off-by-one mental math.

Worked example Example 2 —

range(2, 9, 2)

list(range(2, 9, 2))   # [2, 4, 6, 8]

Why start at 2? Explicit start. $a_0 = 2$ .
Why does it stop at 8 not 10? $a_3 = 2 + 3\cdot2 = 8 < 9$ ✓, but $a_4 = 10 \not< 9$ ✗. Why this step? We apply $a_k < \text{stop}$ .
Check the count: $n = \lceil (9-2)/2 \rceil = \lceil 3.5 \rceil = 4$ ✓.

Worked example Example 3 — counting DOWN with

range(10, 0, -2)

list(range(10, 0, -2))  # [10, 8, 6, 4, 2]

Why does 0 not appear? stop = 0 excluded; we use $a_k > 0$ . $a_5 = 0 \not> 0$ ✗.
Why negative step? To move backwards. Why this step? With step < 0 the condition flips to $a_k > \text{stop}$ , so we descend.
Count: $n = \lceil (0-10)/(-2) \rceil = \lceil 5 \rceil = 5$ ✓.

Worked example Example 5 — empty range

list(range(5, 5))     # []
list(range(5, 1))     # []   (start > stop, positive step)

Why empty? No $a_k$ satisfies the condition. $n = \max(0, \text{negative or zero}) = 0$ .

Common mistakes

Recall Feynman: explain to a 12-year-old

Imagine a hopscotch grid. start is the square you jump on first. step is how far each hop is. stop is a wall you must not land on — you stop the moment your next hop would hit or pass the wall. So range(2, 9, 2) means: start on 2, hop 2 squares each time (2→4→6→8), and stop before the wall at 9. Python doesn't draw the whole hopscotch at once; it just tells you the next square whenever you ask. That's why it's fast even for a million squares.

Active recall

What are the three argument forms of range()?

range(stop), range(start, stop), range(start, stop, step).

In range(start, stop, step), is stop included?

No — it is excluded (half-open [start, stop)).

Default start and step in range(stop)?

start = 0, step = 1.

Formula for the k-th term of a range?

a_k = \text{start} + k\cdot\text{step}

Formula for number of elements?

n = \max(0, \lceil(\text{stop}-\text{start})/\text{step}\rceil)

Output of list(range(10, 0, -2))?

[10, 8, 6, 4, 2].

What does range(5, 5) give?

[] (empty).

What happens with step = 0?

ValueError — step must be non-zero.

Why does range(10, 0) give []?

Default step is +1, can't go up from 10 to 0.

How do you make a range that includes N?

range(start, N+1).

Can range take float arguments?

No — TypeError; integers only.

Is a range object a list?

No — it's a lazy immutable sequence (generates on demand).

Connections

for loops — range() is the most common loop driver.
Lists and list() — wrap a range to materialise it: list(range(...)).
Indexing and slicing — both use the same half-open [start, stop) convention.
Arithmetic sequences — a_k = start + k·step is a discrete arithmetic progression.
numpy.arange / linspace — the float-capable cousins of range().
enumerate() — alternative when you need index and value.

Concept Map

Hinglish (regional understanding)

Intuition Hinglish mein samjho

range() ko samajhne ka sabse easy tarika: ye ek counting machine hai jo numbers ek-ek karke deta hai. Tum bas batao start (kahan se shuru), stop (kahan rukna hai), aur step (har baar kitna jump). Sabse important baat — stop wala number kabhi included nahi hota. Jaise range(2, 9, 2) matlab 2 se shuru, 2-2 ka jump: 2, 4, 6, 8 — 9 nahi aata kyunki wo wall hai jise touch nahi karna.

Formula khud derive karo, ratna mat: k-th number hai $a_k = \text{start} + k \cdot \text{step}$ , aur jab tak step positive hai tab tak a_k < stop chalta raho. Total kitne numbers? $\lceil (\text{stop}-\text{start})/\text{step} \rceil$ . Isiliye len(range(n)) exactly n hota hai — koi off-by-one tension nahi.

Common galti: students sochte hain range(1, 10) mein 10 aayega — nahi aata! Agar N tak chahiye to range(1, N+1) likho. Aur agar ulta count karna hai (10 se 0 tak) to negative step do: range(10, 0, -2), warna empty list milti hai kyunki default step +1 hai.

Ye chhota sa topic 80/20 wala hai — har for loop mein iska use hoga, to ye solid hona chahiye. Mnemonic yaad rakho: "Start IN, Stop OUT, Step JUMP." Bas itna pakka karlo, baaki sab easy.

`range()` — start, stop, step

WHAT it is

Deriving the count formula from scratch — WHY this form?

HOW to use it

Common mistakes

Active recall

Connections

Concept Map

Hinglish (regional understanding)

Go deeper — visual, from zero

Test yourself — Introduction to Programming (Python)

Connections