返回题库

PUMaC 2010 · 代数(B 组) · 第 2 题

PUMaC 2010 — Algebra (Division B) — Problem 2

专题
Discrete Math / 离散数学
难度
L3
来源
PUMaC

题目详情

  1. Let p ( x ) = x + x + 1. Find the fourth smallest prime q such that p ( n ) is divisble by q for some integer n . √ √ √ √ 1 5 5 5 5 2 2
解析
  1. Let p ( x ) = x + x + 1. Find the fourth smallest prime q such that p ( x ) has a root mod q . Solution: 19. One can check that there are roots mod 3, 7, 13, and 19, and no others for smaller primes. √ √ √ √ 5 5 5 5 1 2 2 √