Mathematics · Number Systems
Using Euclid's algorithm, the Greatest Common Divisor (GCD) of 48 and 18 is:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 13
- 212
- 36✓
- 42
Correct answer
6
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Number Systems MCQs →Want more practice questions on Number Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Number Systems