Scribd
Upload
75 views16 pages

Maximum Container Capacity for Petrol

The document contains 5 mathematics questions and their detailed solutions. The questions include applying Euclid's division algorithm, determining if a number is rational or irrational, proving a property about products of consecutive positive integers, and finding the HCF and L

Uploaded by

rai venugopal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
75 views16 pages

Maximum Container Capacity for Petrol

The document contains 5 mathematics questions and their detailed solutions. The questions include applying Euclid's division algorithm, determining if a number is rational or irrational, proving a property about products of consecutive positive integers, and finding the HCF and L

Uploaded by

rai venugopal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Question 1.

Two tankers contain 850 litres and 680 litres of petrol respectively. Find the maximum capacity of a
container which can measure the petrol of either tanker in exact number of times.
Solution:
Maximum capacity of a container, which can measure the petrol in exact number of times.

Question 2.
Find the value of: (-1) + (-1)2n +(-l) 2n+1 + (-l)4n+1 , where n is any positive odd integer.
Solution:

Question 3.
Find whether decimal expansion of 13/64 is a terminating or non-terminating decimal. If it
terminates, find the number of decimal places its decimal expansion has.
Solution:

Short Answer Type Question II [3 Marks]


Question 4.
Explain whether the number 3 x 5 x 13 x 46 + 23 isa prime number or a composite number.
Solution:

Long Answer Type Question [4 Marks]

Question 5.
Prove that the product of any three consecutive positive integers is divisible by 6. Solution: Let
three consecutive numbers are n, n + 1, n + 2
Solution:
1st Case: If n is even
This means n + 2 is also even.
Hence n and n + 2 are divisible by 2
Also, product of n and (n + 2) is divisible by 2.
.’. n(n + 2) is divisible by 2.
This conclude n(n + 2) (n + 1) is divisible by 2 …(i)
As, n, n + 1, n + 2 are three consecutive numbers. n(n + 1) (n + 2) is a multiple of 3.
This shows n(n + 1) (n + 2) is divisible by 3. …(ii)
By equating (i) and (ii) we can say
n(n + 1) (n + 2) is divisible by 2 and 3 both.
Hence, n(n + 1) (n + 2) is divisible by 6.
2nd Case: When n is odd.
This show (n + 1) is even
Hence (n + 1) is divisible by 2. …(iii)
This conclude n(n + 1) (n + 2) is an even number and divisible by 2.
Also product of three consecutive number is a multiple of 3.
n(n + 1)(n + 2) is divisible by 3. …(iv)
Equating (iii) and (iv) we can say
n(n + 1) (n + 2) is divisible by both 2 and 3 Hence, n(n + 1)(n + 2) is divisible by 6.

2015

Short Answer Type Questions I [2 Marks]

Question 6.
Apply Euclid’s division algorithm to find HCF of numbers 4052 and 420.
Solution:

Question 7.

Show that (√3+√5)² is an irrational number.


Solution:

Short Answer Type Question [3 Marks]

Question 8.
Three bells toll at intervals of 12 minutes, 15 minutes and 18 minutes respectively. If they start
tolling together, after what time will they next toll together?
Solution:
LCM of 12, 15, 18 = 2²x 3² x 5
=4x9x5 = 180
So, next time the bells will ring together after 180 minutes.

2014

Short Answer Type Questions I [2 Marks]

Question 9.
If HCF of 144 and 180 is expressed in the form 13m – 3, find the value of m.
Solution:
On applying Euclid’s division algorithm,
180 = 144 x 1 + 36
144 = 36 x 4 + 0
At the last stage, the divisor is 36.
∴ HCF of 144 and 180 is 36.
∵ 36 = 13 x 3 – 3
So, m = 3

Question 10.
Show that 9n can not end with digit 0 for any natural number n.
Solution:
Since prime factorisation of 9n is given by 9n= (3 x 3)n = 3271.
Prime factorisation of 9″ contains only prime number 3.
9 may end with the digit 0 for some natural number V if 5 must be in its prime factorisation, which is
not present.
So, there is no natural number N for which 9n ends with the digit zero.

Question 11.
Determine the values otp and q so that the prime factorisation of2520 is expressible as 23 X y X q
x 7.
Solution:
Prime factorisation of 2520 is given by
2520 = 23 x 32 x 5 x 7
Given that 2520 = 23 x 3p x q x 7
On comparing both factorisation we get p = 2 and q = 5.
Question 12.
Show that 2√2 is an irrational number.
Solution:

Question 13.
Show that any positive odd integer is of the form 4m + 1 or 4m + 3, where m is some integer.
Solution:

Short Answer Type Questions II [3 Marks]

Question 14.
By using, Euclid’s algorithm, find the largest number which divides 650 and 1170.
Solution:
Given numbers are 650 and 1170.
On applying Euclid’s division algorithm,
we get 1170 = 650 x 1 + 520
650 = 520 x 1 + 130
520 = 130 x 4 + 0
∵ At the last stage, the divisor is 130.
∴ The HCF of 650 and 1170 is 130.

