100+ Number System Formulas for Competitive Exams

1. Natural Numbers: N = {1, 2, 3, ...}

2. Whole Numbers: W = {0, 1, 2, 3, ...}

3. Integers: Z = {..., -3, -2, -1, 0, 1, 2, 3, ...}

4. Rational Numbers: Can be expressed as p/q, where q != 0

5. Irrational Numbers: Cannot be expressed as p/q (e.g., sqrt(2), pi)

6. Real Numbers: All rational and irrational numbers

7. Even Number: Divisible by 2

8. Odd Number: Not divisible by 2

9. Prime Number: Has exactly two factors: 1 and itself

10. Composite Number: Has more than two factors

11. Co-prime Numbers: Two numbers whose HCF is 1

12. Twin Primes: Pair of prime numbers whose difference is 2

13. HCF × LCM = Product of two numbers

14. Total Number of Factors: If N = a^p × b^q, then total = (p+1)(q+1)

15. Sum of Factors: [(a^(p+1)-1)/(a-1)] × [(b^(q+1)-1)/(b-1)]

16. Perfect Square: All powers in prime factorization are even

17. Perfect Cube: All powers in prime factorization are multiples of 3

18. Number of Odd Factors: Count after removing power of 2

19. Number of Even Factors = Total Factors - Odd Factors

20. Fermat's Little Theorem: a^(p-1) === 1 (mod p), if p is prime and a not divisible by p

21. Euler's Theorem: a^phi(n) === 1 (mod n), if a and n are co-prime

22. Euler's Totient Function: phi(n) = n*(1 - 1/p1)*(1 - 1/p2)...

23. Division Algorithm: a = dq + r where 0 <= r < d

24. Unit Digit of Powers: Use unit digit cyclicity

25. Last Two Digits: Use binomial expansion or mod 100

26. Digital Root: Keep summing digits until single digit

27. Digital Root Shortcut: Equivalent to number mod 9 (if not 0)

28. Trailing Zeros in n!: Count of 5s in prime factorization = n/5 + n/25 + ...

29. Highest Power of Prime p in n!: n/p + n/p^2 + n/p^3 + ...

30. Sum of First n Natural Numbers: n(n+1)/2

31. Sum of Squares: n(n+1)(2n+1)/6

33. Sum of First n Odd Numbers = n^2

34. Sum of First n Even Numbers = n(n+1)

35. Divisibility by 2: Last digit is even

36. Divisibility by 3: Sum of digits divisible by 3

37. Divisibility by 4: Last 2 digits divisible by 4

38. Divisibility by 5: Last digit 0 or 5

39. Divisibility by 6: Number divisible by both 2 and 3

40. Divisibility by 8: Last 3 digits divisible by 8

41. Divisibility by 9: Sum of digits divisible by 9

42. Divisibility by 10: Last digit 0

43. Divisibility by 11: Difference of alternating digits divisible by 11

44. Repeating Decimal to Fraction: 0.333... = 3/9 = 1/3

45. HCF of two numbers using Euclid's algorithm: HCF(a,b) = HCF(b, a mod b)

46. LCM of fractions = LCM of numerators / HCF of denominators

47. HCF of fractions = HCF of numerators / LCM of denominators

48. All primes > 3 are of form 6k ± 1

49. If a divides b and b divides c, then a divides c

50. If a divides b and a divides c, then a divides (bx + cy) for integers x, y

51. Product of n consecutive numbers divisible by n!

52. Count of digits in base 10 = floor(log10(n)) + 1

53. A number is divisible by 7 if (double of last digit subtracted from rest) is divisible by 7

54. n^a - n^b is divisible by n^(a-b)

55. n^2 - 1 is always divisible by 8 if n is odd

56. For odd n, n^2 === 1 (mod 8)

57. If n is even, n^2 is divisible by 4

58. A number ending in 5 always has a square ending in 25

59. (a+b)^2 = a^2 + 2ab + b^2

60. (a-b)^2 = a^2 - 2ab + b^2

61. a^2 - b^2 = (a - b)(a + b)

62. a^3 + b^3 = (a + b)(a^2 - ab + b^2)

63. a^3 - b^3 = (a - b)(a^2 + ab + b^2)

64. If number is divisible by a, b and c, then it is divisible by LCM(a, b, c)

66. 0 is a multiple of every number

67. Number of zeros at end of n! = floor(n/5) + floor(n/25) + ...

68. Number divisible by 99: sum of 2-digit pairs divisible by 99

69. If sum of digits = multiple of 9, number divisible by 9

70. Square of number ending in 1, 4, 5, 6, 9 ends in same digit

71. Number ending in 3 or 7 has square ending in 9

72. If a^n mod m = 1, then order of a modulo m divides n

73. If p is prime and p divides a^k, then p divides a

74. nCr = n! / (r! * (n - r)!)

75. In any base-b: number = (dn * b^n + ... + d0)

76. Conversion from binary to decimal: Multiply each bit by 2^position

77. Binary of even number ends in 0, odd in 1

78. 2^n has n+1 digits in binary

79. Sum of digits of 2^n < 9n

80. Sum of digits of perfect square not 2, 3, 7, 8

81. Number in form a^2 - b^2 is divisible by (a - b)(a + b)

82. If number N is divisible by both x and y, then N divisible by LCM(x,y)

83. Highest power of prime in product of n consecutive numbers is 1

84. For any integer n: n^5 - n is divisible by 30

85. a^4 mod 5 = 1 for a not divisible by 5

86. Any number raised to even power is positive

87. HCF(a, b, c) = HCF(HCF(a, b), c)

88. LCM(a, b, c) = LCM(LCM(a, b), c)

89. Perfect number: Equal to sum of its proper divisors

90. Amicable numbers: Each is sum of proper divisors of the other

91. If a mod m = r, then (ka) mod m = (kr) mod m

92. If a and b are divisible by n, then (a ± b) divisible by n

93. Largest number dividing a, b and c leaving same remainder r is HCF(a-b, b-c)

94. If x divides y, then HCF(x, y) = x

95. If x divides y, then LCM(x, y) = y

96. If a === b (mod m), then a^k === b^k (mod m)

97. Count of numbers <= n divisible by x = floor(n/x)

99. Sum of first n cubes = (n(n+1)/2)^2

100. Difference of squares of two consecutive numbers = 2n + 1