Previous Questions Asked in JKBOSE Class 10th Math Board Exams - Real Numbers

NTSE HUB
                PREVIOUS EXAM QUESTIONS                      

2019
1.       Given that HCF( 306, 657) = 9. Find the LCM( 306, 657)
2.       Check 6n is end with digit zero for some natural number  n.

2018


  1.           F ind the HCF & LCM of 336 & 54 by using prime factorisation method.
  2.        Use Euclid’s divisions algorithms to find the HCF of 135 & 225
  3.           Check 6n is end with digit zero for some natural number  n.

2017

  1.               Using prime factorization  methods, Find the HCF & LCM of 26 &91.
  2.               Use Euclid’s divisions algorithms to find the HCF of 867 & 255.
  3.                                Find the L.C.M of 12, 15 &21.

2016

  1.           Find the LCM of 12, 15 & 21by factorization methods
  2.       For some integers q, Show that any positive even integers is of the form  6q, or 6q+2, or 6q+4.
  3.      For some integers q, Show that any positive odd integers is of the form  4q+1, or 4q+3.
  4.        By using prime factorisation methods, Find the HCF & LCM of 6, 72, & 120.

2015
    1.   Use Euclid’s divisions algorithms to find the HCF of 867 & 255.
   2.  Express each numbers as a products of its prime factors :
a.       210                                                 b.     156
   3.   Use Euclid’s divisions algorithms to find the HCF of 135 & 225.

2014               
              1.       Use Euclid’s division lemma to show that square of any positive integers is either of the form  3m or 3m+1, for some integers m.
          2.       For some integers q, Show that any positive odd integers is of the form  4q+1, or 4q+3.
             3.       Use Euclid’s division lemma to show that cube of any positive integers is either of the form 9m or 9m+1, or 9m+8  for some integers m.

2013
               1.       Use Euclid’s divisions algorithms to find the HCF of 867 & 255.
            2.       Use Euclid’s divisions algorithms to find the HCF of 96 & 404.
          3.       Given that HCF( 306, 657) = 9. Find the LCM( 306, 657) .
          4.     By using prime factorisation methods, Find the HCF & LCM of 6, 72, & 120.

2012

  1.          Use Euclid’s divisions algorithms to find the HCF of 196 & 38220.
  2.               Use Euclid’s division lemma to show that square of any positive integers is either of the form  3m or 3m+1, for some integers m.
  3.          For some integers q, Show  that any positive odd integers is of the form  4q+1, or 4q+3.

2011

  1.          Check 6n  is end with digit zero for some integer n.
  2.               Given that HCF( 306, 657) = 9. Find the LCM( 306, 657) .
  3.          Use Euclid’s division lemma to show that cube of any positive integers is either of the form  9m or 9m+1, or 9m+8  for some integers m.

2010

  1.        For some integers q, Show  that any positive odd integers is of the form  4q+1, or 4q+3.
  2.         Given that HCF( 306, 657) = 9. Find the LCM( 306, 657) .
  3.         Find the LCM & HCF of 26 & 91 and verify that:                                                                   LCM x HCF = Product of two numbers

2009
       1.       Find the LCM & HCF of 336 &54 and verify that:

LCM x HCF = Product of two numbers




By:
ARANBIR SINGH














Share:

No comments:

Post a Comment

Powered by Blogger.

Search This Blog

Blog Archive

Recent Posts

Pages