DuckieDai Quadratic Factor Finder Python Program

Using the full toolkit? Read the step-by-step Polynomial Toolkit guide for quartic, cubic, and quadratic workflows, worked examples, and a reminder to keep every root you find.

algebra · MIT License

Overview

Find an integer-binomial factorization of a quadratic expression or state when integer factoring is not available.

Owner-tested on a TI calculator
Version 1.0.0
2510 bytes
No imports

Download quadFF.py Read the source How to install

Before you run it

TI-84 Plus CE Python · No calculator OS or Python App version has been verified.
TI Connect CE .py transfer to the Python App; the owner's transfer details were not recorded
The expression is a quadratic with integer coefficients when a is nonzero.
This program searches integer-binomial factorizations; it is not a general quadratic solver.
Non-integer input uses the calculator Python input error path.

Try the DuckieDai calculator screen

Follow the program's prompts and result flow before downloading.

JavaScript is required for the optional browser simulation. Source viewing and downloading remain available without it.

Simulation boundary: This preview uses a reviewed browser adapter. It does not execute the downloaded Python and does not prove TI-Python or calculator compatibility.

Exact reviewed bytes

Source code

Download .py

View source below, copy it when JavaScript is available, or download the exact .py bytes.

"""DuckieDai Quadratic Factor Finder for TI-84 Plus CE Python."""


def duckiedai_intro(program_name, wait=True):
    title = program_name[:16]
    empty = 16 - len(title)
    left = empty // 2
    right = empty - left

    print("+----------------------+")
    print("|   " + " " * left + title + " " * right + "   |")
    print("|                      |")
    print("|       __             |")
    print("|   ___(o )>  quack!   |")
    print("|   \\ <_. )           |")
    print("|    `---'             |")
    print("|     by DuckieDai     |")
    print("| hiddenwordscanner.com|")
    print("+----------------------+")
    print("Loading...")

    if wait:
        input("Press enter to start ")
        print("\n" * 8)


def clear_screen():
    print("\n" * 8)


def factors(n):
    vals = []
    n = abs(n)

    if n == 0:
        return [0]

    for i in range(1, n + 1):
        if n % i == 0:
            vals.append(i)
            vals.append(-i)

    return vals


def run_solver():
    clear_screen()

    print("QUAD FACTOR")
    print("-----------")
    print("ax^2+bx+c")
    print("")

    a = int(input("a: "))
    b = int(input("b: "))
    c = int(input("c: "))

    if a == 0:
        clear_screen()
        print("NOT QUADRATIC")
        return

    found = False

    # Try (px + q)(rx + s)
    p_vals = factors(a)
    q_vals = factors(c)

    for p in p_vals:
        if p == 0:
            continue

        if a % p != 0:
            continue

        r = a // p

        for q in q_vals:
            if q == 0 and c != 0:
                continue

            if q == 0:
                s = 0
            else:
                if c % q != 0:
                    continue
                s = c // q

            if p * s + q * r == b:
                clear_screen()

                print("FACTORS")
                print("-------")
                print("(" + str(p) + "x"
                      + signed(q) + ")")
                print("(" + str(r) + "x"
                      + signed(s) + ")")

                found = True
                return

    clear_screen()

    print("NO INTEGER")
    print("FACTORING")
    print("")
    print("Use P4QUAD")


def signed(n):
    if n > 0:
        return "+" + str(n)
    elif n < 0:
        return str(n)
    else:
        return ""


duckiedai_intro("Quad Factor")

while True:
    run_solver()

    print("")
    again = input("Again? y/n: ")

    if again.lower() != "y":
        break


clear_screen()
print("DuckieDai says: done!")

