Question

Find the prime factorization of each of these integers and use each factorization to answer the...

Find the prime factorization of each of these integers and use each factorization to answer the questions posed. The greatest prime factor of 39 is _____.

Homework Answers

Answer #1

prime factors are the factors of given numbers which are only prime numbers

that means given number should be written in the multiples of only prime numbers

if given integer is even number then we need to start divide with 2 if it is an odd number then we should use the divisible rules for each number based.

here given number is 39 and simply we know it is odd number and divisible by 3

so we can write 39 = 3 x 13 and both are prime numbers so we can write further multiples

so the prime factors of 39 = 1 x 3 x 13

and the greatest prime factor of 39 = 13

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
use Euler's totient and prime factorization. a) how many integers between 1 and 2000 inclusive are...
use Euler's totient and prime factorization. a) how many integers between 1 and 2000 inclusive are relatively prime to 2000? b) how many factors of 2000 are perfect squares?
a)  Using the Prime Factorization technique determine whether 173 is a prime. b)  Use the cipher: to decrypt...
a)  Using the Prime Factorization technique determine whether 173 is a prime. b)  Use the cipher: to decrypt “THAO ALZA”.
Use C++ to implement the following program about Prime Factorization of a Number. Do BOTH parts...
Use C++ to implement the following program about Prime Factorization of a Number. Do BOTH parts of the problem or you will lose points. Provide comments to explain each step. a. Write a function that takes as a parameter a positive integer and returns a list (array) of the prime factors of the given integer. For example, if the parameter is 20, you should return 2 2 5. b. Write a function that tests the above function by asking the...
Cryptography: Use Fermat's factorization to find a factor of 517.
Cryptography: Use Fermat's factorization to find a factor of 517.
Let phi(n) = integers from 1 to (n-1) that are relatively prime to n 1. Find...
Let phi(n) = integers from 1 to (n-1) that are relatively prime to n 1. Find phi(2^n) 2. Find phi(p^n) 3. Find phi(p•q) where p, q are distinct primes 4. Find phi(a•b) where a, b are relatively prime
Use Fermat's Factorization method to factor 2401. Show all of your work.
Use Fermat's Factorization method to factor 2401. Show all of your work.
Use Lenstra's elliptic curve factorization algorithm to factor each of the numbers N using the given...
Use Lenstra's elliptic curve factorization algorithm to factor each of the numbers N using the given elliptic curve E and point P. a) N=26167, E: Y^2=X^3+4X+128, P=(2,12) b) N=1386493, E: Y^2=X^3+3X-3, P=(1,1)
A natural number p is a prime number provided that the only integers dividing p are...
A natural number p is a prime number provided that the only integers dividing p are 1 and p itself. In fact, for p to be a prime number, it is the same as requiring that “For all integers x and y, if p divides xy, then p divides x or p divides y.” Use this property to show that “If p is a prime number, then √p is an irrational number.” Please write down a formal proof.
See four problems attached. These will ask you to think about GCDs and prime factorizations, and...
See four problems attached. These will ask you to think about GCDs and prime factorizations, and also look at the related topic of Least Common Multiples (LCMs). The prime factorization of numbers can be used to find the GCD. If we write the prime factorization of a and b as a = p a1 1 p a2 2 · p an n b = p b1 1 p b2 2 · p bn n (using all the primes pi needed...
Let X1,...,Xn be a random sample from Poisson(θ). Use the factorization theorem to find the sufficient...
Let X1,...,Xn be a random sample from Poisson(θ). Use the factorization theorem to find the sufficient statistic T for θ.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT