Enter an integer n, find all the prime numbers between 0 and n, and from these prime numbers, find a set of solutions that sum to n and have the largest prime number. If you enter a prime number, the answer is the prime number itself
-
Notifications
You must be signed in to change notification settings - Fork 0
Enter an integer n, find all the prime numbers between 0 and n, and from these prime numbers, find a set of solutions that sum to n and have the largest prime number. If you enter a prime number, the answer is the prime number itself
MarvinZhong/AddingPrimeNumbers
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Enter an integer n, find all the prime numbers between 0 and n, and from these prime numbers, find a set of solutions that sum to n and have the largest prime number. If you enter a prime number, the answer is the prime number itself
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published