Alternating Binary Number Triangle Pattern in Python

Beginner

⏱️ 8 min read

📚 Updated: Aug 2026

🎯 3 Code Examples

🚀 Live Preview

Modulo Operator

Alternating binary number triangle output (1, 01, 101, 0101, 10101) in Python programming

Overview

What You’ll Learn

The alternating binary number triangle combines nested loops with the modulo operator to print 0 and 1 in an alternating sequence. This tutorial covers the shape rule, loop structure, a live preview, algorithm steps, worked Python examples, edge cases, and complexity.

Shape Rule

j % 2 alternates 0 and 1

Row 1 prints 1, row 2 prints 01, row 3 prints 101, and so on as width grows.

Outer Loop

Rows

for i in range(1, rows + 1) makes each new row one digit longer than the previous.

Inner Loop

i..1 descending

for j in range(i, 0, -1) prints j % 2 while counting down, creating the alternating binary row.

print end= vs print()

Same line / next line

Binary digits use print(j % 2, end=""); end each row with print().

Live Preview

1–20 rows

Pick a row count and draw the alternating binary triangle instantly in the browser.

O(n²)

Complexity

Total digit prints still = n(n+1)/2; extra memory stays O(1).

Introduction

An alternating binary number triangle grows each row by one digit while alternating between 0 and 1 using the modulo operator. With rows = 5, the output is 1, 01, 101, 0101, 10101.

In Python you solve it with an ascending outer loop and a descending inner loop: for j in range(i, 0, -1) prints j % 2, then print() ends each row.

Why it matters?

It is a fun way to practice parity and nested loops before more complex logic-heavy patterns.

Key Highlights

Modulo Alternation

j % 2 yields 0 for even j, 1 for odd j.

Descending Inner Loop

j = i down to 1 sets digit order on each row.

Print Then Break

print(j % 2, end="") in the inner loop; print() after.

Series Foundation

Follow Program 14; continue to Program 16 (ascending inner loop).

In short: for each row i from 1 to rows, print j % 2 for j from i down to 1, then call print().

Foundation

📝 Problem & Approach

Given a positive integer rows, print an alternating binary number triangle: row i has i digits from j % 2 as j counts down from i to 1.

Python

# rows = 5 (conceptual shape)
# 1
# 01
# 101
# 0101
# 10101
for i in range(1, rows + 1):
    for j in range(i, 0, -1):
        print(j % 2, end="")   # binary digit from parity
    print()                    # next row

Inputs & Outputs

Item	Type	Description
`rows`	int	Number of triangle lines to print (typically ≥ 1).
Printed output	text	Each row has `i` alternating binary digits from `j % 2`.

Minimal workflow

Pseudocode

for i from 1 to rows:
    for j from i down to 1:
        print j % 2 (no newline)
    print newline

Approach comparison

Approach	Idea	Best for
Descending inner + `j % 2`	1, 01, 101, …	Learning and interviews
Flip with `1 - (j % 2)`	Start rows with 0 instead of 1	Parity inversion variant

Cheat Sheet

⚡ Quick Reference

Goal	Pattern
Walk each row	`for i in range(1, rows + 1):`
Print binary digit	`for j in range(i, 0, -1): print(j % 2, end="")`
End the row	`print()`
Flip parity	`print(1 - (j % 2), end="")`
Program 16 variant	`for j in range(1, i + 1): print(j % 2, end="")` (ascending inner)
Row + column parity	`print((i + j) % 2, end="")`

Compare

📋 j % 2 vs Flip vs Ascending Inner

Same binary triangle family — different ways to emit 0 and 1.

j % 2

parity

Even j → 0, odd j → 1

1 - (j % 2)

flipped

Inverts every digit — row 1 starts with 0

j down to 1

desc inner

This page — produces 1, 01, 101, …

Learning tip

% 2 first

Master j % 2 before row+column parity

Context

When This Pattern Shows Up

Reach for this pattern when teaching the modulo operator inside nested loops.

First lab exercise
Most Python pattern series start here before pyramids and diamonds.
Nested-loop warm-up
Outer/inner bound practice with an immediate visual check.
Console I/O practice
Combine loops with input() for a flexible row count.
Gateway to variants
Compare Program 14 (odd-length rows) and Program 16 (ascending inner loop) next.
Not a UI layout tool
This is a console teaching pattern — not how you build modern app screens.

Key benefit: one small program that locks in nested loops, output sequencing, and O(n²) thinking.

Interactive

🔮 Live Preview

