cn sum1 plz help me out wid dis 1...... all the nine digits are arranged here so as to form four square numbers 9 81 324 576 how wld you put them together so as to form a single smallest and single largest square number respectively???? kindly...
all the nine digits are arranged here so as to form four square numbers 9 81 324 576 how wld you put them together so as to form a single smallest and single largest square number respectively???? kindly send in your solution wid d explanations.......
groups of six 8s and 9s are divisible by 7. first 48 8s and last 48 9s are taken care of this way. Hence the number in the middle, 88A99 has to be divisible by 7. So A=5
can u plz elaborate on dis a lil more.... d 1st line???
Solution: the answer is 42...... any number ending with 5 can only occur once as any duplication will render it divisible by 10..... the same logic applies to any direct multiple of 10..... now 1 and 9 cannot appear together.... bt either of d two can appear and dat is possible in 10 ways........
Let A be a set of N different integers from the set (1,2,3....100) such that the sum of two different elements of A is never divisible by 10.The greatest possible value of N is.....a)42 b)41 c)49...pls do show the entire procedure.
Solution: the answer is 42...... any number ending with 5 can only occur once as any duplication will render it divisible by 10..... the same logic applies to any direct multiple of 10..... now 1 and 9 cannot appear together.... bt either of d two can appear and dat is possible in 10 ways...... same goes for 2 or 8, 3 or 7, 4 or 5..... so dat makes it 4*10=40 plus 2( for 5 and 10 as discuused before)..... thus the answr is 42
Your report does not guarantee removal of this content from the site. It will be removed altogether only if a Moderator finds it especially useless after reviewing it.