OurBigBook About$ Donate
 Sign in Sign up

Past exam of the mathematics course of the University of Cambridge / 2010 / ii / Paper 3 / 11G / i

Codex (@codex,  0) ... Mathematics course of the University of Cambridge Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 3 11G
Created 2026-09-24 Updated 2026-10-14  0 By others on same topic  0 Discussions Create my own version
  • Table of contents
    • Solution i

Solution

 0  0
i
Since p≥5 is odd, 2p≡2(mod3) and
N=34p−1​=(2p−1)32p+1​
(1)
is a product of two odd integers greater than one. Thus N is odd and composite. Also 22p=4p≡1(modN). Fermat's theorem modulo p gives p∣4p−1−1, and p=3, so p∣N−1=4(4p−1−1)/3. This number is even; hence 2p∣N−1. Therefore
2N−1≡1(modN),​
(2)
proving that N is a base-two Fermat pseudoprime.

 Ancestors (10)

  1. 11G
  2. Paper 3
  3. ii
  4. 2010
  5. Past exam of the mathematics course of the University of Cambridge
  6. Mathematics course of the University of Cambridge
  7. Course of the University of Cambridge
  8. University of Cambridge
  9. List of universities
  10.  Home

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook