0
There is no easy way. You will have to try dividing it by the smallest prime (2), then the next one (3) and continue until you have tried out the all the primes up to and including the square root of the number. You do not need to find the quotient, you only need check for divisibility.
Wiki User
∙ 9y ago
Add your answer:
Earn +20 pts
Why prime numbers are used in RSA algorithm?
Prime numbers are helpful in cryptography because it is MUCH easier to calculate the product (multiplication) of two prime numbers than to do the reverse process (find the prime factors of a big number). The bigger the prime numbers are, the higher the difference in time between calculating the product, or factoryzing this product back into the two prime numbers. When person A wants to tell B a secret, they could agree on two great prime numbers (in a secret way) and later use the product to communicate. A and B could easely calculate the other's factor because they know their own factor. Anyone else would have to try to factorize the huge prime number without any knowledge which would take, ideally, longer than 4.6 billion years (the age of the Earth). This is a VERY simplified answer and more can be found by googling around.
Is 1953 a prime number?
No. 1953 is divisible by itself and one, but also buy 3, 6, and some other BIG numbers I'm not sure about:)
How do you know if a number as big as 23341 is a prime or composite how do you figure it out is their a short cut?
Only one method as I know is.... First figure out perfect square above 23341. i.e. 23409=153*153. Now, divide 23341 with all the prime numbers comes before 153. If 23341 cannot be divided with any of the prime number then this number will be a prime. If in case any one number divides completely 23341 then this will not a prime.
How do you find factors of a big odd number if it is composite 1757051 equals 1291 x 1361?
I would say that 1757051 would be difficult to factor, except you did it just fine. Since 1291 and 1361 are both prime, they are the only proper factors. The process of factorization is the same for big numbers as small numbers. Use a factor tree to find the prime factorization. Once you have that, you can find the number of factors and have a pretty good idea of where to look for them. For people desiring a short cut, there are many fine factor calculators online.
To find greatest number among 10 numbers using loop?
#include<iostream.h> #include<conio.h> void main(){ int Number[10]; cout<<"Enter ten numbers"; for (int i=0;i<10;i++) cin>>Number[i]; int Big=0; for(int j=0;j<10;j++){ if (Big<Number[i]) Big=Number[i]; } cout<<"gretest Number:"<<Big; getch(); }
With a given big integer number which is the product of two prime numbers how do you find them?
First write a program to generate the prime number. After one prime number was generated, divide the big int number by the prime number. If the remainder is zero then quotient is the second prime number ( also it is important to check whether the quotient is prime number or not because sometimes you will get wrong answer). Repeat the process until you get the result.
Why prime numbers are used in RSA algorithm?
Prime numbers are helpful in cryptography because it is MUCH easier to calculate the product (multiplication) of two prime numbers than to do the reverse process (find the prime factors of a big number). The bigger the prime numbers are, the higher the difference in time between calculating the product, or factoryzing this product back into the two prime numbers. When person A wants to tell B a secret, they could agree on two great prime numbers (in a secret way) and later use the product to communicate. A and B could easely calculate the other's factor because they know their own factor. Anyone else would have to try to factorize the huge prime number without any knowledge which would take, ideally, longer than 4.6 billion years (the age of the Earth). This is a VERY simplified answer and more can be found by googling around.
How do you find 2 prime numbers that if multiplied would generate a 400-digit number?
You seek for prime numbers that are approximately 200 digits big, then multiply them. I don't know details about the algorithms, but I understand that for cryptography, instead of using an algorithm that will be guaranteed to give a prime number, an algorithm is used, instead, that has a very, very high probability of giving a prime number. Probably this is done because it is faster.
What is a prime number made of prime numbers called?
This is a new one on us, and as we try to understand whether or not the whole ideahas any meaning, our most urgent question is: Exactly how would the first prime numberbe "made of" the other prime numbers ?They certainly couldn't be multiplied, because then the big one would have factors,and it wouldn't be a prime number.They couldn't be divided, because if you divide one prime number by another one,the quotient is never a whole number. So that can't be it either.Could two prime numbers be added to get another one ? Well, all of the prime numbersexcept for '2' are odd numbers, and if you add two odd numbers, you get an even number,which can't be a prime number. And a similar argument probably knocks out subtraction.So we're going to go out on a big limb here, risk looking foolish, and state that as faras we're concerned, there's no way in general that a prime number can be "made of"other prime numbers, and that accordingly, we don't have to worry about coming upwith a name for such a thing.We'll be watching the watch-list for other contributors to come along and shoot downour whole shoddy though carefully-constructed line of reasoning.
Is 1953 a prime number?
No. 1953 is divisible by itself and one, but also buy 3, 6, and some other BIG numbers I'm not sure about:)
What number has 12 factors?
There are many numbers with 12 prime factors. They are very, very big. The number with the lowest 12 prime factors is 7420738134810 if you start with 2 as the lowest factor. If you start with 1 as the lowest factor, then the number is 200560490130. 2048 has 12 factors.
How big is the sun in numbers?
Big. (That's not a number.)
What are the big numbers called on the periodic table?
The big numbers are atomic numbers. They are equal to number of protons. Elements are arranged in order of increasing atomic number.
How do you know if a number as big as 23341 is a prime or composite how do you figure it out is their a short cut?
Only one method as I know is.... First figure out perfect square above 23341. i.e. 23409=153*153. Now, divide 23341 with all the prime numbers comes before 153. If 23341 cannot be divided with any of the prime number then this number will be a prime. If in case any one number divides completely 23341 then this will not a prime.
What is the 34221301th prime number?
According to the Big Primes archive, the 34221301st prime number is 658684681. A link is provided beneath this question.
Is 8855162322347449101830271721201913 a prime number?
No. The prime factorization of this number is37x2011x3673x9919204957x3266517126331619.If you want to check the primeness of some big number X, you can go to www.wolframalpha.com and type in "Is X prime?" You can also get the prime factorization by typing in "Factor X".
How can you tell if a number is big or small?
you can only tell this if you can count