Question 15.
Show that reciprocal of 3+2√2 is an irrational number
Solution:

Long Answer Type Question [4 Marks]

Question 16.
Find HCF of 378,180 and 420 by prime factorisation method. Is HCF x LCM of three numbers
equal to the product of the three numbers?
Solution:
378 = 2 x 33 x 7
180 = 22 x 32 x 5
420 = 22 x 3 x 5 x 7
∴ HCF (378, 180, 420) = 2 x 3 = 6.
No. HCF (p, q, r) x LCM (p, q, r) ≠ p x q x r. where p, q, r are positive integers.

2013

Short Answer Type Questions I [2 Marks]

Question 17.
Find the HCF of 255 and 867 by Euclid’s division algorithm
Solution:
Given numbers are 255 and 867.
On applying Euclid’s division algorithm, we have
867 = 255 x 3 + 102
255 = 102 x 2 + 51
102 = 51 x 2 + 0
∵ At the last stage, the divisor is 51
∴ The HCF of 255 and 867 is 51.

Question 18.
Find the HCF (865, 255) using Euclid’s division lemma.
Solution:
Given numbers are 255 and 865.
On applying Euclid’s division algorithm, we have
865 = 255 x 3 + 100
255 = 100 x 2 + 55
100 = 55 x 1 + 45
55 = 45 x 1 + 10
45 = 10 x 4 + 5
10 = 5 x 2 + 0
∵At the last stage, the divisor is 5
∴ The HCF of 255 and 865 is 5.

Short Answer Type Questions II [3 Marks]

Question 19.
Find HCF of 65 and 117 and find a pair of integral values of m and n such that HCF = 65m + 117n.
Solution:
Given numbers are 65 and 117.
On applying Euclid’s division algorithm, we get
117 = 65 x 1 + 52
65 = 52 x 1 + 13
52 = 13 x 4 + 0
∵At the last stage, the divisor is 13.
∴ The HCF of 65 and 117 is 13.
The required pair of integral values of m and n is
(2,-1) which satisfies the given relation HCF = 65m + 117n.

Question 20.
By using Euclid’s algorithm, find the largest number which divides 650 and 1170
Solution:

Since prime factorisation of 9n is given by 9n= (3 x 3)n = 3271.


Prime factorisation of 9″ contains only prime number 3.
9 may end with the digit 0 for some natural number V if 5 must be in its prime factorisation, which is
not present.
So, there is no natural number N for which 9n ends with the digit zero.

2012

Short Answer Type Question I [2 Marks]

Question 21.

If find the values of m and n where m and n are non-negative [Link] write
its decimal expansion without actual division.
Solution:

Short Answer Type Questions II [3 Marks]

Question 22.
Express the number 0.3178 in the form of rational number a/b.
Solution:

Question 23.
Using Euclid’s division algorithm, find whether the pair of numbers 847,2160 are coprimes or not.
Solution:

Question 24.
The LCM of two numbers is 14 times their HCF. The sum of LCM and HCF is 600. If one number is
280, then find the other number.
Solution:

2011

Short Answer Type Questions I [2 Marks]

Question 25.
Prove that 15 + 17√3 is an irrational number.
Solution:

Question 26.
Find the LCM and HCF of 120 and 144 by using Fundamental Theorem of Arithmetic.
Solution:
120 = 23 x 3 x 5
144 = 24 x 32
∴ HCF = 23 x 3 = 24
LCM = 24 x 5 x 32 = 720

Short Answer Type Questions II [3 Marks]

Question 27.
An army contingent of 1000 members is to march behind an army band of 56 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:
1000 =2x2x2x5x5x5
56 = 2x2x2x7
HCF of 1000 and 56 = 8
Maximum number of columns = 8.

Question 28.
Show that any positive odd integer is of the form 4q + 1 or 4q + 3 where q is a positive integer.
Solution:

Question 29.
Prove that 2√3/5 is irrational
Solution:

2010

Very Short Answer Type Questions [1 Mark]

Question 30.

Has the rational number a terminating or a non-terminating decimal repressentation


Solution:

Question 31.

Write whether on simplification gives a rational or an irrational number.


Solution:

Question 32.
The HCF of 45 and 105 is 15. Write their LCM.
Solution:

Short Answer Type Questions II [3 Marks]


Question 33.
Prove that 2-3√5 is an irrational number.
Solution:

Question 34.
Prove that 2√3 – 1 is an irrational number.
Solution:

Let 2√3 – 1 is a irrational number.

Question 35.
Prove that √2 is irrational.
Solution:

Question 36.
Prove that 7 – 2√3 is an irrational number.
Solution:

Question 37.
Show that 5 + 3√2 is an irrational number.
Solution:

Let us assume 5 + 3√2 is an irrational number.


There exists coprime integers a and b (b≠0)
2009

Very Short Answer Type Questions [1 Mark]

Question 38.

The decimal expansion of the rational number will terminate after how many places of
decimals.
Solution:

