翰林国际教育全网首发
力争超快速发布最全资料
助你在升学路上一帆风顺
为你
千千万万遍
共计2.5小时考试时间
此套试卷由三部分题目组成
4题简答题,每题4分
4题挑战题,每题6分
4题解答题,每题10分
共计12题,满分80分
不可使用任何计算器
完整版下载链接见文末
Part A Introductory Questions:
Question A3)In the figure below, the circles have radii 1, 2, 3, 4, and 5. The total area that is contained inside an odd number of these circles is m for a positive number m. What is the value of m?
Question A4)A positive integer is said to be bi-digital if it uses two different digits, with each digit used exactly twice. For example, 1331 is bi-digital, whereas 1113, 1111, 1333, and 303 are not. Determine the exact value of the integer b, the number of bi-digital positive integers.
Part B Challenging Questions:
Question B3)Teams A and B are playing soccer until someone scores 29 goals. Throughout the game the score is shown on a board displaying two numbers – the number of goals scored by A and the number of goals scored by B. A mathematical soccer fan noticed that several times throughout the game, the sum of all the digits displayed on the board was 10. (For example, a score of 12 : 7 is one such possible occasion). What is the maximum number of times throughout the game that this could happen?
Part C Long-form Proof Problems:
Question C3)Alphonse and Beryl play the following game. Two positive integers m and n are written on the board. On each turn, a player selects one of the numbers on the board, erases it, and writes in its place any positive divisor of this number as long as it is different from any of the numbers previously written on the board. For example, if 10 and 17 are written on the board, a player can erase 10 and write 2 in its place. The player who cannot make a move loses. Alphonse goes first.
完整版真题资料可以底部二维码免费领取↓↓↓
翰林课程体验,退费流程快速投诉邮箱: yuxi@linstitute.net 沪ICP备2023009024号-1