A digital security pin uses 4 digits. The 1st is the only even prime. 2nd is smallest odd prime. 3rd is neither prime nor composite. 4th is HCF of 2 and 4. What is the pin?

Answer: 2312. Even prime: 2. Smallest odd prime: 3. Neither: 1. HCF(2,4): 2. Result: 2312.

Why is $\pi$ considered an Irrational number even though we frequently use $22/7$ to substitute it?

Answer: 22/7 is just an approximation. $\pi$ is non-terminating and non-repeating. $22/7$ is a rational fraction that merely approximates the value locally.

If an integer 'x' is divisible by 9, does it guarantee that the sum of its digits is EXACTLY 9?

Answer: No, multiple of 9. The sum of digits could be 18, 27, 36, etc. It must be a multiple of 9, not necessarily 9 itself.

Can a number ending in 2, 3, 7, or 8 ever be a perfect square?

Answer: No. Squaring digits 0-9 yields endings of 0, 1, 4, 5, 6, 9. Numbers ending in 2, 3, 7, 8 can never be perfect squares.

If a calculation yields power $N = 40$ in a cylicity puzzle of Base 7, what is the mistake in writing $7^{40} \implies 7^0 = 1$?

Answer: 0 means Cycle of 4. Remainder 0 means the sequence has hit the 4th (last) step of its cycle. You must evaluate $7^4 \to 1$. Though identical for 7, for Base 2 ($2^4=6$), evaluating $2^0=1$ would be disastrous.

In finding trailing zeroes of factorials, why do we solely divide by 5 and ignore counting 2s?

Answer: 2s are always abundant. Zeroes require a pair of $(2 \times 5)$. In $N!$, odd digits ensure fewer 5s exist than 2s. The limiting constraint is thus the quantity of 5s.

Is 1 considered a Prime Number or a Composite Number?

Answer: Neither. A prime must have exactly two distinct divisors. 1 has only one divisor (itself). It is technically a Unit.

What identifies the structural parity of the product of two odd numbers?

Answer: Always Odd. Odd $\times$ Odd = Odd. Example: $3 \times 5 = 15$. There is no factor of 2 available to make it even.

If $N$ is divided by $d$, giving remainder $r$, what happens to the remainder if $2N$ is divided by $d$?

Answer: Remainder is 2r (or 2r mod d). Remainder properties scale linearly. The new remainder is $2r$, but must be evaluated modulo $d$ if $2r \ge d$.

When testing for divisibility by 6, what criteria must the number explicitly satisfy?

Answer: Divisible by both 2 and 3. Since 6 is structurally $2 \times 3$ (coprimes), any number divisible by 6 must independently satisfy rules for both 2 (Even) and 3 (Sum).

Find the unit digit of $123^{45}$.

Answer: 3. Base digit 3. Cycle is 4. Power $45/4 \to$ Remainder 1. $3^1 = 3$.

Which of the following is strictly divisible by 9?

Answer: 4536. Sum of digits for 4536 is $4+5+3+6 = 18$. 18 is a multiple of 9.

Find the mathematical remainder: $17^{200} \div 18$.

Answer: 1. $17 \div 18$ conceptually yields -1. $(-1)^{200} = +1$.

Find remainder when $67^{67} + 67$ is divided by 68.

Answer: 66. $(-1)^{67} + (-1) = -2$. Negative remainder -2 means $68 - 2 = 66$.

Number of trailing zeroes at the end of $100!$

Answer: 24. Divide by 5 algorithm: $100/5 = 20$. $20/5 = 4$. $20 + 4 = 24$ zeroes.

If $738A6A$ is perfectly divisible by 11, find digit A.

Answer: 9. Number: 7 3 8 A 6 A. Sum Odd places: $A + A + 3 = 2A + 3$. Sum Even places: $6 + 8 + 7 = 21$. Diff = $21 - (2A + 3) = 18 - 2A$. Must equal 0 or multiple of 11. Set $18 - 2A = 0 \implies 2A = 18 \implies A = 9$.

Smallest 3-digit number divisible by 7?

Answer: 105. First 3-digit is 100. $100/7 o Rem 2$. Add $7-2 = 5$. $100 + 5 = 105$.

Unit digit of $7^{105}$ is?

Answer: 7. $105 \div 4 o Rem 1$. $7^1 = 7$.

Exact fraction value of $0.63\bar{63} + 0.37\bar{37}$?

Answer: 100/99. Repeating decimals transform: $63/99 + 37/99 = 100/99$.

Which value is largest? $\sqrt[3]{4}, \sqrt{2}, \sqrt[6]{3}$

Answer: Cube root 4. Powers 1/3, 1/2, 1/6. LCM is 6. $(4^{1/3})^6 = 16$. $(2^{1/2})^6 = 8$. $(3^{1/6})^6 = 3$. 16 is largest $\to \sqrt[3]{4}$.

Find unit digit of $(234)^{100} + (234)^{101}$

Answer: 0. Base ends in 4. Cycle is 2. $4^{even} = 6$. $4^{odd} = 4$. $6 + 4 = 10 o$ Unit digit 0.

