Discussion
Home ‣ Aptitude ‣ Numbers Comments
- Question
Find the unit digit of 4198 + 612345 + 34866 + 2411 + 1.
Options- A. 3
- B. 2
- C. 1
- D. 0
- Correct Answer
- 1
ExplanationGiven that,
Now Power Cycle of4 is 4, 6
6 is 6
8 is 8, 4, 2, 6
1 is 1
- 198 is even number , So the unit digit value is 6
- It is always 6
- 66/4 the remainder is 2 , So the second value is 4
- 11 is odd number, So the unit digit value is 4
1 - It is always 1
Total = 21Therefore, The unit digit is 1
- 1. A piece of ribbon 4 yards long is used to make bows requiring 15 inches of ribbon for each. What is the maximum number of bows that can be made?
Options- A. 8
- B. 9
- C. 10
- D. 11 Discuss
- 2. If the number 517?324 is completely divisible by 3,then the smallest whole number in place of ? will be:
Options- A. 2
- B. 1
- C. 3
- D. 7 Discuss
- 3. How many of the following numbers are divisible by 132? 264,396,462,792,968,2178,5184,6336
Options- A. 4
- B. 5
- C. 6
- D. 7 Discuss
- 4. What smallest number should be added to 4456 so that the sum is completely divisible by 6 ?
Options- A. 4
- B. 3
- C. 2
- D. 1 Discuss
- 5. The sum of the two numbers is 12 and their product is 35.What is the sum of the reciprocals of these numbers?
Options- A. 12/35
- B. 1/35
- C. 35/8
- D. 7/32 Discuss
- 6. n is a whole number which when divided by 4 gives 3 as remainder. What will be the remainder when 2*n is divided by 4 ?
Options- A. 3
- B. 2
- C. 1
- D. 0 Discuss
- 7. At a dinner party every two guests used a bowl of rice between them, every three guests used a bowl of dal between them and every four used a bowl of meat between them. There were altogether 65 dishes. How many guests were present at the party ?
Options- A. 60
- B. 74
- C. 82
- D. 58 Discuss
- 8. Which natural number is nearest to 8485, which is completely divisible by 75 ?
Options- A. 8475
- B. 8500
- C. 8550
- D. 8525 Discuss
- 9. Find the next number in the series 3, 4, 5, 5, 12, 13, 7, 24, 25, 8, 15, ...
Options- A. 26
- B. 16
- C. 17
- D. 18 Discuss
- 10. If x and y are the two digits of the number 653xy such that this number is divisible by 80, then x+y is equal to ?
Options- A. 5
- B. 4
- C. 3
- D. 2 Discuss
Numbers problems
Search Results
Correct Answer: 9
Explanation:
The maximum number of bows will be 4 yards (= 4 x 36 inches) divided by 15 inches.
This gives 9.6. But as a fraction of a bow is no use, we can only make 9 bows.
Correct Answer: 2
Explanation:
Sum of digits = (5 + 1 + 7 + x + 3 + 2 + 4) = ( 22 + x ), which must be divisible by 3.
When x=2. [(22 + 2) = 24 is divisible by 3]
So, the answer is 2
Correct Answer: 4
Explanation:
132 = 4 x 3 x 11, So if the number is divisible by all three numbers 4,3 and 11,then the number is divisible by 132 also.
264 => 4,3,11(/)
396 => 4,3,11(/)
462 => 11,3
792 => 4,3,11(/)
968 => 11,4
2178 => 11,3
5184 => 3,4
6336 => 4,3,11(/)
Required number of numbers=4.
Correct Answer: 2
Explanation:
6)4456(742
42
--------
25
24
-------
16
12
-----
4
------
Required number = (6-4) = 2.
Correct Answer: 12/35
Explanation:
Let a and b are the numbers.Then a+b is 12 and ab is 35.
a+b/ab = 12/35
1/b + 1/a = 12/35
Correct Answer: 2
Explanation:
Let n=4*q + 3. Then, 2*n = 8*q + 6 = 4(2*q + 1) + 2.
Thus when 2*n is divided by 4, the reminder is 2.
Correct Answer: 60
Explanation:
Let,
no. of rice bowl = x
no. of dal bowl = y
no. of meat bowl = z
Then, x + y + z = 65 ....(1)
Also given that, 2x = 3y = 4z
substituting value of y & z in terms of x i.e. y = 2x/3 and z = x/2 in eq (1),
We get x = 30.
As 1 rice bowl is shared between 2 guests,
Therefore, there are 60 guests.
Correct Answer: 8475
Explanation:
On dividing we get
75)8485(113
75
------
98
75
------
235
225
------
10
------
Required number = (8485-10)=8475.
Correct Answer: 17
Explanation:
The pattern is , ,
The next number =
i.e. 17
Correct Answer: 2
Explanation:
Since 653xy is divisible by 5 as well as 2, so y = 0.
Now, 653x0 must be divisible by 8.
So, 3x0 must be divisible by 8. This happens when x = 2
x + y = (2 + 0) = 2.
Comments
There are no comments.More in Aptitude:
Programming
Copyright ©CuriousTab. All rights reserved.