Home
Class 10
MATHS
Consider the numbers 4^(n) , where n is ...

Consider the numbers `4^(n)` , where n is a natural number. Check whether there is any value of n for which `4^(n)` ends with the digit zero.

Text Solution

Verified by Experts

The correct Answer is:
zero
Promotional Banner

Topper's Solved these Questions

  • REAL NUMBERS

    KUMAR PRAKASHAN|Exercise OTHER IMPORTANT EXAMPLES|10 Videos
  • REAL NUMBERS

    KUMAR PRAKASHAN|Exercise EXERCISE 1.1|5 Videos
  • QUESTION PAPER-2

    KUMAR PRAKASHAN|Exercise Section C|14 Videos
  • SOME AAPLICATIONS OF TRIGONOMETRY

    KUMAR PRAKASHAN|Exercise Objective Questions|24 Videos

Similar Questions

Explore conceptually related problems

Consider the numbers of the form 4^n where n is a natural number. Check whether there is any value of n for which 4^n ends with zero?

Can the number 6^n , n being a natural number, end with the digit 5? Give reason.

Find sum of first n natural numbers.

Find the standard deviation of the first n natural numbers.

Prove that (1+x)^(n) ge (1+nx) for all natural number n where x gt -1

Variance of first n natural number is …………

Find the coefficient of varience of first n natural numbers.

If m and n are the two natural number such that m^(n)=9 , then find the value of n^(m) :-

Prove that (1+x)^n gt= (1+nx) , for all natural number n, where x> -1

Check whether 6^(n) can end with the digit 0 for any natural number n

KUMAR PRAKASHAN-REAL NUMBERS -TEST YOUR SKILLS
  1. Consider the numbers 4^(n) , where n is a natural number. Check whethe...

    Text Solution

    |

  2. Show that the square of any positive integer is of the form 4m or 4m +...

    Text Solution

    |

  3. Show that the square of any positive integer cannot be of the form 6m ...

    Text Solution

    |

  4. Show that the cube of any positive integer j is of the form 4m or 4m +...

    Text Solution

    |

  5. if n is an odd integer, then show that n^(2) - 1 is divisible by 8.

    Text Solution

    |

  6. Using Euclid’s division algorithm, find the HCF of 441, 567 and 693.

    Text Solution

    |

  7. Using Euclid’s division algorithm, find the largest number that divide...

    Text Solution

    |

  8. Using Euclid’s division algorithm, find the HCF of 5404 and 4800

    Text Solution

    |

  9. Using Euclid’s division algorithm, find the HCF of 1620, 1725 and 255.

    Text Solution

    |

  10. For any positive integer n, prove that n^(3) - n is divisible by 6.

    Text Solution

    |

  11. Find the missing numbers a, b, c and d in the following factor tree

    Text Solution

    |

  12. Find the HCF of 525 and 1120 by the prime factorisation method. Then, ...

    Text Solution

    |

  13. The HCF of 128 and 68 is expressible in ? the form 128 m - 1 5 x 6 8 ....

    Text Solution

    |

  14. Explain why 5 x 7 x 13 + 13 is a composite number

    Text Solution

    |

  15. The HCF of two numbers is 145 and their LCM is 2175. If one of the nu...

    Text Solution

    |

  16. Find the HCF and LCM of 510 and 92 and also verify that HCF x LCM = th...

    Text Solution

    |

  17. Find the HCF and LCM of 60, 120 and 288.

    Text Solution

    |

  18. Prove that 3 +2 sqrt(5) is irrational.

    Text Solution

    |

  19. Prove that sqrt(3) + sqrt(5) is irrational.

    Text Solution

    |

  20. Prove that sqrt(11) is irrational.

    Text Solution

    |

  21. Prove that 5sqrt(7) is irrational.

    Text Solution

    |