problem_35: Problem 35
In mrkaye97/euleR: Tidy solutions to Euler problems
Description
Usage
Arguments
Value
Description
The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.
There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.
How many circular primes are there below one million?
Usage
1
problem_35(workers = 8)
Arguments
workers
the number of workers to use for parallel computing
Value
the number of circular primes
mrkaye97/euleR documentation built on July 5, 2021, 1:44 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value
Description
The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime. There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97. How many circular primes are there below one million?
Usage
1 | problem_35(workers = 8)
|
Arguments
workers |
the number of workers to use for parallel computing |
Value
the number of circular primes
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.