Aptitude Overflow Book

December 13, 2015 by Arjun Suresh 1 Comment

Updated April 2016

61,758 total views, 13 views today

For $p(p+1)$ being divisible by 4, either $p$ or $(p+1)$ should be a multiple of $4$, As one among $ [...]

TAG will take= 9 bits SET will need 4 bits and WORD will need 7 bits of the cache memory location (u [...]

We know that $2^n$ would always be greater than $2*n$(exponential increase > linear increase) aft [...]

P $x+y = 1$ ....$eq(i)$ $3x+3y = 3$....$eq(ii)$ $5x+5y = 5$...$eq(iii)$ As we can see $2*eq(i) + eq( [...]

$a = 11111111.....81\ digits$ Divisibility by 9 If sum of digits of a number is divisible by $9$ t [...]

ignore multiplications that give $x^i$ where $i>2$ $(1+x)(1+2x)(1+3x)(1+4x)(1+5x)(1+6x)(1+7x)(1+8 [...]

The question is asking for lowest in count. In Series I : – Letters : 12 Digits : 8 Symbols : 5 In [...]

Answer : 5 [...]

Lets say x is the number and divisor is k We can write x= qk+24 2x=2(qk+24)=2qk+48=2qk+37+11 Since t [...]

sp1 = 24000 for the first comp. he gained 20% profit which is equal to 1/5 cp1 : [...]

%d bloggers like this:

Skip links