| Title | Finding the Smallest Divisor of a Positive Number |
| Catalog Type | SLCItem |
| Persistent ID | https://acos.cs.vt.edu/html/acos-pcex/acos-pcex-examples/while_loops_divisor__68bdb308f6cc3d7a9cc0969f |
| Platform Name | PCEX |
| Features | — |
| Description | Construct a program that finds the smallest divisor (other than 1) of a positive number. For example, the smallest divisor of 4 is 2. |
| Keywords | while loop |
| Author | Mohammad Hassany |
| Institution | University of Pittsburgh |
| Iframe URL | https://acos.cs.vt.edu/html/acos-pcex/acos-pcex-examples/while_loops_divisor__68bdb308f6cc3d7a9cc0969f |
| Protocol | SPLICE, HTML, PITT |
| Protocol URL | |
| License | MIT |
| Programming Language | Java |
| Natural Language | en |