American History: George Washington is known as the Father of Our Country. He was a great military and political leader. However, he wasn't always fighting wars. You, the Star Reporter, are going to visit George Washington at his home at Mount Vernon during the years of 1759-1774. You are going to interview him about his political and personal views, activities, goals, and predictions. Research the political issues of the times. Then develop ten questions that you would ask President Washington. Tell why you would ask each question.
PLS HELP ME ITS DUE TOMORROW MORNING I WILL GIVE BRAINLIEST
Answers
Answer:
1. I will ask his birth date , because I want to know
2. I will ask him that what is reason behind your success , I also want to be success
3. I will ask him that how the idea comes in his mind to became president, because my brother also want to be a president of india.
4. Where he was born
5.What is name of their father and mother
6.What were the name of their friends
7.How many degrees did he had achieved
8.How many percentage scored in 10th
9.How many percentage scored in 12th
10.Will he be my friend
Explanation:
What is the Greatest Common Factor (GCF)?
In mathematics, the greatest common factor (GCF), also known as the greatest common divisor, of two (or more) non-zero integers a and b, is the largest positive integer by which both integers can be divided. It is commonly denoted as GCF(a, b). For example, GCF(32, 256) = 32.
Prime Factorization Method
There are multiple ways to find the greatest common factor of given integers. One of these involves computing the prime factorizations of each integer, determining which factors they have in common, and multiplying these factors to find the GCD. Refer to the example below.
EX: GCF(16, 88, 104)
16 = 2 × 2 × 2 × 2
88 = 2 × 2 × 2 × 11
104 = 2 × 2 × 2 × 13
GCF(16, 88, 104) = 2 × 2 × 2 = 8
Prime factorization is only efficient for smaller integer values. Larger values would make the prime factorization of each and the determination of the common factors, far more tedious.
Euclidean Algorithm
Another method used to determine the GCF involves using the Euclidean algorithm. This method is a far more efficient method than the use of prime factorization. The Euclidean algorithm uses a division algorithm combined with the observation that the GCD of two integers can also divide their difference. The algorithm is as follows:
GCF(a, a) = a
GCF(a, b) = GCF(a-b, b), when a > b
GCF(a, b) = GCF(a, b-a), when b > a
hope you find it helpful