TQM – Definitions of Other Key Words

[Solved] Which of the following does not fit in the category of Goods?

Which of the following does not fit in the category of Goods? a) Cell phoneb) Televisionc) Insuranced) Bike Answer: cExplanation: Cell phones, television, and bike are considered Goods. Insurance fits into the category of Service. More Questions on TQM – Definitions of Other Key Words Which of the following is not a measure of Product …

[Solved] Which of the following does not fit in the category of Goods? Read More »

[Solved] The two categories of products are _____ and _____

The two categories of products are _____ and _____ a) Goods, Servicesb) Media, Educationc) Pencil, Card) Hospitality, Calculator Answer: aExplanation: Product is the output of any process. Goods and Services are the two types of products. A pencil, car, and a calculator are types of Goods. Similarly, media, hospitality, and education fall under the category …

[Solved] The two categories of products are _____ and _____ Read More »

[Solved] Use Euclid’s division lemma to show that the cube of any positive integer is of the form 9m, 9m + 1 or 9m + 8.

Use Euclid’s division lemma to show that the cube of any positive integer is of the form 9m, 9m + 1 or 9m + 8. Solutions: Let ‘a’ be any positive integer and b = 3.∴ By Euclid’s division algorithm, we have a = bq + r,0 ≤ r ≤ ba = 3q + r,0 …

[Solved] Use Euclid’s division lemma to show that the cube of any positive integer is of the form 9m, 9m + 1 or 9m + 8. Read More »

[Solved] Use Euclid’s division lemma to show that the square of any positive integer is either of form 3m or 3m + 1 for some integer m.

Use Euclid’s division lemma to show that the square of any positive integer is either of form 3m or 3m + 1 for some integer m. Solution: Let ‘a’ be any positive integer and b = 3.∴ By Euclid’s division algorithm, we have a = 3q + r, 0 ≤ r < ba = 3q …

[Solved] Use Euclid’s division lemma to show that the square of any positive integer is either of form 3m or 3m + 1 for some integer m. Read More »

[Solved] An army contingent of 616 members is to march behind an army band of 32 members in a parade.

An army contingent of 616 members is to march behind an army band of 32 members in a parade. The two groups are to march in the same number of columns. What is the maximum number of columns in which they can march? Solution: Maximum number of columns = HCF of (616, 32)For finding the …

[Solved] An army contingent of 616 members is to march behind an army band of 32 members in a parade. Read More »

[Solved] Show that any positive odd integer is of the form 6q + 1, or 6q + 3, or 6q + 5, where q is some integer.

Show that any positive odd integer is of the form 6q + 1, or 6q + 3, or 6q + 5, where q is some integer. Solution: Let ‘a’ be any positive integer and b = 6.∴ By Euclid’s division algorithm, we havea = bq + r, 0 ≤ r ≤ ba = 6q + …

[Solved] Show that any positive odd integer is of the form 6q + 1, or 6q + 3, or 6q + 5, where q is some integer. Read More »

[Solved] Use Euclid’s division algorithm to find the HCF of 867 and 255.

Use Euclid’s division algorithm to find the HCF of 867 and 255. Solution: Given numbers are 867 and 255By applying Euclid’s division algorithm, we have867 = 255 x 3 + 102Since the remainder is 102 ≠ 0, so again we apply Euclid’s division algorithm to 255 and 102. to get255 = 102 x 2 + …

[Solved] Use Euclid’s division algorithm to find the HCF of 867 and 255. Read More »

[Solved] Use Euclid’s division algorithm to find the HCF of 196 and 38220.

Use Euclid’s division algorithm to find the HCF of 196 and 38220. Solution: Given numbers are 196 and 38220By applying Euclid’s division algorithm, we have38220 = 196 x 195 + 0Since we get the remainder zero in the first step, so we stop.∵ At the above stage, the divisor is 196∴ The HCF of 196 …

[Solved] Use Euclid’s division algorithm to find the HCF of 196 and 38220. Read More »

[Solved] Use Euclid’s division algorithm to find the HCF of 135 and 225.

Use Euclid’s division algorithm to find the HCF of 135 and 225. Solution: Given numbers are 135 and 225.By applying Euclid’s division algorithm, we have225 = 135 x 1 + 90Since the remainder is 90 ≠ 0, so again we apply Euclid’s division algorithm to 135 and 90, to get135 = 90 x 1 + …

[Solved] Use Euclid’s division algorithm to find the HCF of 135 and 225. Read More »