| Title | Finding the Largest 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?index=1 |
| Platform Name | PCEX |
| Features | — |
| Description | Construct a program that finds the largest divisor of a positive number, excluding the number itself. For example, the largest divisor of 24 is 12. |
| Keywords | — |
| Author | Mohammad Hassany |
| Institution | University of Pittsburgh |
| Iframe URL | https://acos.cs.vt.edu/html/acos-pcex/acos-pcex-examples/while_loops_divisor__68bdb308f6cc3d7a9cc0969f?index=1 |
| Protocol | SPLICE |
| Protocol URL | |
| License | MIT |
| Programming Language | JAVA |
| Natural Language | en |