Choose a row count between 1 and 20 and draw the alternating binary triangle in the browser.

Hands-On

Examples Gallery

Three complete Python programs — fixed rows, a flip variant, and a user-input version. Click View Output to reveal sample console results.

📚 Getting Started

Print five rows of the alternating binary triangle with j % 2.

Example 1 — Fixed `rows = 5`

Hard-coded height — ideal for first demos and screenshots.

Python

rows = 5

for i in range(1, rows + 1):
    for j in range(i, 0, -1):
        print(j % 2, end="")
    print()

How It Works

When i = 1, the inner loop prints 1 % 2 = 1. When i = 3, it prints 3%2=1, 2%2=0, 1%2=1 as 101, and so on as row width grows. print() after the inner loop starts the next row.

📈 Flip Variant

Invert parity so the first row starts with 0 instead of 1.

Example 2 — Flip with `1 - (j % 2)`

Start each row with 0 instead of 1 by inverting the parity output.

Python

rows = 5

for i in range(1, rows + 1):
    for j in range(i, 0, -1):
        print(1 - (j % 2), end="")
    print()

How It Works

1 - (j % 2) flips every digit: where j % 2 was 1 it prints 0, and vice versa. Row 1 becomes 0 instead of 1.

⚡ User Input

Read the row count at runtime and scale the binary triangle.

Example 3 — User Input Version

Read rows with input() and int() (wrap in try/except ValueError in real apps) and apply the same j % 2 logic.

Python

rows = int(input("Enter the number of rows: "))

for i in range(1, rows + 1):
    for j in range(i, 0, -1):
        print(j % 2, end="")
    print()

How It Works

Same nested-loop core as Example 1; only the source of rows changes. Non-numeric input raises ValueError with bare int(input()) — use try/except for safer labs.

🧠 How the Algorithm Prints Rows

Set up

print is built in; use input() when reading input. Set rows (fixed or from input).

Setup

Outer loop (row length)

for i in range(1, rows + 1): makes each row one digit longer than the previous.

Row

Inner loop (modulo)

for j in range(i, 0, -1): prints j % 2 with print(j % 2, end="") to alternate 0 and 1.

Binary

New line

print() ends the row so the next outer iteration starts fresh.

Break

Binary triangle complete

Total digit prints: 1+2+…+n = n(n+1)/2 — O(n²) time, O(1) extra memory.

Trace

🔎 Worked Walkthrough — `rows = 4`

Trace each outer-loop value of i and note the j % 2 values printed on each row.

`i`	Inner `j` order	`j % 2` values	Printed row
`1`	`1`	`1`	`1`
`2`	`2, 1`	`0, 1`	`01`
`3`	`3, 2, 1`	`1, 0, 1`	`101`
`4`	`4, 3, 2, 1`	`0, 1, 0, 1`	`0101`

Total digit prints: 1 + 2 + 3 + 4 = 10 = 4×5/2.

Use Cases

Where this tiny pattern (and its loop structure) shows up beyond the homework prompt.

1. Teaching Nested Loops

Clearest visual proof that outer and inner bounds interact.

Example: change j <= i and watch the shape change.

2. Pattern Series Base

Foundation for inverted, pyramid, diamond, and hollow variants.

Example: use (i + j) % 2 for row+column parity grids.

3. Console Formatting Drills

Practice print(..., end="") vs row newline without complex math.

Example: put print() inside the inner loop by mistake.

4. Character Substitution

Swap digits for letters, stars, or spaced output once the loop works.

Example: use print(j % 2, end=" ") for spaced digits on each row.

5. Complexity Intuition

Triangular totals make O(n²) concrete for beginners.

Example: count printed digits for n = 10 still → 55.

6. Input Validation Labs

Pair the pattern with try/except ValueError around int(input()) and positive-row checks.

Example: reject rows <= 0 and re-prompt.

Pro Tip: when an interviewer asks for patterns, explain the outer/inner roles first — then write the loops. The story matters as much as the code.

Advantages

Why this pattern earns a permanent spot in beginner Python courses.

1. Instant Visual Feedback
Wrong bounds show up immediately as a broken staircase.
2. Minimal Concepts
Only loops and console output — no arrays or math libraries.
3. Easy to Extend
Invert, center, hollow, or change the fill character with small edits.
4. O(1) Extra Memory
Streaming output needs no storage beyond loop counters.

Pro Tip: learn j % 2 first; compare with 1 - (j % 2) to flip every digit on each row.

Usage Tips

Small habits that keep number-pattern code clean.

