Number Systems
Everything on SkillVeris tagged Number Systems — collected across the glossary, study notes, blog, and cheat sheets.
11 resources across 1 library
Interview Questions(11)
How to Solve Surds and Indices Problems
Surds and indices problems reduce to applying the laws of exponents — a^m × a^n = a^(m+n), (a^m)^n = a^(mn), a^m / a^n = a^(m−n), and a^(1/n) = the nth root of…
How to Solve Logarithm Problems
A logarithm answers 'to what power must the base be raised to get this number' — log_b(x) = y means b^y = x — and logarithm problems are solved by converting b…
How to Find the Unit Digit of Large Powers
The unit digit of a^n is found by identifying the cyclicity of the base’s unit digit (a pattern that repeats every 1, 2, or 4 powers) and then computing n mod…
How to Solve Remainder Theorem Problems
Remainder theorem problems are solved by working entirely in modular arithmetic — reducing each factor or term to its remainder modulo the divisor before combi…
Divisibility Rules Every Candidate Should Know
Divisibility rules let you determine whether a number divides another exactly by inspecting a small, derived property of its digits — such as the last digit, d…
How to Count the Factors of a Number
The number of factors of N is found by writing its prime factorization N = p1^a1 × p2^a2 × ... × pk^ak, then multiplying (a1+1)(a2+1)...(ak+1) — one more than…
How to Find Trailing Zeros in a Factorial
The number of trailing zeros in n! equals the number of times 10 divides n!, which equals the number of times 5 divides n! (since factors of 2 always outnumber…
How to Solve Base Conversion Problems
Converting a number between bases means re-expressing the same quantity as a sum of powers of the new base, done by repeated division for base-to-decimal-and-b…
How to Find the Last Digit Using Cyclicity of Numbers
Cyclicity is the fact that the last digit of a^n repeats in a short, predictable pattern as n increases, so the last digit of any power can be found by reducin…
How to Solve HCF and LCM Word Problems
HCF (highest common factor) finds the largest quantity that divides all given numbers evenly, used for 'splitting into identical maximum-size groups’ problems,…
How to Find the LCM of Fractions
The LCM of fractions is computed as LCM(numerators) divided by HCF(denominators), the mirror image of the rule for HCF of fractions which is HCF(numerators) di…