Question about Computers & Internet

1 Answer

Determine the prime factorization of 1320. - Computers & Internet

Posted by on

Ad

1 Answer

  • Level 3:

    An expert who has achieved level 3 by getting 1000 points

    One Above All:

    The expert with highest point at the last day of the past 12 weeks.

    Top Expert:

    An expert who has finished #1 on the weekly Top 10 Fixya Experts Leaderboard.

    Superstar:

    An expert that got 20 achievements.

  • Computers & ... Master
  • 102,366 Answers

2 * 2 * 2 * 3 * 5 * 11

Posted on Oct 22, 2013

Ad

1 Suggested Answer

6ya6ya
  • 2 Answers

SOURCE: I have freestanding Series 8 dishwasher. Lately during the filling cycle water hammer is occurring. How can this be resolved

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

Add Your Answer

Uploading: 0%

my-video-file.mp4

Complete. Click "Add" to insert your video. Add

×

Loading...
Loading...

Related Questions:

1 Answer

What is a prime factor


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

Jun 15, 2017 | Prime Computers & Internet

1 Answer

Number 2 is chosen to begin a ladder diagram to find the prime factorization of 66. What other numbers could have been used to start the ladder diagram of 66?


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

Feb 23, 2017 | Cars & Trucks

1 Answer

How do I express 5765 in exponential form?


Hello there,
First you need to find the P'rime factors' of 5765 which are 5 * 1153
Therefore the Exponential form of 5765 is 51 x 11531
You MUST find the PRIME FACTORS
(That means the two Prime numbers that when multiplied together gives the answer.
. Go here to see how. to 'manually calculate like we used to do it,
http://www.calculatorsoup.com/calculators/math/prime-factors.php

Nowadays just search for 'Prime Factors Calculator' on your search engine.

Sep 10, 2014 | Office Equipment & Supplies

1 Answer

What are all of the prime factors in 847847


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

Mar 29, 2014 | Computers & Internet

1 Answer

My casio fx-83GT Plus calculator wont do HCF for me


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.
  1. Decompose the first number in prime factors. If a prime factor is repeated use the exponent notation: That helps.
  2. Decompose the second number in prime factors too, using the exponent notation.
  3. 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.
  4. Do that for all prime factors
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 fonts.
2^3, 5^4, 7, 11
The highest common divisor/Highest common factor is
(2^3)*(5^4)*7*11

Mar 27, 2014 | Casio Office Equipment & Supplies

1 Answer

Can you do the highest common factor on an fx-83GT PLUS casio calculator


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

Mar 27, 2014 | Casio Office Equipment & Supplies

1 Answer

Determine the prime factorization


The prime factorization of 1320 is 2 * 2 * 2 * 3 * 5 * 11. Or are you asking in general? See http://en.wikipedia.org/wiki/Integer_factorization

Oct 22, 2013 | Mathsoft Computers & Internet

1 Answer

What is prime factorization?


"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

1 Answer

Find the prime number between 1 to 50


using System;

class MainClass {
public static void Main() {
int num;
int i;
int factor;
bool isprime;


for(num = 1; num < 50; num++) {
isprime = true;
factor = 0;

// see if num is evenly divisible
for(i=2; i <= num/2; i++) {
if((num % i) == 0) {
// num is evenly divisible -- not prime
isprime = false;
factor = i;
}
}

if(isprime)
Console.WriteLine(num + " is prime.");
else
Console.WriteLine("Largest factor of " + num +
" is " + factor);
}

}
}

Feb 01, 2011 | Computers & Internet

1 Answer

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();
}

May 16, 2009 | Computers & Internet

Not finding what you are looking for?
Computers & Internet Logo

Related Topics:

17 people viewed this question

Ask a Question

Usually answered in minutes!

Top Computers & Internet Experts

Doctor PC
Doctor PC

Level 3 Expert

7733 Answers

kakima

Level 3 Expert

102366 Answers

David Payne
David Payne

Level 3 Expert

14161 Answers

Are you a Computer and Internet Expert? Answer questions, earn points and help others

Answer questions

Manuals & User Guides

Loading...