This is an example of a library. You may see a list of other libraries used on Rosetta Code at Category:Solutions by Library.
Go-rcu is a package which contains some commonly used utility functions written in the Go programming language.
It is designed to assist with writing Rosetta Code tasks in Go so the same code does not have to be written or copy/pasted time and time again thereby bloating a task's program code unnecessarily.
To use it all you need to do is to copy the source code (in the [talk page]) to a text file called rcu.go and then place this in a sub-directory called rcu of the directory containing the importing program.
Finally, add "rcu" to your imports so the compiler can find it.
Pages in category "Go-rcu"
The following 88 pages are in this category, out of 88 total.
- Neighbour primes
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers which are not the sum of distinct squares
- Numbers which are the cube roots of the product of their proper divisors
- Numbers which binary and ternary digit sum are prime
- Numbers whose count of divisors is prime
- Palindromic primes
- Palindromic primes in base 16
- Pandigital prime
- Pell numbers
- Permuted multiples
- Positive decimal integers with the digit 1 occurring exactly twice
- Practical numbers
- Prime numbers which contain 123
- Prime triplets
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes with digits in nondecreasing order
- Product of min and max prime factors
- Safe and Sophie Germain primes
- Sleeping Beauty problem
- Smallest multiple
- Sort primes from list to a list
- Special divisors
- Special neighbor primes
- Sphenic numbers
- Steady squares
- Substring primes
- Sum of first n cubes
- Sum of primes in odd positions is prime
- Sum of square and cube digits of an integer are primes
- Sum of the digits of n is substring of n
- Sum of two adjacent numbers are primes
- Summarize primes
- Summation of primes