answersLogoWhite

0


Best Answer

Only if p and q are DIFFERENT primes.

User Avatar

Wiki User

11y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Is the square root of pq irrational where p and q are primes?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

How do I work out the saquare root of a number?

Finding the square root of a number is the inverse operation of squaring that number. Remember, the square of a number is that number times itself. The perfect squares are the squares of the whole numbers. The square root of a number, n, written below is the number that gives n when multiplied by itself.


What is irrational number and give example of irrational number?

An irrational number is a real number that cannot be expressed as a ratio of two integers, pq/ where q > 0. sqrt(2) and pi are examples.


Numbers that have exactly 4 factors?

They are numbers that are the product of two different prime numbers. If the primes are p and q, the four factors are 1, p, q and pq.


What type of number cannot be written as a fraction pq where p and q are integers and q is not equal to zero?

an irrational number


What type of numbers cannot be written as a fraction pq where p and q are integers and q is not equal to zero?

Irrational numbers, such as √2 or π, cannot be written as a fraction pq where p and q are integers and q is not equal to zero. These numbers cannot be expressed as a ratio of two integers and are non-repeating and non-terminating decimals.


What does pq stand for in dorval pq?

Province de Quebec


When was PQ Monthly created?

PQ Monthly was created in 2012.


What is the equivalent expression for 2 plus pq?

2 + pq


How do you write the length of segment PQ in mathematical form?

|PQ|


Algorithm to insert and delete an element from a circular queue?

The Method To Add an element in Circular Queue # define MAXQUEUE 100 struct queue{ int items[MAXQUEUE]; int front, rear; } struct queue q; q.front=q.rear=MAXQUEUE -1; void ENQ(struct queue *pq, int x) { /* make room for new element*/ if(pq ->rear = MAXQUEUE - 1) pq-> rear = 0; else (pq->rear)++; /* check for overflow */ if(pq ->rear==pq->front) { printf("queue overflow); exit(1); } pq->items[pq->rear]=x; return; }/* end of ENQ*/ A Method to Delete an element from Circular Queue int DQ(struct queue *pq) { if(pq-> rear == pq-> front) { printf("queue underflow"); exit(1); }/*end if*/ if(pq->front = = MAXQUEUE-1) pq->front=0; else (pq->front)++; return(pq->items[pq->front]);


Point b is the midpoint of the line segment pq line segment pq is eight centimeters longer than line segment pb what is the number of centimeters in the length of line segment qb?

Because b is the mid point of pq, pb = qb. pb is half as long as pq Eq#1....pb = 1/2 pq Eq#2....pq = pb +8 Substitute Eq#1 into Eq #2 pq = 1/2 pq + 8 subtracting1/2 pq from both sides 1/2 pq = 8 pq = 16 problem here: you can't subtract 1/2 ... you would have to divide.


What is the coefficient of pq?

It is the number that precedes pq in the simplified expression.