Loading [MathJax]/jax/output/CommonHTML/fonts/TeX/fontdata.js

User interface language: English | Español

Date November 2012 Marks available 2 Reference code 12N.3dm.hl.TZ0.4
Level HL only Paper Paper 3 Discrete mathematics Time zone TZ0
Command term State Question number 4 Adapted from N/A

Question

State Fermat’s little theorem.

Markscheme

if p is a prime (and a0(mod with a \in \mathbb{Z}) then     A1

{a^{p - 1}} \equiv 1(\bmod p)     A1

[2 marks] 

Note: Accept {a^p} \equiv a(\bmod p) .

Examiners report

Fermat’s little theorem was reasonably well known. Some candidates forgot to mention that p was a prime. Not all candidates took the hint to use this in the next part.

Syllabus sections

Topic 10 - Option: Discrete mathematics » 10.6 » Fermat’s little theorem.

View options