Prime Factorization Graph

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

Let and be distinct integers such that divides . Then the vertices of a polygon with vertices can be connected to a polygon with vertices from equally spaced vertices on the first polygon. This procedure can be applied repeatedly to the prime factors of a number in order to get visualizations of the factorizations of the numbers. For instance, can be seen as a polygon of 15 vertices connected to a triangle at every fifth vertex.

Contributed by: Emmanuel Garces Medina (March 2011)
Open content licensed under CC BY-NC-SA


Snapshots


Details

detailSectionParagraph


Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send