Scribd
Upload
68 views1 page

NQU Mod

The document lists 18 math problems of varying difficulty levels ranging from 1 to 6 points. The problems cover topics like number theory, modular arithmetic, factorials, and Diophantine equations. Scores will be based on the number of problems answered correctly, with more difficult problems being worth more points. Solving all problems correctly would result in a minimum score of 54 points.

Uploaded by

Raju Raj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
68 views1 page

NQU Mod

The document lists 18 math problems of varying difficulty levels ranging from 1 to 6 points. The problems cover topics like number theory, modular arithmetic, factorials, and Diophantine equations. Scores will be based on the number of problems answered correctly, with more difficult problems being worth more points. Solving all problems correctly would result in a minimum score of 54 points.

Uploaded by

Raju Raj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

§7 Problems

Minimum is [54 Ò]. Problems with the u symbol are required.

[1 Ò] Problem 1 Find the inverse of 2 (mod p) for odd prime p in terms of p.


[1 Ò] Problem 2 Find the remainder of 97! when divided by 101.
[1 Ò] Problem 3 (Find the remainder of (p − 2)! when divided by p, provided that p is prime.)
[2 Ò] Problem 4 (AMC 12A 2003/18) Let n be a 5-digit number, and let q and r be the quotient and the
remainder, respectively, when n is divided by 100. For how many values of n is q + r divisible by 11?
[2 Ò] Problem 5 (MAST Diagnostic 2020) How many integer values of 1 ≤ x ≤ 100 makes x2 + 8x + 5
divisible by 10?
[2 Ò] Problem 6 (1001 Problems in Number Theory) For which positive integers n is it true that 1 + 2 +
· · · + n | 1 · 2 · · · · · n?
1 1 1
[2 Ò] Problem 7 What is the residue of 1·2 · 2·3 · ··· · 11·12 (mod 13)?
[2 u] Problem 8 (AMC 10A 2020/18) Let (a, b, c, d) be an ordered quadruple of not necessarily distinct
integers, each one of them in the set 0, 1, 2, 3. For how many such quadruples is it true that a · d − b · c is
odd? (For example, (0, 3, 1, 1) is one such quadruple, because 0 · 1 − 3 · 1 = −3 is odd.)
[3 Ò] Problem 9 (AMC 10B 2018/16) Let a1 , a2 , . . . , a2018 be a strictly increasing sequence of positive
integers such that
a1 + a2 + · · · + a2018 = 20182018 .
What is the remainder when a31 + a32 + · · · + a32018 is divided by 6?
[3 Ò] Problem 10 (PUMaC 2018) Find the number of positive integers n < 2018 such that 25n + 9n is
divisible by 13.
[3 Ò] Problem 11 Prove φ(n) is composite for n ≥ 7.
[3 Ò] Problem 12 (AMC 10B 2019/14) The base-ten representation for 19! is 121, 6T 5, 100, 40M, 832, H00,
where T , M , and H denote digits that are not given. What is T + M + H?
[4 Ò] Problem 13 Find the remainder of 531 + 517 + 1 when divided by 31.
[4 Ò] Problem 14 Prove that the equation x2 + y 2 + z 2 = x + y + z + 1 has no solutions over the rationals.
[4 u] Problem 15 (MAST Diagnostic 2021) Find the remainder of (13 )(13 + 23 )(13 + 23 + 33 ) . . . (13 +
23 + 33 · · · + 993 ) when divided by 101.
p−1 
P 1
[6 Ò] Problem 16 Prove that for all prime p ≥ 5, we have p |(p − 1)!
2
i .
i=1

[6 Ò] Problem 17 (AIME 1989/9) One of Euler’s conjectures was disproved in the 1960s by three American
mathematicians when they showed there was a positive integer such that 1335 + 1105 + 845 + 275 = n5 . Find
the value of n.
[6 Ò] Problem 18 (USAMO 1979/1) Determine all non-negative integral solutions (n1 , n2 , . . . , nk ), if any,
apart from permutations, of the Diophantine equation

n41 + n42 + · · · + n414 = 1599.

11

You might also like