Join 60,000+ competitive exam aspirants
If a 7-digit number 29009A6 is completely divisible by 7, what is the least value of A?
1
5
9
2 Question ID : 441009560201 Option 1 ID : 4410092196072 Option 2 ID : 4410092196073 Option 3 ID : 4410092196074 Option 4 ID : 4410092196071 Status : Answered Chosen Option : D
2 Question ID : 441009560201 Option 1 ID : 4410092196072 Option 2 ID : 4410092196073 Option 3 ID : 4410092196074 Option 4 ID : 4410092196071 Status : Answered Chosen Option : D
Calculate the remainder of the fixed part 2900906(mod7). Then solve (remainder+10A)тЙб0(mod7) by testing options 0-9.
The principle of the Euclidean division algorithm states that a number is divisible by 7 if the remainder of the division is zero.
Express the 7-digit number as 2900900+10A+6 and divide the base part by 7 to isolate the variable A.
A 7-digit number 29009A6 which is perfectly divisible by 7.
29009A6=2900906+10A
Calculate the remainder of the fixed part 2900906(mod7). Then solve (remainder+10A)тЙб0(mod7) by testing options 0-9.
Students often treat A as a multiplier for the entire 7-digit number rather than as a single digit at the tens place (10A).
Partition the number
Represent the number 29009A6 as the sum of a constant part and the variable part: 2900900+10A+6=2900906+10A.
2900906+10A
Divide constant part by 7
Perform the division 2900906├╖7. We find 2900906=7├Ч414415+1. Thus, the remainder is 1.
2900906тЙб1(mod7)
Solve for A
Substitute the remainder into the divisibility condition: 1+10AтЙб0(mod7). Since 10тЙб3(mod7), this simplifies to 1+3AтЙб0(mod7).
1+3AтЙб7,14,21...
Testing values for A
For A=1, 1+3(1)=4 (not divisible). For A=2, 1+3(2)=7, which is divisible by 7.
1+3(2)=7тЙб0(mod7)
D is correct because substituting A = 2 into the expression 2900926 gives a result that is exactly divisible by 7 (2900926/7=414418).
This method of isolating a variable in a position-based number system is a standard approach for problems involving unknown digits and divisibility rules for 7, 11, or 13.