Interested to Buy Any Domain ? << Click Here >> for more details...
What is the smallest number which when divided by 10 leaves
a remainder of 9, when divided by 9 leaves a remainder of 8,
when divided by 8 leaves a remainder of 7, when divided by 7
leaves a remainder of 6 and so on until when divided by 2
leaves a remainder of 1?
- 3 Answers
- 29989 Views
- Banking, BSP, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / guest
The smallest such number is 2519.
The easiest way is to find the Least Common Multiple (LCM)
of 2, 3, 4, 5, 6, 7, 8 and 9. And subtract 1 from it.
The LCM of 2, 3, 4, 5, 6, 7, 8 and 9 is given by 2520.
Hence, the required number is 2519
| Is This Answer Correct ? | 90 Yes | 8 No |
The answer is LCM of 2,3,....9 and subtract 1 from the
result. Please not that every no divisible by 6 is
divisible by 2 & 3, also every number divisible by 8 is
divisible by 4, and any number divisible by 8 & 9 will be
divisible by 6. These are the fundas. hence the answer is
9*8*7*5 - 1 = 2519.
ofcourse this may not as easy to figure out as i siad
unless one is good at the math fundas.
| Is This Answer Correct ? | 34 Yes | 12 No |
Answer / jason
Or write a simple computer program...
while(true){
if(x%10 = 9 && x%9 = 8 && x%8 = 7 && x%7 = 6 && x%6 = 5
&& x%5 = 4 && x%4 = 3 && x%3 = 2 && x%2 = 1){
print(x);
break;
}
else{
x++;
}
}
| Is This Answer Correct ? | 16 Yes | 4 No |
prove that 1 + 1 = 1. use any logic, any method,any algorithm.. (its not a binary addition or logical OR gate).
An apple vendor has 1000 apples and 10 empty boxes. He asks his son to place all the 1000 apples in all the 10 boxes in such a manner that if he asks for any number of apples from 1 to 1000, his son should be able to pick them in terms of boxes. How did the son place all the apples among the 10 boxes, given that any number of apples can be put in one box.
1)You take a test, and 60% pass the first time and 40% fail. The second time around,80% pass the test and 20% fail. The third time, 90% pass and 10% fail. a. What is the probability that you pass on the 2nd time? b. What is the probability that you pass on the 3rd time? c. What is the probability you fail?
X is a 6 letter word 1 2 and 5 6 letters are the same 3 4 is a day 1 2 5 6 is go away 1 2 3 6 is fat and X is an international celebrity .. What is X ?
You have a sheet cake. There is a rectangular piece missing from the inside of the sheet cake. The location of the missing piece is arbitrary. I was told I could assume I had the means to make the cuts. How do you divide the sheet cake into 2 even proportions with 2 cuts?
15 Answers College School Exams Tests, Global Analytics, Google, Infosys, Oracle,
dil ke photo me teer kyu hota hai?
A positive integer that, when added to 1000 gives a sum which is greater than when multiplied by 1000. Find the positive integer.
Given an N × N array of positive and negative integers, find the sub-rectangle with the largest sum. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the maximal sub-rectangle. A sub-rectangle is any contiguous sub-array of size 1 × 1 or greater located within the whole array. Input Format: First line contains the size of matrix. Followed by n lines and each line contain n integers separated by space. Output format: Single integer which represents maximum sum of rectangle. Sample Input: 4 0 -2 -7 0 9 2 -6 2 -4 1 -4 1 -1 8 0 -2 Sample Output: 15
The cricket match between India and Pakistan was over. ? Harbhajan scored more runs than Ganguly. ? Sachin scored more runs than Laxman but less than Dravid ? Badani scored as much runs as Agarkar but less than Dravid and more than Sachin. ? Ganguly scored more runs than either Agarkar or Dravid. Each batsman scored 10 runs more than his immediate batsman. The lowest score was 10 runs. How much did each one of them score
o,t,t,f,f,s,s,_,_ fill the remaining....and tell me on 9022881719
Consider a chessboard with a single Rook. A Rook can move any number of square sideways/forward, but not diagonally. What is the minimum number of moves the Rook needs to make, in order to pass over all the squares on the chessboard and return to the original position?
You have 8 coins. 3 of them weigh x units, 3 y units, 1 a units and 1 b units. They are all mixed and look identical. You have to find the lightest coin in minimum number of weighing (balance)
English 
