Application will select out all the prime numbers of a given input integer.
- Clone application from github: https://github.com/mwlong23/prime_sifter.git
- open in preferred browser
- Populate an array with numbers counting up to the value inputted by user, starting with 2.
- Example input: 15
- Example output: [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]
- Removes all numbers divisible by two, excepting 2.
- Example input: 15
- Example output: [2, 4, 5, 7, 9, 11, 13, 15]
- Return number of nickels if number is larger than 5 cents
- Example input: 8
- Example output: 1
- Return number of pennies if number is larger than 1 cent
- Example input: 3
- Example output: 3
There are no known bugs at this time.
If you run into any issues or have questions, ideas or concerns, or if you would like to contribute to the code, please contact meechllada@gmail.com and ldmackrell@gmail.com.
This application was developed using Ruby
Copyright (c) 2017 Mitchell Long and L. Devin MacKrell
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.