Question about Computers & Internet
Prime numbers can be calculated by using recursive algorithm
If (i%j==0)printf(" %d number is prime",&i );
else printf(" %d number is not prime",&i);
Ctrl break to terminate execution or other
Posted on Jan 29, 2009
a 6ya expert can help you resolve that issue over the phone in a minute or two.
best thing about this new service is that you are never placed on hold and get to talk to real repairmen in the US.
the service is completely free and covers almost anything you can think of (from cars to computers, handyman, and even drones).
click here to download the app (for users in the US for now) and get all the help you need.
Posted on Jan 02, 2017
Tips for a great answer:
Jan 23, 2017 | The Computers & Internet
Mar 08, 2015 | Computers & Internet
May 07, 2014 | Computers & Internet
Nov 26, 2013 | Office Equipment & Supplies
Aug 15, 2011 | Home
"Prime Factorization" is finding which prime numbers multiply together to make the original number.
Example : What are the prime factors of 12 ? It is best to start working from the smallest prime number, which is 2, so let's check:
12 ÷ 2 = 6
Yes, it divided evenly by 2. We have taken the first step!
But 6 is not a prime number, so we need to go further. Let's try 2 again:
6 ÷ 2 = 3
Yes, that worked also. And 3 is a prime number, so we have the answer:
12 = 2 × 2 × 3
As you can see, every factor is a prime number, so the answer must be right.
Note: 12 = 2 × 2 × 3 can also be written using exponents as 12 = 22 × 3
Jun 22, 2011 | Computers & Internet
May 20, 2009 | Computers & Internet
Jan 06, 2009 | Microsoft Visual Basic 6.0 for PC
Sep 02, 2008 | Computers & Internet
96 people viewed this question
Usually answered in minutes!