Professional Documents
Culture Documents
10B
每題 10 分,共 100 分。
每題 10 分,共 100 分。
──────────────────────────────────────────
──────────────────────────────────────────
計算 16!-15!-13! 的最大質因數是多少?
計算 16!-15!-13! 的最大質因數是多少?
──────────────────────────────────────────
1 1 1 1
3) How many positive integer solutions (x, y) satisfy + + = 2021 ?
x y xy
1 1 1 1
滿足 + + = 2021 的正整數解(x,y)共有多少組?
x y xy
1 1 1 1
滿足 + + = 2021 的正整數解(x,y)共有多少組?
x y xy
──────────────────────────────────────────
4) Make f (n) represent the sum of the square of each digit of n. For example, f (12)=12+22=5.
2 3 2021
If f (n)=f ( f (n)), f (n)=f ( f ( f (n))), find f (2021).
2 3
令 f (n)表示 n 的各位數字平方的總和,例如:f (12)=12+22=5,且 f (n)=f ( f (n)),f (n)
2021
=f ( f ( f (n))),…,試求 f (2021)之值為何?
2 3
令 f (n)表示 n 的各位數字平方的總和,例如:f (12)=12+22=5,且 f (n)=f ( f (n)),f (n)
2021
=f ( f ( f (n))),…,試求 f (2021)之值為何?
──────────────────────────────────────────
1
5) Set both p and q 2-digit prime numbers that satisfy p2-q2=2p+10q+24. Find the number of
pairs of (p, q).
設 p 和 q 都是二位的質數,滿足 p2-q2=2p+10q+24,則數對(p,q)有多少組?
設 p 和 q 都是二位的質數,滿足 p2-q2=2p+10q+24,則數對(p,q)有多少組?
──────────────────────────────────────────
6) As shown in the picture, a semi-sphere glass cover whose radius is 1 is placed on a horizontal table.
The 5 identical glass spheres which are beneath the glass cover are tangent to it. Given that 4 of the
spheres are tangent to the surface of the table, and the other 1 sphere which is above the 4 spheres is
tangent to them and to the glass cover. If the centers of the 5 spheres happen to form a positive
m
quadrangular pyramid whose volume is , and (m, n)=1, find m+n.
n
──────────────────────────────────────────
7) Arrange ten numbers 1~10 into a sequence. For example, 5, 2, 1, 8, 10, 9, 6, 7, 3, 4 is one of the
ways. If Sn represents the sum of the first n numbers, how many prime numbers are there in S1, S2,
…, S10 at most?
──────────────────────────────────────────
2
8) There are 100 Pokermon cards which are marked 1~100 on the table. Paul and Allen take the card
in turns in the following way: Paul takes first. If he takes card #n, then Allen can take card #2n+2
(this also means that there are certain cards for Allen to take, but not for Paul). How many cards can
Paul take at most?
──────────────────────────────────────────
若 T=m×2n,且(m,n)=1,則 m+n=?
若 T=m×2n,且(m,n)=1,則 m+n=?
──────────────────────────────────────────