#1
24th July 2014, 08:11 AM
| |||
| |||
Prepare to Solve Tricky Aptitude Question
Can you give me name of some best books that will be useful to solve Aptitude Questions in various competitive examinations ?
|
#2
24th July 2014, 10:35 AM
| |||
| |||
Re: Prepare to Solve Tricky Aptitude Question
Here I am giving you name of some best books that will be useful to solve Aptitude Questions in various competitive examinations . Quantitative Aptitude by S. N. Jha Publisher: Ramesh Publishing House Quantitative Aptitude Practice Workbook By G.K.P.Publisher: G. K. Publications Pvt. Ltd Quantitative Aptitude Test By Dr. N. K. Singh Publisher: Upkar Prakashan (2008) Quantitative Aptitude by R. S. Aggarwal Publisher: S. Chand Publisher (2010) Quantitative Aptitude For Competitive Examinations 17th Edition Author: R. S. Aggarwal ![]() Quantitative Aptitude for Competitive Examinations [Paperback] R. S. Aggarwal (Author) ![]() Quantitative Aptitude for Competitive Examination [Paperback] Abhijit Guha (Author) ![]() UPSC - Civil Services Aptitude Test: Test Paper II [Paperback] RPH Editorial Board (Author) ![]() |
#3
24th February 2015, 01:02 PM
| |||
| |||
Re: Prepare to Solve Tricky Aptitude Question
Can you please give me some preparation tips to Solve Tricky Aptitude Question, because it is very difficult for me to clear this section?
|
#4
24th February 2015, 04:31 PM
| |||
| |||
Re: Prepare to Solve Tricky Aptitude Question
Don’t worry here I am giving you some preparation tips so that by follow these tips it will be easy for you to prepare Aptitude Question Preparation tips Learn tables till 20 Don’t leave any questions Make your own personal Formulas book Practice daily Use Shortcuts to solve questions Every placement test on quantitative aptitude will contain at least 30% questions on number systems and number series Important Formulas of Number System Formulas of Number Series 1. 1 + 2 + 3 + 4 + 5 + … + n = n(n + 1)/2 2. (12 + 22 + 32 + ..... + n2) = n ( n + 1 ) (2n + 1) / 6 3. (13 + 23 + 33 + ..... + n3) = (n(n + 1)/ 2)2 4. Sum of first n odd numbers = n2 5. Sum of first n even numbers = n (n + 1) ________________________________________ Mathematical Formulas 1. (a + b)(a - b) = (a2 - b2) 2. (a + b)2 = (a2 + b2 + 2ab) 3. (a - b)2 = (a2 + b2 - 2ab) 4. (a + b + c)2 = a2 + b2 + c2 + 2(ab + bc + ca) 5. (a3 + b3) = (a + b)(a2 - ab + b2) 6. (a3 - b3) = (a - b)(a2 + ab + b2) 7. (a3 + b3 + c3 - 3abc) = (a + b + c)(a2 + b2 + c2 - ab - bc - ac) 8. When a + b + c = 0, then a3 + b3 + c3 = 3abc 9. (a + b)n = an + (nC1)an-1b + (nC2)an-2b2 + … + (nCn-1)abn-1 + bn ________________________________________ Shortcuts for number divisibility check 1. A number is divisible by 2, if its unit's digit is any of 0, 2, 4, 6, 8. 2. A number is divisible by 3, if the sum of its digits is divisible by 3. 3. A number is divisible by 4, if the number formed by the last two digits is divisible by 4. 4. A number is divisible by 5, if its unit's digit is either 0 or 5. 5. A number is divisible by 6, if it is divisible by both 2 and 3. 6. A number is divisible by 8, if the number formed by the last three digits of the given number is divisible by 8. 7. A number is divisible by 9, if the sum of its digits is divisible by 9. 8. A number is divisible by 10, if it ends with 0. 9. A number is divisible by 11, if the difference of the sum of its digits at odd places and the sum of its digits at even places, is either 0 or a number divisible by 11. 10. A number is divisible by 12, if it is divisible by both 4 and 3. 11. A number is divisible by 14, if it is divisible by 2 as well as 7. 12. Two numbers are said to be co-primes if their H.C.F. is 1. To find if a number, say y is divisible by x, find m and n such that m * n = x and m and n are co-prime numbers. If y is divisible by both m and n then it is divisible by x. |
|