0
Still curious? Ask our experts.
Chat with our AI personalities
Jordan
Fran
BeauAdd your answer:
Earn +20 pts
How do you caluculate the GCD of two prime numbers?
Let p1 and p2 be the two prime numbers. Because they are prime, their divisors are div(p1) = {1,p1} and div(p2) = {1,p2}. So GCD(p1,p2) = Greatest Common Divisor of p1 and p2 = p1 if p1 equals p2 1 if p1 is different from p2
Can a multiple of a prime number be prime?
No. Let p1 be a prime number. Let p2 be a multiple of p1 such that p2 = p1 * k. Then the factors of p2 are: 1, p1, k and p2. ==> p2 is not a prime number. Hence, a multiple of a prime number cannot be a prime number.
When the ones and tens are multiplied separately each product is called a?
The general function is:1. y = a*x+bb is irrelevant and we can be removed2. y = a*xlets split x into ones and tens3. x = tens*10 + ones /e.g. 23 = 2*10 + 34. p1 = Multiplier of the onesp2 = Multiplier of the tens5. y = tens*10*p2 + ones*p1 /according to the question6. x*a = tens*10*p2 + ones*p1 /according to 2.7. (tens*10 + ones)*a = tens*10*p2 + ones*p1 /according to 3.8. tens*10*a + ones*a = tens*10*p2 + ones*p1 /regroup9. tens*10*a - tens*10*p2 + ones*a - ones*p1 = 0 /regroup10. tens*10*(a-p2) + ones*(a-p1) = 0 /regroup11. assuming "tens" and "ones" are not 0 then (a-p2) and (a-p1) must be 012. a-p2 = 0a-p1 = 013. a = p2a = p114. a = p1 = p2the answer is: when the Multipliers of ones and tens are equal then the product is called a.
What are the condition for three points to be collinear?
p1+p2+p3=0
How do you Add 2 numbers using pointer and array in C?
#include<stdio.h> #include<conio.h> void main() { clrscr(); int i; int a[4]={1,2,3,4}; int *p1,*p2,*p3; for(i=0;i<4;i++) { p1=&a[0]; p2=&a[2]; p3=*p2-*p1; printf("\n value of p3%d",p3); } getch(); }
