The GCF of ba and b is b. That factors to b(a - 1)
Answer: GCF= b
The GCF is 2a.
BS
Factor them. a x a x b b x b x c a x c x c No common factors. The GCF is 1.
you find the GCF divide by GCF to get awnser like 2a+2b GCF 2 dived by to to get a+b
a a a a a b a ba ba b#
a a a a a b a ba ba b#
Answer: GCF= b
Describe the languages denoted by the following regular expressions: a) a(a|b)*a. b) ((e|a)b*)*. c) (a|b)*a(a|b)(a|b). d) a*ba*ba*ba*. !! e) (aa|bb)*((ab|ba)(aa|bb)*(ab|ba)(aa|bb)*)*.
The GCF is ab
If my math works, the solution if you are solving for b is (2a-ba)÷(-b)=b.
GCF of a and b is a if b is divisible by a.87 is divisible by 29 so, GCF(29,87) = 29.
If you have two numbers A and B, and A > B, then GCF(A, B) = (A-B, B) Thus the problem of finding the GCF of A and B has been reduced to finding the GCF of B and a smaller number, A-B. This process can be continued until the two numbers are the same: and that number is the GCF.
The GCF is 1.
The GCF is b.
Describe the languages denoted by the following regular expressions:a)a(a|b)*a.b) ((e|a)b*)*.c)(a|b)*a(a|b)(a|b).d)a*ba*ba*ba*.!! e)(aa|bb)*((ab|ba)(aa|bb)*(ab|ba)(aa|bb)*)*
#include<stdio.h> main() { int a,b,i,lcm,gcf; printf("\n Enter two numbers"); scanf("%d%d",&a,&b); for(i=0;i<=a;i++) { if((b%i==0)&&(a%i==0)) { gcf=i; } } lcm=a*b/gcf; printf("\n GCF is %d and LCM is %d",gcf,lcm); }