Advertisements
Advertisements
प्रश्न
Check whether 6n can end with the digit 0 for any natural number n.
Advertisements
उत्तर
We know that
62 = (2 × 3)n
62 = 2n × 3n
i.e., In the prime factorisation of 6n, there is no factor 5.
The fundamental theorem of arithmetic states that any composite number may be written as a product of primes. This factorization is unique, regardless of the sequence in which the primes occur.
∴ Our assumption that 6n ends with digit 0, is wrong.
Thus, there does not exist any natural number n for which 6n ends with zero.
संबंधित प्रश्न
State fundamental theorem of arithmetic?
Write down the decimal expansions of the following rational numbers by writing their denominators in the form 2m × 5n, where, m, n are non-negative integers. \[\frac{3}{8}\]
State Fundamental Theorem of Arithmetic.
Express the number as a product of its prime factor:
3825
If 13824 = 2a × 3b then find a and b
Find the greatest number consisting of 6 digits which is exactly divisible by 24, 15, 36?
Find the least number that is divisible by the first ten natural numbers
Three farmers have 490 kg, 588 kg and 882 kg of wheat respectively. Find the maximum capacity of a bag so that the wheat can be packed in exact number of bags.
For some integer p, every odd integer is of the form ______.
The product of two consecutive natural numbers is always ______.
The number in the form of 4p + 3, where p is a whole number, will always be ______.
When a number is divided by 7, its remainder is always ______.
For some integer q, every odd integer is of the form ______.
The least number that is divisible by all the numbers from 1 to 10 (both inclusive) is ______.
Let a and b be two positive integers such that a = p3q4 and b = p2q3, where p and q are prime numbers. If HCF (a, b) = pmqn and LCM (a, b) = prqs, then (m + n)(r + s) = ______.
Show the 6n cannot end with digit 0 for any natural number 'n'.
Find the HCF and LCM of 72 and 120.
(HCF × LCM) for the numbers 70 and 40 is ______.
If n is a natural number, then 8n cannot end with digit
