Please enter the following details
Free Daily Targets & Mocks
Study Material & Formulas PDFs
1 on 1 Mentorship
Instructions
Refer to the following data and answer the questions that follow:
A numerical machine accepts two values X and Y. Then it updates these values as X = XY and Y = Y + 1 in every step. The machine stops at X $$\geq$$ N.
Question 51
For X = 3, Y = 2 and N = 100, how many steps are performed before the machine stops?
Solution
X = 3, Y = 2 and N = 100
Step 1. X=6 Y=3
Step 2. X=18 Y=4
Step 3. X=72 Y=5
Step 4. X=360 Y=6
Hence Option C is correct.
Create a FREE account and get:
- All Quant Formulas and shortcuts PDF
- 170+ previous papers with solutions PDF
- Top 5000+ MBA exam Solved Questions for Free
SNAP Quant Questions | SNAP Quantitative Ability
SNAP Inequalities QuestionsSNAP Progressions and Series QuestionsSNAP Time, Distance and Work QuestionsSNAP Geometry QuestionsSNAP Data Sufficiency Questions