How many prime numbers exist universally between 1 and 50?

Answer: 15. Direct memorization fact: There are 15 primes below 50, and exactly 25 primes strictly below 100.

Remainder when $2^{31}$ is divided by 5?

Answer: 3. Fermat's little theorem variation, or Cyclicity: $2^1=2, 2^2=4, 2^3=8(3), 2^4=16(1)$. Cycle of 4. $31 \div 4 o Rem 3$. 3rd element is 3.

A number divided by 899 gives remainder 63. Same divided by 29, rem is?

Answer: 5. Since 899 is a multiple of 29, directly divide the old remainder. $63 \div 29$. $29 \times 2 = 58$. Rem = $63-58 = 5$.

Sum of the first 50 natural numbers analytically evaluates to?

Answer: 1275. Gauss Formula: $n(n+1)/2$. $50 \times 51 / 2 = 25 \times 51 = 1275$.

Find number of zeroes at end of $1^1 \times 2^2 \times 3^3 \times ... \times 10^{10}$?

Answer: 15. Total 5s construct zeroes. At base 5: $5^5$ gives five 5s. At base 10: $10^{10} = 2^{10} \times 5^{10}$ gives ten 5s. Sum = $5 + 10 = 15$.

If $n$ is any natural integer, $n^3 - n$ logically must ALWAYS be divisible by?

Answer: 6. Factor: $n(n^2 - 1) = (n-1)n(n+1)$. This represents the product of three consecutive integers. Mathematically, it must contain a factor of 2 and 3. $2 \times 3 = 6$.

Smallest integer divisible by 12, 15, 20 but leaves uniform remainder 4?

Answer: 64. LCM(12, 15, 20) = 60. Format = $LCM \times K + R$. Smallest is $K=1$. $60 + 4 = 64$.

Determine exact remainder of $(1! + 2! + 3! + ... + 100!) \div 12$.

Answer: 9. $4! = 24$, which is cleanly div by 12. Every factorial after is a multiple of 24, thus rem 0. Sum $1!+2!+3! = 1+2+6 = 9$.

Deduce the Highest Common Factor (HCF) of $2^{100}-1$ and $2^{120}-1$.

Answer: 2^{20}-1. Euler's generic property: $HCF(a^m-1, a^n-1) = a^{HCF(m, n)} - 1$. HCF(100, 120) = 20. Result: $2^{20}-1$.

Home/Rajasthan 4th Grade Exam/Mathematics/

Number System

The foundation of all math. Master Divisibility Rules, Unit Digits, and Remainder Theorems to solve complex problems without calculation.

Expert Answer & Key Takeaways

The foundation of all math. Master Divisibility Rules, Unit Digits, and Remainder Theorems to solve complex problems without calculation.

1. Classification of Numbers

Understand the family tree of numbers.

Rational (Q): Terminating or Repeating decimals ( $p/q$ ).
Irrational: Non-terminating, Non-repeating (e.g., $\sqrt{2}, \pi$ ).
Prime Numbers: Only two factors (1 and itself). 2 is the ONLY even prime. 1 is NEITHER prime NOR composite.

Example:

Q: Is

\pi

rational or irrational?

Solution:

\pi

never ends and never repeats. It is Irrational. However,

22/7

is Rational (approximation).

2. Unit Digit Strategy (Cyclicity)

Last digit of

a^n

0, 1, 5, 6: Same unit digit.
4, 9: Cycle of 2.
2, 3, 7, 8: Cycle of 4. Divide power by 4, use remainder.

Example:

Q: Find unit digit of

2^{33}

Solution:

33 \div 4 \to Remainder 1

2^1 = 2

3. Divisibility Rules (The Sniper Tool)

Check divisibility instantly.

3 & 9: Sum of digits.
4 & 8: Last 2 / Last 3 digits.
11: (Sum of Odd places) - (Sum of Even places) = 0 or multiple of 11.

Example:

Q: Is 9182736 divisible by 9?

Solution: Sum = 36. Divisible! Yes.

4. Remainder Theorems (Power Tricks)

Solve large power remainders.

Negative Remainder: e.g., $17/18 o Rem -1$ .
Fermat's Theorem: $a^{p-1}/p o Rem 1$ (p is prime).

Example:

Q: Find remainder:

17^{200} div 18

Solution:

(-1)^{200} = +1

. Ans: 1.

Course4All Editorial Board

Verified Expert

Subject Matter Experts

Comprising experienced educators and curriculum specialists dedicated to providing accurate, exam-aligned preparation material.

Pattern: 2026 Ready

Updated: Weekly

← Previous TopicQuadratic Equations

Next Topic →Surds & Indices

Found an issue or have a suggestion?

Help us improve! Report bugs or suggest new features on our Telegram group.

Number System

Expert Answer & Key Takeaways

1. Classification of Numbers

2. Unit Digit Strategy (Cyclicity)

3. Divisibility Rules (The Sniper Tool)

4. Remainder Theorems (Power Tricks)

Course4All Editorial Board

Explore More Mathematics

Surds & Indices

Percentage

Ratio & Proportion

Partnership

Found an issue or have a suggestion?