1. Name Bounds Clearly
Use rows (or n) and keep i/j for row/column — or rename to row/col.
2. Prefer try/except ValueError
Wrap int(input()) in try/except ValueError so bad input does not leave rows unset.
3. Keep print() Outside
Only call print() after the inner loop finishes the row.
4. Trace j % 2 on Paper
Write the j values and their modulo before coding — catches direction mistakes early.
5. Dry-Run One Small n
Trace rows = 5 on paper before coding larger demos.

Pro Tip: if the output is a vertical list of single digits per line, you almost certainly put print() inside the inner loop.

Common Pitfalls

Mistakes that commonly break alternating binary number patterns.

1. Newline Inside the Inner Loop
Each digit lands on its own line — you get a column, not a triangle.
→ Use print(j % 2, end="") for binary digits; print() only after the inner loop.
2. Wrong Inner Direction
Counting j up instead of down changes row ordering (see Program 16).
→ For this shape, keep for j in range(i, 0, -1).
3. Forgetting the Row Break
Omitting print() glues every digit onto one endless line.
→ Always end the row after the inner loop.
4. Blind int(input())
Letters or empty input raise ValueError with bare int(input()).
→ Catch ValueError and re-prompt on failure.
5. Off-by-One on 0-Based Loops
Switching to a 0-based outer loop without adjusting the stop value can drop the last row or print an empty first row.
→ Prefer range(1, rows + 1) with range(i, 0, -1) for the digits.

Edge Cases

Check these inputs before calling the solution done.

rows = 1

Single digit

Output is just 1 on one line.

rows = 0

Empty pattern

Outer loop never runs — print nothing or show a message.

Negative

`rows < 0`

Treat as invalid; re-prompt instead of silent empty output.

Large n

Many rows

Output grows as n²/2 characters — fine for labs, noisy for huge n.

Bad input

Non-numeric input

int(input()) raises ValueError — validate with try/except first.

Fill char

Forgot modulo

print(j, end="") prints 1,2,3… — use print(j % 2, end="") for binary output.

Drill

🎯 Practice Problems

Try these variations to lock in the pattern.

1. Odd-length descending triangle

Outer loop range(..., -2) for odd widths only
Continue with Program 14

2. Ascending inner binary triangle

Inner loop range(1, i + 1) instead of down
Continue with Program 16

3. Flip parity

Use 1 - (j % 2) so row 1 starts with 0
Compare output with Example 2

4. Spaced binary output

Use print(j % 2, end=" ") between digits
Harder follow-up after this page

Important

Notes

Triangular sum. Digit prints for rows 1+2+3+…+n still grow as O(n²) for n rows.
print(j % 2, end="") stays on the line; print() advances — mix them carefully.
Validate rows > 0 for interactive programs; rows = 1 should print a single 1.
This page is left-aligned. Centered pyramids need leading spaces — covered later in the series.

Quick Takeaway: outer loop grows row length, inner loop prints j % 2 descending, then break the line.

Analysis

⏱️ Time and Space Complexity

Program	Time	Extra space
Nested loops (Examples 1–2)	`O(rows²)`	`O(1)`
User input (Example 3)	`O(rows²)`	`O(1)`

Wrap Up

🎉 Conclusion

The alternating binary number triangle is a compact lesson in modulo inside nested loops. Master the j % 2 version, then try the flip variant with 1 - (j % 2).

Practice the three examples above, then continue to Program 16 for the ascending-inner-loop binary triangle.

Use j % 2 for alternating 0/1 — keep print for digits and print() for the break, and validate row counts when reading input.

View Examples Gallery Continue to Program 16

Pro Tips

💡 Best Practices

✅ Do

Explain j % 2 before coding descending inner loop
Use print(j % 2, end="") for digits and print() after each row
Validate rows ≥ 1 for interactive programs
Wrap int(input()) in try/except ValueError before using rows
State O(n²) time when asked about complexity

❌ Don’t

Call print() inside the inner digit loop
Print j directly instead of j % 2
Count j up when you meant this page’s descending inner loop
Skip the newline after each row
Ignore bad console input in user-facing demos
Skip the rows = 1 edge case

Summary

Key Takeaways

Knowledge Unlocked

Five things to remember about this binary pattern

Print the pattern the beginner-friendly way.

Core concepts

△ 01

Rule

j % 2 alternates 0 and 1

Definition

↻ 02

Outer loop

Grows row length each line

Code

% 03

Modulo

j % 2 picks digit

Logic

↵ 04

Newline

Ends each row

I/O

O 05

Complexity

O(n²) time

