# CAT 2013 – Simple Questions sitting under elaborate wording

Competitive exams often ask questions with a ‘wrapper’ around them. Its important to get to the right question quickly. Give the underlying questions for the following -1. Give the smallest 4-digit number with an odd number of factors (easy one)

2. Set S contains elements { 6300, 2100, 1260, 900, 700, 6300/11, 6300/13, 420, ……….}, how many elements of Set S are integers?

3. f(k) gives the sum of all digits of number k. g(k) = f(f(f(…k))) such that we end up with a number from 1 to 9. How many 5-digit numbers n exist such that g(n) = 2

Discussion:

The questions sitting underneath the above statements are as follows

1. Give the smallest 4-digit number with an odd number of factors (easy one) => What is the smallest 4-digit perfect square?

2. Set S contains elements { 6300, 2100, 1260, 900, 700, 6300/11, 6300/13, 420, ……….}, how many elements of Set S are integers? => How many odd factors does 6300 have?

3. f(k) gives the sum of all digits of number k. g(k) = f(f(f(…k))) such that we end up with a number from 1 to 9. How many 5-digit numbers n exist such that g(n) = 2? => How many 5-digit number exist that when divided by 9 leave a remainder of 2?

1. Give the smallest 4-digit number with an odd number of factors (easy one) => What is the smallest 4-digit perfect square? 1024

2. Set S contains elements { 6300, 2100, 1260, 900, 700, 6300/11, 6300/13, 420, ……….}, how many elements of Set S are integers? => How many odd factors does 6300 have?

6300 = 2^2 * 3^2 * 5^2 * 7. Number of odd factors of this number = (2+1) * (2+1) * (1+1) = 18. For discussion on number of odd factors, look here .

3. f(k) gives the sum of all digits of number k. g(k) = f(f(f(…k))) such that we end up with a number from 1 to 9. How many 5-digit numbers n exist such that g(n) = 2? => How many 5-digit number exist that when divided by 9 leave a remainder of 2?

There are 90000 5-digit numbers. There will be 10000 numbers that leave a remainder of 2 on division by 9 within these. Answer = 10000.

g(n) mentioned above is identical to the remainder when a number is divided by 9. Once you pick that, this question become a sitter. Competitive exams are good at masking questions. As much as possible, learn from first principles. If one had thought about why the test of divisibility for 9 works, this bit would have been clear.

CAT 2013 Course offered by 2IIM @ ChennaiCourse handled by IIM Alumni, Batches @ Anna Nagar, Mylapore and Velachery.

Weekend batches @ Anna Nagar from 24th November, @ Mylapore from 17th November, @ Velachery from 18th November.

### Related posts

• December 9, 2009 CAT Practice Questions and Problems Have provided below links to web pages in Ascent Education from where you can access sample problems and practice questions in Quant section, Verbal section and the DI and LR Section of […] Posted in Mixed Bag
• December 10, 2010 Percentages – Solutions Have given below solutions to the first three questions on Percentages 1. a is x % of b, b is x% more than a. Find x? a = bx, b = a (1+x), substituting this in the previous […] Posted in Percentages
• February 27, 2014 Functions Question and Solution Question Consider set A with 'a' elements, set B with 'b' elements, set C with 'c' elements. We can define a function that is one-one but not onto from set A to set B, a function that […] Posted in Functions
• March 26, 2011 World Cup Special – Few maths questions My colleague mentioned that he had asked his class 1-2 questions on numbers related to the WC. Just thought it might be a good idea to follow that. 1. Australia, in one of their […] Posted in Mixed Bag