Ad

Hi,

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.

goodluck!

Posted on Jan 02, 2017

Ad

SOURCE: write a c program to find the largest prime factor of a number

#include<stdio.h>

#include<conio.h>

void main()

{

int num,i=1,j,k;

clrscr();

printf("\nEnter a number:");

scanf("%d",&num);

while(i<=num)

{

k=0;

if(num%i==0)

{

j=1;

while(j<=i)

{

if(i%j==0)

k++; j++;

}

if(k==2)

printf("\n%d is a prime factor",i);

}

i++;

}

getch();

}

Posted on May 16, 2009

A **factor** that is a **prime** number. Any of the **prime** numbers that, when multiplied, give the original number. Example: The**prime factors** of 15 are 3 and 5 (3×5=15, and 3 and 5 are**prime** numbers).

Jun 15, 2017 | Prime Computers & Internet

By changing the number for your prime factorization, you also have a different diagram.

Prime factorization for 66

** 66**

** /\**

** 2*33**

** /\**

** 3*11**

Even if we change the prime factorization order, we still have the same numbers.

**66 = 2 * 3 * 11**

Prime factorization for 66

Even if we change the prime factorization order, we still have the same numbers.

Feb 23, 2017 | Cars & Trucks

The prime factors are 2, 3, and 5. If you include the non-prime factors, you also have 1, 6, 10, 15, and 30.

May 15, 2014 | Computers & Internet

There are three prime factors: 7, 11, and 13.

Mar 29, 2014 | Computers & Internet

There is nothing you can do to make the calculator find the HCF for you. No point complaining about that. But if you are interested in doing it by hand (using the calculator to do the divisions for you) here how it is done.

**Example: **Here are the decompositions of two numbers

(2^5)*3***(5^4)**(7^3)***11** and **(2^3)***(5^6)*(11^2)***7**

The prime factors that are present in both decompositions are

2, 5, 7, and 11

From the two decompositions select the smallest power of each common prime factor. They are represented in** bold font**s.

2^3, 5^4, 7, 11

The highest common divisor/Highest common factor is

**(2^3)*(5^4)*7*11**

- Decompose the first number in prime factors. If a prime factor is repeated use the exponent notation:
**That helps.** **D**ecompose the second number in prime factors too, using the exponent notation.- Now look at the two decompositions. If a prime factor
**is present in both decompositions**it must be in the HCD /HCF, with the smallest of its two exponents. - Do that for all prime factors

(2^5)*3*

The prime factors that are present in both decompositions are

2, 5, 7, and 11

From the two decompositions select the smallest power of each common prime factor. They are represented in

2^3, 5^4, 7, 11

The highest common divisor/Highest common factor is

Mar 27, 2014 | Casio Office Equipment & Supplies

The calculator has no application that will find the highest common divisor (or HCF) but that should not be difficult to do by hand.

Decompose the first number in prime factors. If a prime factor is repeated use the exponent notation:**That helps**

Decompose the second number in prime factors too, using the exponent notation.

Now look at the two decompositions. If a prime factor is present in both decomposition it must be in the HCD /HCF, with the smallest of the two exponents. Do that for all prime factors

Example;

(2^5)*3***(5^4)**(7^3)***11**

**(2^3)***(5^6)*(11^2)***7**

The prime factors that are present in both decompositions are

2, 5, 7, and 11

From the two decompositions select the smallest power of each

2^3, 5^4, 7, 11

The highest common divisor/Highest common factor is

**(2^3)*(5^4)*7*11**

Decompose the first number in prime factors. If a prime factor is repeated use the exponent notation:

Decompose the second number in prime factors too, using the exponent notation.

Now look at the two decompositions. If a prime factor is present in both decomposition it must be in the HCD /HCF, with the smallest of the two exponents. Do that for all prime factors

Example;

(2^5)*3*

The prime factors that are present in both decompositions are

2, 5, 7, and 11

From the two decompositions select the smallest power of each

2^3, 5^4, 7, 11

The highest common divisor/Highest common factor is

Mar 27, 2014 | Casio Office Equipment & Supplies

The prime factors are 2, 3, and 5. If you include the non-prime factors then 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 120.

Feb 16, 2014 | Computers & Internet

The prime factors of 3200 and 800 are 2 and 5.

The prime factors of 2400 and 1200 are 2, 3, and 5.

The prime factors of 2400 and 1200 are 2, 3, and 5.

Sep 17, 2013 | Computers & Internet

"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

#include<stdio.h>

#include<conio.h>

void main()

{

int num,i=1,j,k;

clrscr();

printf("\nEnter a number:");

scanf("%d",&num);

while(i<=num)

{

k=0;

if(num%i==0)

{

j=1;

while(j<=i)

{

if(i%j==0)

k++; j++;

}

if(k==2)

printf("\n%d is a prime factor",i);

}

i++;

}

getch();

}

#include<conio.h>

void main()

{

int num,i=1,j,k;

clrscr();

printf("\nEnter a number:");

scanf("%d",&num);

while(i<=num)

{

k=0;

if(num%i==0)

{

j=1;

while(j<=i)

{

if(i%j==0)

k++; j++;

}

if(k==2)

printf("\n%d is a prime factor",i);

}

i++;

}

getch();

}

May 16, 2009 | Computers & Internet

Oct 18, 2017 | Computers & Internet

45 people viewed this question

Usually answered in minutes!

×