🇮🇳 AMUEEE · subject

AMUEEE Mathematics Syllabus

Every chapter and topic of Mathematics examined in AMUEEE — 5 chapters, 10 topics, plus 54 flashcards written against it.

5Chapters
10Topics
0Sub-topics
~8hEst. first pass
29%Of AMUEEE
54Flashcards

Mathematics syllabus — full chapter and topic list

Expand any chapter to see its topics and sub-topics. This is the whole examinable outline for Mathematics in AMUEEE, not a summary of it.

  1. Sets and Functions

    2 topics
    • Sets
    • Relations & Functions
  2. Algebra

    2 topics
    • Principle of Mathematical Induction
    • Complex Numbers and Quadratic Equations
  3. Coordinate Geometry

    2 topics
    • Straight Lines
    • Conic Sections
  4. Calculus

    2 topics
    • Limits and Derivatives
    • Continuity and Differentiability
  5. Mathematical Reasoning

    2 topics
    • Mathematically inclined statements
    • Validating the statements

Mathematics flashcards for AMUEEE

21 of 54 cards from the Mathematics deck — real questions with worked answers.

  1. What is the formula for the number of subsets of a finite set with n elements?

    2^n subsets (including the empty set and the set itself); the number of proper subsets is 2^n - 1.

  2. State De Morgan's laws for two sets A and B.

    (A ∪ B)' = A' ∩ B' and (A ∩ B)' = A' ∪ B'.

  3. For finite sets, what is the inclusion-exclusion formula for n(A ∪ B ∪ C)?

    n(A)+n(B)+n(C) − n(A∩B) − n(B∩C) − n(A∩C) + n(A∩B∩C).

  4. Define the power set of a set A.

    The power set P(A) is the set of all subsets of A, including the empty set and A itself.

  5. What is the symmetric difference A Δ B of two sets?

    A Δ B = (A − B) ∪ (B − A) = (A ∪ B) − (A ∩ B); elements in exactly one of the sets.

  6. If set A has m elements and set B has n elements, how many relations exist from A to B?

    2^(mn), since a relation is any subset of the Cartesian product A × B which has mn elements.

  7. Define a one-one (injective) function.

    A function f is injective if distinct elements have distinct images: f(x₁)=f(x₂) implies x₁=x₂.

  8. Define an onto (surjective) function.

    A function f: A→B is surjective if every element of B is the image of at least one element of A, i.e. range = codomain.

  9. What condition makes a function bijective (invertible)?

    A function is bijective if it is both one-one (injective) and onto (surjective); only bijective functions are invertible.

  10. What is the domain and range of the function f(x) = 1/x?

    Domain: all real numbers except 0 (ℝ − {0}); Range: all real numbers except 0 (ℝ − {0}).

  11. How many functions can be defined from a set with m elements to a set with n elements?

    n^m functions.

  12. State the Principle of Mathematical Induction.

    If P(1) is true, and P(k) true implies P(k+1) true for all natural k, then P(n) is true for all natural numbers n.

  13. Using induction conventions, prove the formula for 1+2+...+n.

    1+2+...+n = n(n+1)/2; verified by base case n=1 and the inductive step P(k)⇒P(k+1).

  14. What is the sum of the first n squares, 1²+2²+...+n²?

    n(n+1)(2n+1)/6, a standard result provable by mathematical induction.

  15. Define the imaginary unit i and give the values of i², i³, i⁴.

    i = √(−1); i² = −1, i³ = −i, i⁴ = 1 (powers of i cycle every 4).

  16. What is the modulus of a complex number z = a + bi?

    |z| = √(a² + b²).

  17. What is the multiplicative inverse of z = a + bi?

    z⁻¹ = (a − bi)/(a² + b²) = conjugate of z divided by |z|².

  18. State the polar (modulus-argument) form of a complex number.

    z = r(cos θ + i sin θ), where r = |z| and θ = arg(z).

  19. Give the quadratic formula for ax² + bx + c = 0.

    x = [−b ± √(b² − 4ac)] / (2a).

  20. What does the discriminant b²−4ac tell you about the roots of a quadratic?

    If >0: two distinct real roots; if =0: two equal real roots; if <0: two complex conjugate roots.

  21. For ax²+bx+c=0, give the sum and product of the roots.

    Sum of roots = −b/a; product of roots = c/a.

See more Mathematics flashcards →

Planning Mathematics for AMUEEE

Mathematics is about 29% of the AMUEEE syllabus by topic count — 10 of 34 topics, spread over 5 chapters. At roughly 45 minutes per topic plus 12 minutes per sub-topic, a first pass runs to about 8 hours.

The heaviest chapters are Sets and Functions (2 topics), Algebra (2 topics), Coordinate Geometry (2 topics) . Front-load those while your energy is high; the short chapters are better revision filler later.

Work top-down: read the chapter, then tick topics off individually rather than marking the whole chapter done. Sub-topics are where silent gaps hide.

Mathematics (AMUEEE) FAQ

What is in the AMUEEE Mathematics syllabus?

Mathematics is split into 5 chapters — Sets and Functions, Algebra, Coordinate Geometry, Calculus and Mathematical Reasoning, containing 10 topics and 0 sub-topics in total.

How many chapters are there in Mathematics for AMUEEE?

5 chapters. Mathematics accounts for about 29% of the topics in the whole AMUEEE syllabus (10 of 34).

How long should I spend on Mathematics for AMUEEE?

Budget around 8 hours for a first pass through Mathematics — about 45 minutes per topic plus 12 minutes per sub-topic across its 10 topics. Add revision cycles on top.

Are there flashcards for AMUEEE Mathematics?

Yes — a 54-card Mathematics deck. Sample cards are printed on this page, and the full deck is free in the Examius app with spaced repetition scheduling.