# VectorPaint factor trees for seventy-two: retain repeated primes and the leaf product

Language: en
Canonical: [VectorPaint factor trees for seventy-two: retain repeated primes and the leaf product](<https://allluckly.cn/en/guides/vectorpaint-seventy-two-prime-factor-tree/>)
中文：[中文 HTML](<https://allluckly.cn/guides/vectorpaint-seventy-two-prime-factor-tree/>)
English: [English HTML](<https://allluckly.cn/en/guides/vectorpaint-seventy-two-prime-factor-tree/>)
Published: 2026-11-10T00:00:00+08:00
Modified: 2026-11-10T09:39:21+08:00
Author: Bison

Compare two decompositions through parent products and five final leaves,distinguishing internal nodes,primes and exponent notation.

English translation of the [Chinese original](<https://allluckly.cn/guides/vectorpaint-seventy-two-prime-factor-tree/>), translated on 2026-11-10. Original publication dates, attribution, code and version notes are retained.

Smaller numbers alone do not complete a factor tree. Each split preserves product and terminal leaves must be prime. Draw two decompositions of72,retaining repeated twos/threes. Verify graphics and arithmetic separately without automatic factorisation,primality testing or formula evaluation.

## Define a parent as the product of its two children

Place the root labelled 72 at the top. In an external record define every internal split as two positive integers greater than 1 whose product equals their parent. Connections signify factor decomposition, not addition, size comparisons or organisational rank. First test 6 split into 2 and 3, then return to 72; placing its digits 7 and 2 below it is not factorisation. Title this original integer practice rather than real data. [OpenStax’s factorisation explanation](<https://openstax.org/books/prealgebra-2e/pages/2-5-prime-factorization-and-the-least-common-multiple>) supplies prime and decomposition concepts; calculate this number chain independently without requiring the app to perform textbook calculator operations.

## Begin the first tree with eight and nine

Below 72 place 8 and 9, since 8 × 9 = 72. Split 8 into 2 and 4, 4 into 2 and 2, and 9 into 3 and 3. Connect every edge to its own parent. Equal 2s need separate text objects rather than one leaf shared by two parents. Leaves may end at different depths: the first 2 need not extend downward, and adding a child 1 merely to align bottoms is invalid. List all four internal splits externally before drawing, then verify that 72, 8, 4 and 9 each have exactly two children with the correct product.

## Count five leaves rather than two distinct values

Read terminal leaves from left to right: 2, 2, 2, 3, 3, giving five leaves. Do not deduplicate repeated primes as if cleaning duplicate files: retaining only 2 and 3 leaves product 6. The full product is 2 × 2 × 2 × 3 × 3 = 72, also written 2³ × 3². Exponents 3 and 2 count occurrences; this does not mean 2 × 3 + 3 × 2. Internal nodes 8, 9 and 4 must not be multiplied again. Determine whether a node has further branches before collecting it rather than multiplying every visible number.

## Check prime termination at every leaf

Both 2 and 3 have exactly two positive divisors, 1 and themselves, so those branches terminate. The number 1 is not prime and is excluded as a child under this exercise’s rule. Leaves 2, 2, 2, 9 still multiply to 72, but prime factorisation is unfinished. Check product preservation and prime leaves separately rather than merging them into one “looks right” judgment. These small values permit manual checking; a text label saying prime is no software primality test. Larger integers require another reliable method, and this drawing guarantees neither arbitrary-integer correctness nor computational performance.

## A six-and-twelve split must retain multiplicities

Keep the first tree and create a second: 72 → 6 × 12; 6 → 2 × 3; 12 → 3 × 4; 4 → 2 × 2. Its leaves may read 2, 3, 3, 2, 2, sorting to the same 2, 2, 2, 3, 3 and exponents. Compare terminal primes and multiplicities rather than matching node heights or outer silhouettes. Retain internal product checks for both trees even when final factors agree. An extra 2 would produce six leaves and product 144; changing only the exponent caption cannot conceal that extra leaf.

## Test product and termination failures separately

Save two separate incorrect controls: splitting 8 into 2 and 3 breaks product preservation, whereas leaving 9 terminal breaks prime termination. Do not give both the diagnosis “the app calculated incorrectly.” Trace the offending parent and children, repair 2 and 3 to 2 and 4 or split 9 into 3 and 3, then recollect every leaf. Correct one fault at a time and retain the wrong record, rather than changing the root to 54 to accommodate a wrong tree. Numbers are manually entered without automatic constraints; repair the associated objects and explanations instead of pretending connections enforce multiplication.

## Inspect repeated digits for overlap in output

Save the source and open a PNG. Count five leaves, then trace two edges from each parent, checking that identical leaves have not overlapped. Make superscript exponents readable rather than concatenating bases and powers into ambiguous digits. Colours may distinguish internals and leaves, but monochrome branches and explanations must also reveal the distinction. Hide unwanted temporary checks and bottom alignment guides. For lines crossing labels, adjust paths or text spacing rather than merging two genuine leaves for tidiness. Give the two trees their own titles so edges cannot appear to join across diagrams.

## Finish by checking products, primality and counts

If the root is correct but the leaf product is wrong, inspect repeated or missing leaves. If the product is correct but 9 remains terminal, inspect termination. For wrong exponents, recount leaves instead of editing only the final answer. Walk both complete trees again after repair, not only the last 4. Retain both decompositions, the five-leaf multiset, product 72, exponents and two incorrect controls, tracing every number to a node. This is a manually verifiable integer diagram, not automatic factorisation, a universal uniqueness proof or a computing-platform performance test.

## Related tutorials and sources

[VectorPaint hierarchy charts: distinguish parents, peers and collaboration](<https://allluckly.cn/en/guides/vectorpaint-hierarchy-chart/>), [VectorPaint five-row Pascal triangles: check adjacent sums and row totals](<https://allluckly.cn/en/guides/vectorpaint-five-row-pascal-adjacent-sums/>).

Checked on November 10, 2026: VectorPaint public version 1.0.8, requiring iOS / iPadOS 17.0 or later. Capability scope follows the [official App Store listing](<https://apps.apple.com/cn/app/id1587272880>) and [Apple public version lookup](<https://itunes.apple.com/lookup?id=1587272880&country=cn>). This is an original exercise to perform independently; use controls in your installed version. Manual construction and external records do not imply new automatic analysis features. No step-by-step physical-device, private-file or all-output-environment testing is claimed.