I have a 2500 digit integer which I need to determine the primality of. There are many methods in R for testing primality of 'small' numbers but the language doesn't seem to be suited for storing massive numbers. There are packages designed to store such numbers but they all seem to revolve around saving it in a string which makes me uncertain of how I could then perform a primality test on it. Any clarification on what the capabilities of the language are with regards to this topic would be appreciated.
How would I go about testing the primality of a large integer in R?
199 Views Asked by Tim Hargreaves At
1
There are 1 best solutions below
Related Questions in R
- in R, recovering strings that have been converted to factors with factor()
- How to reinstall pandoc after removing .cabal?
- How do I code a Mixed effects model for abalone growth in Aquaculture nutrition with nested individuals
- How to save t.test result in R to a txt file?
- how to call function from library in formula with R type provider
- geom_bar define border color with different fill colors
- Different outcome using model.matrix for a function in R
- Creating a combination data.table in R
- Force specific interactions in Package 'earth' in R
- Output from recursive function R
- Extract series of observations from dataframe for complete sets of data
- Retrieve path of supplementary data file of developed package
- r package development - own function not visible for opencpu
- Label a dataset according to bins of a histogram
- multiply each columns of a matrix by a vector
Related Questions in PRIMALITY-TEST
- Lisp - prime number
- How would I go about testing the primality of a large integer in R?
- What is the best algorithm to determine if N is a prime number (if N is [2 <= N <= 2^63-1])?
- Converting isPrime() Python to Haskell
- Why does my primality test stop after 1 and not seem to be able to go on?
- Generating large prime numbers in python
- Check if a number is prime without sieve
- Suitable Language for RSA implementation
- 128 bit Miller Rabin Primality test
- Primality test for numbers of form 10^n + k
- I am trying to write a function in Python encapsulating the Miller-Rabin primality test, but it is very slow
- primality test function is_prime (n, k) based on Fermat Little Theorem,
- Fermat's primality test
- isPrime function with TLA+
- Dual Variable Solutions from Primal in Cplex
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Look up the Lucas-Lehmer Test for checking primality of huge numbers... it is already in the numbers library as the mersenne function and you can view it with the getAnywhere function.
library(numbers); getAnywhere(mersenne)I recommend Haskell or Cython to squeeze some extra speed out of this if you actually plan to run it on a number that large - you will want it running in C/C++ and NOT in R, hopefully this lets you read some interesting R code though.
https://cran.r-project.org/web/packages/numbers/numbers.pdf