Question 39.
Find the [HCF X LCM] for the numbers 100 and 190.
Solution:
HCF x LCM = one number x another number
= 100 x 190 = 19000

Question 40.
Find the [HCF and LCM] for the numbers 105 and 120. [All India]
Solution:
105 = 5 x 7 x 3
120 = 2x2x2x3x5
HCF = 3 X 5 = 15
LCM = 5x7x3x2x2x2 = 840

Question 41.

Write whether the rational number will have a terminating decimal expansion or a non
terminating repeating decimal expansion.
Solution:
Question 42.
The HCF and LCM of two numbers are 9 and 360 respectively. If one number is 45, write the other
number.
Solution:

Short Answer Type Questions II [3 Marks]

Question 43.
Show that 5 – 2√3 is an irrational number.
Solution:

Question 44.
Show that 3 + 5√2 is an irrational number.
Solution:
Question 45.
Show that the square of any positive odd integer is of the form 8m + 1, for some integer m.
Solution:

Question 46.
Prove that 7 + 3√2 is not a rational number.
Solution:

Common questions

Powered by AI

To show that 847 and 2160 are coprimes using Euclid's algorithm, apply the division process repeatedly to find the common factors. If at the end of applying Euclid's process the last non-zero remainder is 1, then the numbers are coprime, meaning they have no common factors besides 1. This method is effective because it systematically breaks down the numbers into smaller, related factors, revealing commonality through rigorous calculation .

The Fundamental Theorem of Arithmetic states each positive integer has a unique prime factorization, aiding in finding the LCM and HCF of numbers. For 120 (2³x3x5) and 144 (2⁴x3²), the HCF is found by taking the lowest power of common primes: HCF = 2³x3. The LCM, requiring the highest power of each prime present in any factorization, is LCM = 2⁴x3²x5, thus efficiently computing these core arithmetic quantities .

The number 9 cannot end with the digit 0 for any natural power n because 0 as a last digit implies divisibility by 10, which requires the presence of the prime factors 2 and 5. However, the prime factorization of 9 is composed solely of the prime number 3 (9 = 3²), which lacks both the 2 and 5 required to form a factor of 10. Thus, no power of 9 can ever end with 0 .

Euclid's division algorithm helps determine the HCF by repeatedly applying the process of division until the remainder is zero. For 4052 and 420, the algorithm involves dividing 4052 by 420 to get a quotient and a remainder, then dividing the divisor (420) by this remainder, repeating the process with each new divisor and remainder pair, until the remainder is zero. The divisor at this last non-zero remainder step is the HCF. This method efficiently reduces the problem size through successive reductions .

Express 0.3178 as a rational number by interpreting the decimal places as consecutive powers of 10, forming the fraction 3178/10000. This method is useful because it converts finite decimal expansions into a/b form, fitting the definition of rational numbers, thus allowing operations like addition, comparison, and simplification within a rational number framework .

The significance lies in emphasizing the non-linear nature of number factorization. The HCF represents shared minimal factors while the LCM covers all factor incidences among numbers. For 378, 180, and 420, the product of HCF and LCM differs from their multiplication: HCF captures least commonality and LCM maximal spread, neither of which matches straightforward summation of all individual distributions, reflecting intricate and deep number properties beyond basic arithmetic expectations .

A rational number such as 13/64 has a terminating decimal expansion if the denominator in its lowest terms (64 in this case) is composed only of the prime factors 2 and/or 5. The number of decimal places is determined by taking the power to which each prime factor appears in the denominator's prime factorization. Here, 64 = 2^6, hence the decimal expansion terminates after 6 decimal places .

To determine whether 3x5x13x46 + 23 is prime or composite, compute the full value of the expression, which yields a numerical result. A prime number has no divisors other than 1 and itself. If any integer less than its square root divides it without a remainder, it is composite. The expression suggests arithmetic evaluation rather than simple, inherent properties, illustrating that testing numeric evidence is crucial .

To verify that 2√2 is irrational, assume first that it is rational, expressed as a fraction of two integers a/b in lowest terms. Squaring both sides gives (2√2)² = (a/b)², leading to 8 = a²/b² ⇒ a² = 8b², meaning a² is divisible by 8. Thus, a must be divisible by √8, contradicting the reduced fraction assumption. The importance lies in understanding the properties of numbers and their classifications, which are foundational in mathematics, especially in calculus and algebra where irrational numbers play critical conceptual roles .

The significance lies in showing a fundamental property of integers, which has applications in combinatorial arguments and number theory. The proof is structured by considering two cases: when the first integer 'n' is even and when it is odd. If 'n' is even, both 'n' and 'n+2' are divisible by 2, leading to divisibility by 2. Additionally, the product of any three consecutive integers is necessarily divisible by 3, as at least one of them must be a multiple of 3. Hence, the product 'n(n+1)(n+2)' is divisible by both 2 and 3, thus by 6. If 'n' is odd, 'n+1' is even, contributing the factor of 2, while the logic for divisibility by 3 remains the same, proving divisibility by 6 in all cases .

You might also like