If a number n can be written as axb and m=sqrt(n). Here n=m*m. We say we only need to check upto m because min(a,b)<=m. So cant we take cube roots? Suppose we take n=21, then n=1x3x7. But Cube root is 2. Why does this method fail?
Why do we only check up to the square root of a prime number to determine if it is prime? Can't we use cube root?
487 views Asked by Abhishek Agrawal At
1
There are 1 answers
Related Questions in PRIMES
- Error finding and rectification of my C code for finding prime numbers
- How to make my pyspark code for sieve of eratosthenes scalable for large range of numbers?
- Why is my Mersenne prime code faster with a larger exponent?
- Can someone explain why this is throwing a stackoverflow error? (Scala, lazylist, nth prime number)
- Benchmark for an implementation of the Miller-Rabin-Primetest
- Optimising Sieve of Erastosthenes (Finding Primes over a million w/o memory error)
- Enhancing Performance of Sorted Linked List for Truncatable Prime Numbers
- lock-free queue to count prime numbers in c performance
- Primes with exponent series
- Prime generating Python code using C.P. Willans formula
- How does the Radix-2 Montgomery multiplication algorithm R2MM work on bit level?
- Best way to find divisors of a number
- But does the Fermat Factorization algorithm work?
- Why does 2147483647 is the only Int that the code I wrote does'nt get the right feedback?
- Alignment issue when printing formatted prime numbers in J language
Related Questions in SQUARE-ROOT
- Time complexity of Python 3.8+'s integer square root `math.isqrt()` function
- Why is it quicker to calculate the reciprocal square root than to compute the square root?
- Finding integer square root of an integer hobby code... I'm not sure if it's actually efficient
- Math domain error when simplifying radicals
- Does ARM frsqrts need to be used with extra fmul instructions for a Newton iteration?
- Square root function returning number as casted integer
- How to factor out perfect squares from under the square root sign?
- x**-0.5: what is the - before ** performing?
- How to automatically calculate RMSE per group for fitting data in R?
- Plot of graph is not smooth in Manim (math.sqrt(1-x**2))
- Unable to increase the precision in computing square root using bisection method
- Square Root program using Difference Equations
- Using a BREAK statement to exit this while loop changes the value of the variable and gives incorrect answer. Need another way?
- docplex does not support square root np.sqrt(x), please suggest an alternative solution
- How do I print a square root to the console in python?
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?
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)
Consider n = 143 = 11 * 13. The cube root of 143 is between 5 and 6. If you only test divisibility by the primes up to 6, you will not find either of the two factors of n and will mistakenly conclude that 143 is prime.