Computer Science · Algorithms
What is the primary step in computing the prime factors of an integer n?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Subtract 1 from n repeatedly
- 2Multiply n by its smallest divisor
- 3Add n to the list of prime numbers
- 4Divide n by the smallest possible prime divisor until it cannot be divided further✓
Correct answer
Divide n by the smallest possible prime divisor until it cannot be divided further
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
Preparing for Computer Science?
Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms