Best Answer

Whatever you use, 59 is a Prime number. Its only prime factor is itself.

User Avatar

Wiki User

โˆ™ 2013-09-23 02:51:41
This answer is:
User Avatar
Study guides


20 cards

A polynomial of degree zero is a constant term

The grouping method of factoring can still be used when only some of the terms share a common factor A True B False

The sum or difference of p and q is the of the x-term in the trinomial

A number a power of a variable or a product of the two is a monomial while a polynomial is the of monomials

See all cards
824 Reviews

Add your answer:

Earn +20 pts
Q: How do you find a prime factor of 59using a t?
Write your answer...
Still have questions?
magnify glass
Related questions

What is the only prime number tha t is a factor of 16?

The only prime factor of 16 is 2.

What is the prime factor of 643?

643 dosen`t have a prime factorization because it`s already prime.

When was Factor T created?

Factor T was created in 1956.

What is t he prime factor of 105 and 358?

3 x 5 x 7 = 105 2 x 179 = 358

Where can you find parts for Prime Heat RU40AC fireplace?

where can we find logs for modelrmh 32 T serial no. 98290415 gas LP

What is the structure of the t and t government?

prime minister

How is the square root of the key to the sieve of eratosthenes and finding prime numbers?

If you are trying to find a factor of a number n, then there is no need to search beyond s = sqrt(n). For if a factor of n is greater than s, then its factor pair will be less than s and so you should have found that already.For proof, let u be the factor pair. That is, t*u = n. Also s*s = n so that t*u = s*sDivide both sides by u*s so that t/s = s/uNow, t > s implies that t/s > 1 and so s/u > 1 which means that s > u.

What is accumulation factor?

Given I<T, the accumulation factor A(I,T) is the accumulation value at the time T of one unit of money invested at time I. So for compound interest A(I,T)= (1+i)^(T-I).

How do you factor T2 plus 4T?

T(t + 4)

Program in c language to find prime factors of a given number-while?

The program is as follows: #include <stdio.h> void main() { int number = 0; int count = 1; int i = 0; printf("Enter the number whose prime factor is to be determined: \t"\n); scanf("%d", &number); while((number /2) > ++count) { if(number % count == 0) { printf("factor = [%d]\n", count); } } }

How do you write a program in lisp to find if a number is prime or not?

(defun prime (num) (if (< 2 num) (do ((dividend 2 (1 + dividend)) (chk-to (sqrt num))) ((equal (rem num dividend) 0)) (when (<= chk-to dividend) (return t))) t))

How do you factor t2-5t-24?

(t-8)(t + 3)

People also asked