"""DuckieDai Quadratic Factor Finder for TI-84 Plus CE Python."""
def duckiedai_intro(program_name, wait=True):
title = program_name[:16]
empty = 16 - len(title)
left = empty // 2
right = empty - left
print("+----------------------+")
print("| " + " " * left + title + " " * right + " |")
print("| |")
print("| __ |")
print("| ___(o )> quack! |")
print("| \\ <_. ) |")
print("| `---' |")
print("| by DuckieDai |")
print("| hiddenwordscanner.com|")
print("+----------------------+")
print("Loading...")
if wait:
input("Press enter to start ")
print("\n" * 8)
def clear_screen():
print("\n" * 8)
def factors(n):
vals = []
n = abs(n)
if n == 0:
return [0]
for i in range(1, n + 1):
if n % i == 0:
vals.append(i)
vals.append(-i)
return vals
def run_solver():
clear_screen()
print("QUAD FACTOR")
print("-----------")
print("ax^2+bx+c")
print("")
a = int(input("a: "))
b = int(input("b: "))
c = int(input("c: "))
if a == 0:
clear_screen()
print("NOT QUADRATIC")
return
found = False
# Try (px + q)(rx + s)
p_vals = factors(a)
q_vals = factors(c)
for p in p_vals:
if p == 0:
continue
if a % p != 0:
continue
r = a // p
for q in q_vals:
if q == 0 and c != 0:
continue
if q == 0:
s = 0
else:
if c % q != 0:
continue
s = c // q
if p * s + q * r == b:
clear_screen()
print("FACTORS")
print("-------")
print("(" + str(p) + "x"
+ signed(q) + ")")
print("(" + str(r) + "x"
+ signed(s) + ")")
found = True
return
clear_screen()
print("NO INTEGER")
print("FACTORING")
print("")
print("Use P4QUAD")
def signed(n):
if n > 0:
return "+" + str(n)
elif n < 0:
return str(n)
else:
return ""
duckiedai_intro("Quad Factor")
while True:
run_solver()
print("")
again = input("Again? y/n: ")
if again.lower() != "y":
break
clear_screen()
print("DuckieDai says: done!")

Filename: quadFF.py
Size: 2510 bytes
SHA-256: e902d813d8a241b19dcb4e1833cf59be039647eab025bff4da95fde8734ed09d

Usage

Inputs

Integer coefficients a, b, and c for ax^2 + bx + c

Outputs

Two integer-binomial factors when found
NOT QUADRATIC when a is zero
NO INTEGER FACTORING when no integer-binomial factorization is found

Units: Polynomial coefficients; no physical units.

Assumptions and limitations

Assumptions

The expression is a quadratic with integer coefficients when a is nonzero.

Constraints

This program searches integer-binomial factorizations; it is not a general quadratic solver.

Known failures

Non-integer input uses the calculator Python input error path.

Compatibility and review

Review status: Owner-tested on a TI calculator
Tested on: Owner reports personally testing this program on a TI-84 Plus CE Python calculator; the test date, OS version, and Python App version were not recorded
What happened: Owner reported pass on the calculator. The published file is the owner's tested source.
Dependencies: No imports
Suggested calculator name: QUADFF — you can give it another valid, unique name when you transfer it
Desktop test cases: Not available for this interactive-only source

This exact source auto-launches an interactive calculator session, so compatibility evidence comes from the recorded physical-device review rather than an importable desktop fixture.

Transfer and launch

Confirm that your calculator is the Python-capable model named above. This release has no verified calculator OS or Python App version; treat transfer and execution as unverified until independently tested.
Download the .py source above and verify its SHA-256 digest if your computer provides that option.
Use TI Connect CE to send the Python file to a compatible calculator. QUADFF is a suggested name; you may choose another valid, unique calculator name.
Open the Python App, select the program, and check sample inputs before relying on other results.

Read the complete installation, launch, troubleshooting, and removal guide.

Availability does not mean a teacher, school, or exam permits this program. Follow the applicable rules.

Version history

1.0.0 — current version, published 2026-10-03. Download this reviewed version

Any source change requires a new immutable version and digest. Historical downloads remain available only while their review records remain valid.

Independent compatibility resource: Hidden Word Scanner is independent and is not affiliated with or endorsed by Texas Instruments. TI product names describe compatibility only.

Action-count privacy: Successful downloads, preview starts, and preview completions increment same-origin aggregate counters. No entered values, source text, IP address, account, cookie, device identifier, or fingerprint is stored with these counts.