Home › Previous year questions › GATE 2015 CS (CS2) › Question 14GATE 2015 CS (CS2) – Question 14 Engineering Mathematics · Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) · 1 mark · Numerical answer
How many positive divisors does 2100 have?
Practise this question in The GATE Grind →
Show answer and explanation Correct answer: 36
Explanation Factor 2100=2²×3×5²×7. A divisor independently chooses each prime exponent between zero and its exponent in 2100. Therefore the divisor count is (2+1)(1+1)(2+1)(1+1)=36.
More Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) questions GATE 2015 CS (CS2) Q58 – How many onto functions map X=1,2,3,4 to Y=a,b,c? GATE 2015 CS (CS3) Q25 – How many four-digit numbers using only 1,2,3 have digits in nondecreasing order from left… GATE 2021 CS (CS2) Q60 – S has ten elements. How many ordered tuples (A,B) of subsets of S satisfy A⊆B? GATE 2026 CS (CS1) Q57 – Let G be an undirected graph, which is a path on 8 vertices. The number of matchings in G… GATE 2025 CS (CS1) Q30 – Let S be the set of all ternary strings defined over the alphabet \a,b,c\. Consider all… GATE 2023 CS Q15 – The Lucas sequence L n is defined by the recurrence relation: L n = L n-1 + L n-2, for n… All Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) questions →