0% found this document useful (0 votes)
16 views14 pages

iQuanta: CAT Prep Success Stories

iQuanta, founded in 2015 by Indrajeet Singh, started as a Facebook doubt-solving group and has since supported over 4 lakh students in their CAT preparation. The platform has successfully helped more than 8,000 students gain admission to IIMs, producing over 500 99 percentilers in 2024 alone. iQuanta continues to provide quality guidance and resources for aspiring B-school candidates through its online communities and courses.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views14 pages

iQuanta: CAT Prep Success Stories

iQuanta, founded in 2015 by Indrajeet Singh, started as a Facebook doubt-solving group and has since supported over 4 lakh students in their CAT preparation. The platform has successfully helped more than 8,000 students gain admission to IIMs, producing over 500 99 percentilers in 2024 alone. iQuanta continues to provide quality guidance and resources for aspiring B-school candidates through its online communities and courses.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

About iQuanta?

Founded in 2015 by Indrajeet Singh, iQuanta began as a Facebook

doubt-solving group from a small apartment. With strong expertise in

Quants, he earned the title ‘Wizard of Quant’ by solving thousands of

students' queries with clarity and speed. Noticing the lack of quality

guidance for CAT aspirants, he officially launched iQuanta to bridge

this gap.

Over the years, iQuanta has continued to support over 4 lakh students

through its active online communities, offering resources, and peer-driven

learning. In the last 5 years, more than 8,000 students have converted IIMs.

In 2024, iQuanta produced 500+ 99 percentilers, many of whom made it to

top IIMs. iQuanta continues to guide thousands of aspirants on their journey

to top B-schools.

5 Y e a rs ag o

N ow

Indrajeet Singh

Founder & CEO, iQuanta

Forbes 30 Under 30
For CAT Course, Visit: [Link] To Join CAT Preparation Group, click here Page 1
NUMBER SYSTEM

Important points to remember:

1. The product of ‘n’ consecutive natural numbers is always divisible by n!

2. Square of any natural number can be written in the form of 3n or 3n+1.

3. Square of a natural number can only end in 0, 1, 4, 5, 6 or 9. Second last


digit of a square of a natural number is always even except when last digit is
6. If the last digit is 5, second last digit has to be 2.

4. Any prime number greater than 3 can be written as 6k+1 or 6k -1.

5. Any two -digit number ‘mn’ can effectively be written as 10m+n and a
three-digit number ‘lmn’ can effectively be written as 100l+10m+n.

6. Sum of 1 st n natural number, 1+2+3+.....+n = Σn = n(n+1)/2

7. Sum of 1 st n positive even numbers, 2+4+6 -------


+2n = n(n+1)

8. Sum of 1 st n positive odd numbers, 1+3+5+ ------+(2n – 1) = n 2

9. Sum of squares of 1 st n natural numbers :


1 2+22+32+----+n2 = n(n+1)(2n+1)/6

ForIPMATCourse,visit: [Link]/ipmat ToJoinIPMATPreparationGroup ,clickhere4 |


For CAT Course, Visit: [Link] To Join CAT Preparation Group, click here Page 1
Page
10. Sum of cubes of 1 st n natural numbers :
1 3+23+33+--------+n3 = (Σn)2 = [n(n+1)/2] 2

11. 0 and 1 are neither composite nor prime.

12. There are 25 prime numbers less than 100.

13. There are 15 prime numbers less than 50.

Divisibilityrules

2 – when last digit of the number is 0, 2, 4, 6, 8.


4 – when last two digits of the number is 00 or divisible by 4.
8 - when the last three digits of the number is 000 or divisible by 8.
5 – when last digit is 0 or 5.
2n - when last n digits of the numbers are divisible by 2 n .
5n - when last n digits of the number are divisible by 5 n .

Divisibility rule for 3 and 9


3 – Sum of the digits should be divisible by 3.
9 – Sum of digits should be divisible by 9.

Divisibility rule for 7 and 11


7 - the difference between twice the unit digit of the given number and the
remaining part of the given number should be a multiple of 7 or it should be
equal to 0”.
For example, 798 is divisible by 7.

11 - if the difference between the sums of the alternate digits of the given
number is either 0 or divisible by 11, then the number is divisible by 11.

Divisibility rules of 6, 12, 14, 15, 18, etc.


Whenever we have to check the divisibility of a number N by a composite

number C, the number N should be divisible by all the prime factors (the
highest power of every prime factor) present in C.

Propertiesof factorsandco -prime numbers

For any natural number N = a x * by


cz...., where a , b, c.... are prime
*

numbers and x, y, z are their powers which are natural numbers. (N is prime
factorized here).

ForIPMATCourse,visit: [Link]/ipmat ToJoinIPMATPreparationGroup ,clickhere5 |


For CAT Course, Visit: [Link] To Join CAT Preparation Group, click here Page 2
Page
Number of factors of N = (x+1) (y+1) (z+1) ....
Number of even factors = same as above, but just consider one
power of 2 less while calculating.
Number of odd factors = (Total factors – even factors) OR remove 2 and its
powers from the prime factorization & find factors of rest of the odd part.

Remaindersand RemainderTheorems

Dividend = Divisor x Quotient + Remainder

Mod, which stands for modulus simply means ‘remainder’. So, the value of a
mod b is simply the remainder obtained on dividing a by b.

