n2-1 and n2-4 are trivial cases because of n2-m2=(n-m)(n+m). So the only prime of the form n2-1 is 3 and of the form n2-4 is 5.
#include<stdio.h> int main(){ int n1,n2; printf("\nEnter two numbers:"); scanf("%d %d",&n1,&n2); while(n1!=n2){ if(n1>=n2-1) n1=n1-n2; else n2=n2-n1; } printf("\nGCD=%d",n1); return 0; }
.04m2-n2=(.2m+n)(.2m-n)
Take 5 out. If the missing signs are pluses, it becomes 5(n2 + 2n + 4) If the missing signs are minuses, it becomes 5(n2 - 2n - 4)
(n - 10)(n + 4)
Assuming you mean n2 + 11n + 30, the factors are (n + 6)(n + 5).
n2 - 4 is the "difference of two squares." That factors to (n - 2)(n+2)a2 + 2a + 1 is "additive squares." That factors to (a + 1)(a + 1) or (a + 1)2
n2 - 11n - 26what two factors of - 26 add up to - 11?(n + 2)(n - 13)===========
The factors of n12 are 1, n, n2, n3, n4, n5, n6, n7, n8, n9, n10, n11, and n12
n2-1 and n2-4 are trivial cases because of n2-m2=(n-m)(n+m). So the only prime of the form n2-1 is 3 and of the form n2-4 is 5.
equation works for n = 0 and n = 1 as factors are n and n - 1
P(x=n1,y=n2) = (n!/n1!*n2!*(n-n1-n2)) * p1^n1*p2^n2*(1-p1-p2) where n1,n2=0,1,2,....n n1+n2<=n
0 in N2
The expression n2 - n - 56 factors to (n - 8)(n + 7).
0 in N2
n x n = n2
#include<stdio.h> int main(){ int n1,n2; printf("\nEnter two numbers:"); scanf("%d %d",&n1,&n2); while(n1!=n2){ if(n1>=n2) n1=n1-n2; else n2=n2-n1; } printf("\nGCD=%d",n1); return 0; }