All projects
2017
Palindrome Telnyx
Program that determines the smallest base (greater than or equal to 2) in which the first 1000 positive decimal integers are palindromes.
View on GitHub1 stars
Overview
Program that determines the smallest base (greater than or equal to 2) in which the first 1000 positive decimal integers are palindromes. Open-source project by Oscar Rivera, published on GitHub.
Highlights
- 1 star on GitHub
- Primary language: Java
- Open source — view the code and contribute on GitHub
Built with
- Java
Discussion (0)
Log in to comment.
No comments yet. Be the first to start the conversation.