If Rem [ N1 /D] = R 1 ,Rem [ N2/D ] = R 2, .........., Rem [ Nm /D ] =R m then


i. Rem [ (N1 +N2+….+N m )/D] = Rem [(R 1 +R2+….+R m )/D ]
ii. Rem [(N1 *N2*….*N m )/D] = Rem [(R 1 *R2*….*R m )/D ]

iii. Negative Remainder: Sometimes we use negative remainder to find the


actual remainder easily. Let us try to understand it :-
We know that remainder when 19 is divided by 10 is 9 but we can also take
the remainder as –1 which is (9 – 10).

RemainderTheorems:

1. Wilson’s Remainder Theorem


(P− 1 ) !
For any prime number P, Rem [ P ], i.e.,
(P-1)! mod P = (P – 1) or – 1
18!
E.g., Rem [ 19 ] = 18 or -1

2. Euler’s Totient Theorem


. ( )
For two coprime numbers N and D, Rem [ ] = 1, where k is a natural
number and E(D) is Euler of the number D. (Calculation of how to calculate
Euler mentioned above).

Example: What is the remainder when 47 32 is divided by 51?


2 16
Solution: 51 = 3*17 so E (51) = 51* 3*17 = 32.
We can see that 47 and 51 are coprime, so using Euler’s remainder theorem,

ForIPMATCourse,visit: [Link]/ipmat ToJoinIPMATPreparationGroup ,clickhere6 |


For CAT Course, Visit: [Link] To Join CAT Preparation Group, click here Page 3
Page
For CAT Course, Visit: [Link] To Join CAT Preparation Group, click here
iQuanta CAT 2024 IIM Converts

IIM Ahmedabad Converts

Vedant Chandewar Swaraj Pal Raunak Das Siddhant Kumar

99.98%iler 99.95%iler 99.55%iler 99.42%iler

IIM Bangalore Converts

Mridul Tiwari Shaivi Goyal Rahul Sinha Aman Ehtesham

99.97%iler 99.54%iler 99.49%iler 99.94%iler

IIM Calcutta Converts

Mridul Tiwari Sanvie Singhal Chitturi Sakshvith


Madhumitha

99.98%iler 99.92%iler Sanjeev Sriharsha

99.86%iler 99.6%iler

And many more

For CAT Course, Visit: [Link] To Join CAT Preparation Group, click here
Why Students Love iQaunta

For CAT Course, Visit: [Link] To Join CAT Preparation Group, click here
N E W B A T C H L A U N C H E D

1300+ Hours 500+ Students scored 35 Mocks & 45


of Videos 99%ile in CAT 2024 Sectional Mocks

Kamal Lohia Raj Kumar Jha Prashant Chadha

CAT 99.99%iler
6 Times CAT
9 Times CAT,

QA, LRDI Expert QA 100%iler VARC 99%iler

Abhishek Leela Pandey Indrajeet Singh Shabana Ma'am

CAT 99.93%iler,
Founder & CEO
CAT VARC

GMAT 770 Wizard of Quant 99.5+%iler

For CAT Course, Visit: [Link] To Join CAT Preparation Group, click here

Common questions

Powered by AI

Euler's Totient Theorem states that for two co-prime numbers N and D, the remainder of N^k divided by D is 1, where k is a natural number and φ(D) is Euler's totient function value of D. When applied, it helps in finding remainders efficiently .

iQuanta's impact has been significant, as evidenced by the conversion of more than 5,000 students to top IIMs over the years. The program has produced many high scorers, with 500+ students achieving the 99 percentile in CAT 2024 alone .

Indrajeet Singh, the founder and CEO of iQuanta, is notable for being recognized as a 'Wizard of Quant' for his expertise in solving thousands of students' doubts. Additionally, he has been featured in Forbes' '30 Under 30' .

The document details several properties, such as any 'n' consecutive natural numbers being divisible by n!, squares of natural numbers having specific end digits, prime numbers greater than 3 being expressible as 6k±1, and specific sums of series like the sum of the first n natural numbers and their squares .

iQuanta provides support to CAT aspirants through active online communities, resources, and peer-driven learning. It offers guidance and preparation materials tailored to help over 4 lakh students. As a result of these efforts, more than 5,000 students have been able to convert their admissions into top IIMs, and in 2024, iQuanta was instrumental in helping 500+ students achieve 99 percentiles .

iQuanta emphasizes a peer-driven online community model focused on interactive learning, which contrasts with traditional models' more passive learning. This approach leverages social platforms for doubt-solving and accessibility, fostering a collaborative rather than transactional learning environment .

To test divisibility by 7, the rule is to take twice the unit digit of the number and subtract it from the rest of the number. If the result is a multiple of 7 or zero, the original number is divisible by 7 .

For numbers divisible by 2^n, the last n digits of the number must also be divisible by 2^n. Similarly, for divisibility by 5^n, the last n digits need to be divisible by 5^n .

The document suggests using remainder properties strategically, such as employing negative remainders to find actual remainders more efficiently, illustrated with examples of converting positive remainders into negative ones for ease of calculation .

Wilson's Remainder Theorem is significant because it provides a way to calculate remainders for factorials. It states that for any prime number P, the remainder of (P-1)! when divided by P is P-1 or -1. This property is useful in verifying prime numbers and solving factorial remainder problems .

You might also like