mathemerize

Use Euclid’s Division Lemma to show that the square of any positive integer is either of the form 3m or 3m + 1 for some integer m.

Solution : By Euclid’s Division Algorithm, we have a = bq + r       …………..(i) On putting b = 3 in (1), we get a = 3q + r,      [0 \(\le\) r < 3] If r = 0   a = 3q  \(\implies\)  \(a^2\) = \(9q^2\)                …

Use Euclid’s Division Lemma to show that the square of any positive integer is either of the form 3m or 3m + 1 for some integer m. Read More »

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 : To find the maximum number of columns, we have to find the H.C.F. of 616 and 32 i.e. 616 = 32 \(\times\) 19 + 8 and 32 = 8 \(\times\) 4 + 0 \(\therefore\) H.C.F of 616 and 32 is 8. Hence, maximum number of columns is 8.

Use Euclid’s division algorithm to find the H.C.F of :

Question : Use Euclid’s division algorithm to find the H.C.F of : (i) 135 and 225 (ii) 196 and 38220 (iii) 865 and 225 Solution : (i) We start with the larger number 225. By Euclid’s Division Algorithm, we have 225 = 135 \(\times\) 1 + 90 We apply Euclid’s Division Algorithm on Division 135 …

Use Euclid’s division algorithm to find the H.C.F of : Read More »

Weighted Mean – Formula and Examples

Here you will learn what is weighted mean formula and how to calculate weighted mean with examples. Let’s begin – Weighted Mean Formula If \(w_1\), \(w_2\), ……\(w_n\) are the weights assigned to the values \(x_1\), \(x_2\), …..\(x_n\) respectively then their weighted mean is defined as Weighted mean = \(w_1x_1 + w_2x_2 +……+ w_nx_n\over {w_1 +…….+ …

Weighted Mean – Formula and Examples Read More »