IMPORTANT FOR APTITUDE

SQUARES: 

12 = 1

 22 = 4

32 = 9

42 = 16

52 = 25

62 = 36

72 = 49

82 = 64

92 = 81

102 = 100

112 = 121

122 = 144

132 = 169

142 = 196

152 = 225

162 = 256

172 = 289

182 = 324

192 = 361

202 = 400

212 = 441

222 = 484

232 = 529

242 = 576

252 = 625

 


TRICK: Add consecutive odd numbers to get the squares

Ex: 1. 12 = 1 
       2. 1+3=4 
       3. 4=22


CUBES:

13 = 1

23 = 8

33 = 27

43 = 64

53 = 125

63 = 216

73 = 343

83 = 512

93 = 729

103 = 1000

113 = 1331

123 = 1728

133 = 2197

143 = 2744

153 = 3375

163 = 4096

173 = 4913

183 = 5832

193 = 6859

203 = 8000

213 = 9261

223 = 10648

233 = 12167

243 = 13824

253 = 15625

263 = 17576

273 = 19683

283 = 21952

293 = 24389

303 = 27000


Please keep waiting for more updates....!

Comments

Post a Comment

Popular posts from this blog

CODING QUESTION 3 Odd Sum (CODECHEF OCTOBER COOK-OFF CHALLENGE 2021)   Given an integer   N , consider all arrays  A  of size  N   such that: All the elements are non-negative and distinct. All prefix sums are odd. Formally, for all  i i  such that  1 ≤ i ≤ N ,  ∑ i j = 1 A i  is odd. Among all possible arrays  A , output the smallest possible sum of the elements of the array. Note : Since the Input/Output may be large, it is preferred to use fast I/O. Input Format The first line contains  T  - the number of test cases. Then the test cases follow. The first line of each test case contains  N  - the size of the array. Output Format For each test case, output on one line the smallest sum among all arrays satisfying the constraints. Constraints 1 ≤ T ≤ 10 6 1 ≤ N ≤ 10 9 Sample Input 1  1 3 Sample Output 1  3 Explanation Test case  1 : A possible array is  [ 1 , 2 , 0 ] .  [ 1 ...
Read more
 CODING QUESTION 2 Average Flex (CODECHEF OCTOBER COOK-OFF CHALLENGE 2021) There are  N students in a class, where the  i -th student has a score of  A i . The  i -th student will  boast  if and only if the number of students scoring less than or equal  A i  is greater than the number of students scoring greater than  A i . Find the number of students who will boast. Input Format The first line contains  T  - the number of test cases. Then the test cases follow. The first line of each test case contains a single integer  N  - the number of students. The second line of each test case contains  N integers  A 1 , A 2 , … , A N  - the scores of the students. Output Format For each test case, output in a single line the number of students who will boast. Constraints 1 ≤ T ≤ 1000 1 ≤ N ≤ 100 0 ≤ A i ≤ 100 Sample Input 1  3 3 100 100 100 3 2 1 3 4 30 1 30 30 Sample Output 1  3 2 3 Explanati...
Read more