Analysis

❓ Frequently Asked Questions

Why does j % 2 print only 0 or 1?

Modulo 2 returns the remainder after dividing by 2. Any integer is either even (remainder 0) or odd (remainder 1).

Why does the second row print 01?

On row 2, the inner loop prints j = 2 then j = 1. That becomes 2 % 2 = 0 then 1 % 2 = 1, so the row is 01.

What is the difference between print with end= and print()?

print(j % 2, end="") stays on the same line. print() ends the current line. Binary digits use end=""; the row break uses print() after the inner loop.

Why does row 3 print 101?

Row 3 prints j = 3, 2, 1 and j % 2 becomes 1, 0, 1 — concatenated as 101.

How is this different from Program 16?

Program 15 counts the inner loop down (range(i, 0, -1)) producing 1, 01, 101, 0101, 10101. Program 16 counts up (range(1, i + 1)) producing 1, 10, 101, 1010, 10101.

Can I start each row with 0 instead of 1?

Yes. Print 1 - (j % 2) instead of j % 2 to flip every digit — first row becomes 0 instead of 1.

What is the time complexity?

O(n²) where n is the number of rows. Total digit prints equal n+(n-1)+…+1 = n(n+1)/2.

How should I read the row count safely?

Use a try/except ValueError around int(input()) or check the raw string with .isdigit() before converting so bad input does not crash the script.

What happens if rows is 0 or negative?

The outer loop never runs, so nothing is printed. Validate and prompt again if you want a clear user message.

Did you Know? 🔊

Each row prints alternating 0 and 1 using j % 2. The inner loop counts down with range(i, 0, -1), so row length grows each line — still O(n²) total prints.

Continue to Program 16

Move on to the column-wise alternating binary pattern in the Python number-pattern series.

Program 16 tutorial →

About the author

Mari Selvan M P 🔗

Developer, cloud engineer, and technical writer

Experience 12 years building web and cloud systems
Focus Full Stack Development, AWS, and Developer Education

I write practical tutorials so students and working developers can learn by doing—from databases and APIs to deployment on AWS.

AWS Certified Developer – Associate (Credly)

12 people found this page helpful

Python Number Pattern 14 — Odd-Length Descending Number Triangle Python Number Pattern 16 — Column-Wise Alternating Binary

Alternating Binary Number Triangle Pattern in Python

What You’ll Learn

Shape Rule

Outer Loop

Inner Loop

print end= vs print()

Live Preview

O(n²)

Introduction

Why it matters?

Modulo Alternation

Descending Inner Loop

Print Then Break

Series Foundation

📝 Problem & Approach

Inputs & Outputs

Minimal workflow

Approach comparison

⚡ Quick Reference

📋 j % 2 vs Flip vs Ascending Inner

When This Pattern Shows Up

First lab exercise

Nested-loop warm-up

Console I/O practice

Gateway to variants

Not a UI layout tool

🔮 Live Preview

Examples Gallery

📚 Getting Started

Example 1 — Fixed rows = 5

How It Works

📈 Flip Variant

Example 2 — Flip with 1 - (j % 2)

How It Works

⚡ User Input

Example 3 — User Input Version

How It Works

🧠 How the Algorithm Prints Rows

Set up

Outer loop (row length)

Inner loop (modulo)

New line

Binary triangle complete

🔎 Worked Walkthrough — rows = 4

Use Cases

1. Teaching Nested Loops

2. Pattern Series Base

3. Console Formatting Drills

4. Character Substitution

5. Complexity Intuition

6. Input Validation Labs

Advantages

1. Instant Visual Feedback

2. Minimal Concepts

3. Easy to Extend

4. O(1) Extra Memory

Usage Tips

1. Name Bounds Clearly

2. Prefer try/except ValueError

3. Keep print() Outside

4. Trace j % 2 on Paper

5. Dry-Run One Small n

Common Pitfalls

1. Newline Inside the Inner Loop

2. Wrong Inner Direction

3. Forgetting the Row Break

4. Blind int(input())

5. Off-by-One on 0-Based Loops

Edge Cases

Single digit

Empty pattern

rows < 0

Many rows

Non-numeric input

Forgot modulo

🎯 Practice Problems

1. Odd-length descending triangle

2. Ascending inner binary triangle

3. Flip parity

4. Spaced binary output

Example 1 — Fixed `rows = 5`

Example 2 — Flip with `1 - (j % 2)`

🔎 Worked Walkthrough — `rows = 4`

2. Prefer `try/except ValueError`

`rows < 0`