13 views

Uploaded by Mihnea

- A Property _ of Prime Numbers
- Essays on Number Theory 1
- Pier Francesco Roggero, Michele Nardelli, Francesco Di Noto - Relations Between Gauss-Eisenstein Primes and Sophie Germain Primes
- NumberProperties Challenge
- Tc2 Number Patterns
- Efficient Computation Of Full Lucas Sequences
- Worksheet 1 - Real Numbers
- Statistics Sets
- On the Importance of Checking Cryptographic
- test13
- Unit Digit Problems
- Lesson 4.1 - Prime Factorization
- Special Type of Fixed Point Pairs using MOD Rectangular Matrix Operators
- 2-ambirika
- Linear Congruence
- On the mean value of the Smarandache LCM function SL(n)
- ON TWO SUBSETS OF GENERALIZED SMARANDACHE PALINDROMES
- 90892-205704-1-PB
- metodologia cripto
- 0315-0860(77)90082-9

You are on page 1of 3

Stuff (mod p)

1. Let p = 4k + 3 be a prime number. Find the number of different residues modulo p of

(x2 + y 2 )2 , where gcd(x, p) = gcd(y, p) = 1.

2. Let both p and 2p + 1 be primes. There are a total of 2p + 1 balls in two boxes, and

neither is empty. Each step, one is allowed to move exactly half the balls in one box

to the other box. Let k be any positive integer less than 2p + 1. Prove that there is a

stage such that there are exactly k balls in one of the boxes.

p1

X i

f (x) = xi1 .

i=1

p

(a) Prove that f is divisible by x 1 but not by (x 1)2 if and only if p 3 (mod 4).

(b) Prove that if p 5 (mod 8) then f is divisible by (x 1)2 and not by (x 1)3 .

are primes.

5. Find all surjective functions f : N N such that for every m, n N and every prime

p, the number f (m + n) is divisible by p if and only if f (m) + f (n) is divisible by p.

(Here N denotes the set of all positive integers.)

m n1

divides Fermat number 22 + 1 for some integer m with m n 2. Prove that k 2

is congruent to 1 modulo p.

7. Let {xn }n=1 be a sequence with x1 = 2, x2 = 12, and xn+2 = 6xn+1 xn for every

positive integer n. Let p be an odd prime, and let q be a prime divisor of xp . Prove

that if q > 3, then q 2p 1.

8. Let p be a prime, and let k be an integer greater than 2. There are integers a1 , a2 , . . . , ak

such that p divides neither ai (1 i k) nor ai aj (1 i < j k). Denote by S

the set

{n|1 n p 1, (na1 )p < (na2 )p ) < < (nak )p },

where (b)p denotes the remainder when b is divided by p. Prove that S contains less

2p

than k+1 elements.

1

MOSP 2011 Black Joshua Nichols-Barrer

9. Let p > 2 be a prime number, and let S = {0, 1, . . . , p 1}. Determine the number of

6-tuples (x1 , x2 , x3 , x4 , x5 , x6 ) with xi S, 1 i 6, such that

10. Given a finite set P of prime numbers, prove that there exists a positive integer x

which is representable in the form x = ap + bp (with a, b N) for each p P , but not

representable in that form for any p

/ P.

11. Let p > 2 be a prime and let a, b, c, d be integers not divisile by p, such that

ra rb rc rd

+ + + =2

p p p p

for any integer r not divisible by p. Prove that at least two of the numbers a + b, a + c,

a + d, b + c, b + d, c + d are divisible by p. Here, for real numbers x {x} = x bxc

denotes the fractional part of x.

(a) Prove that there exists an integer N1 such that for every prime p greater than N1 ,

there are m consecutive positive integers each of which is congruent to the square

of an integer modulo p.

(b) Prove that there exists an integer N2 such that for every prime p greater than

N2 , there are m consecutive positive integers each of which is not congruent to a

square of an integer modulo p.

(a) g is surjective;

(b) 2f (n)2 = n2 + g(n)2 for all positive integers n;

(c) |f (n) n| 2004 n for all n.

14. Find all positive integers n > 1 for which there exists a unique integer a with 0 < a n!

such that an + 1 is divisible by n!.

15. Let p be a prime number. Prove that there exists a prime number q such that for every

integer n, the number np p is not divisible by q.

16. Let f be a polynomial with integer coefficients, and let p be a prime such that f (0) = 0,

f (1) = 1, and f (k) is congruent to either 0 or 1 modulo p for all positive integers k.

Show that the degree of f is at least p 1.

2

MOSP 2011 Black Joshua Nichols-Barrer

x7 1

= y 5 1.

x1

- A Property _ of Prime NumbersUploaded bySpanu Dumitru Viorel
- Essays on Number Theory 1Uploaded byagonza70
- Pier Francesco Roggero, Michele Nardelli, Francesco Di Noto - Relations Between Gauss-Eisenstein Primes and Sophie Germain PrimesUploaded byMichele Nardelli
- NumberProperties ChallengeUploaded byMaria Pappa
- Tc2 Number PatternsUploaded byain nardir
- Efficient Computation Of Full Lucas SequencesUploaded byΟλυμπίδης Ιωάννης
- Worksheet 1 - Real NumbersUploaded byRhonnel Manatad Alburo
- Statistics SetsUploaded bySiva Ud
- On the Importance of Checking CryptographicUploaded byAkhilesh Khare
- test13Uploaded byCarlo
- Unit Digit ProblemsUploaded byRidwan Mohammed Nur
- Lesson 4.1 - Prime FactorizationUploaded byehystad
- Special Type of Fixed Point Pairs using MOD Rectangular Matrix OperatorsUploaded byAnonymous 0U9j6BLllB
- 2-ambirikaUploaded byapi-270305905
- Linear CongruenceUploaded byAdarshKumar
- On the mean value of the Smarandache LCM function SL(n)Uploaded byMia Amalia
- ON TWO SUBSETS OF GENERALIZED SMARANDACHE PALINDROMESUploaded byRyanElias
- 90892-205704-1-PBUploaded byTayyeb Mahmood
- metodologia criptoUploaded byLucianaAmaLuciano
- 0315-0860(77)90082-9Uploaded bygelivnia
- Teoría de Números ZuckermanUploaded byAlejandra Zapata
- practicesolns2.pdfUploaded byTruong Dang
- l6Uploaded byRishi Agarwal
- Int PartUploaded byAnirudh Aggarwal
- 0.3_bzca5eUploaded byRrtidkcidsk Sidickc
- Subtracting Improper FractionsUploaded bytutorciecle123
- 7242_chap01Uploaded byIch Khuy
- (2)SetsUploaded byTaekwondolam
- Lecture 5Uploaded byelsayed esmaeil desouky
- PublicKeyCryptoUploaded bysolopilot1

- TJUSAMO 2013-2014 Modular ArithmeticUploaded byChanthana Chongchareon
- 2011squad Nt SolnsUploaded byMihnea
- ZpZ Corrected - Alison Miller - MOP 2011.pdfUploaded byMihnea
- ZpZ Teach - Gabriel Carroll - MOP (Black) 2010.pdfUploaded byMihnea
- Parvardi, Ben_1220 Number Theory Problems - Third EditionUploaded bymavrogiannis
- number theoryUploaded byjeffrey_uslan
- Vieta Jumping - X - Project PENUploaded byMihnea
- Vieta JumpingUploaded byPrafulla Dhariwal
- ZpZ - Alison Miller - MOP 2011.pdfUploaded byMihnea
- TheoryUploaded byRoderick Gatdula
- ZpZ - Gabriel Carroll - MOP (Black) 2010.pdfUploaded byMihnea
- Gaussian Integers Keith ConradUploaded byMihnea
- IdealsUploaded byMihnea
- Fibonacci 1Uploaded byBiswarup Burman
- Floor Function - Titu Andreescu, Dorin Andrica - MR 2006.pdfUploaded byMihnea
- Generalized Wilson - Yimin Ge - XUploaded byMihnea
- Interesting Arguments, Ideas - Victor Wang - XUploaded byMihnea
- 250 Problems in Elementary Number Theory, SierpinskiUploaded byMon0id
- 100 Number Theory ProblemsUploaded bycheetah17
- 50 Diophantine Equations Problems With SolutionsUploaded bybvarici
- Muirhead - ExcaliburUploaded byMihnea

- Computer ArchitectureUploaded byprmahajan18
- 4570 Error CodeUploaded byNadeesha Nishani
- SVP Business Development IT in Washington DC Resume Frank BlaulUploaded byFrankBlaul
- Extended Star SchemaUploaded byvinner786
- BIOS_Configuration_Utility_User_Guide.pdfUploaded byDOUDOU-38
- CP2028 Visual Basic Programming 2Uploaded byMalathi Sankar
- Manual Topcon LinkUploaded byantonioastudillo
- Nepal.tunga.bastolaUploaded byPrazwal Adhikari
- Project Cost Planning and Forecasting in SAP Solution OverviewUploaded byBalakrishna Dasari
- Cherwell - Standard Change Model Work Instructions v4Uploaded byAnonymous yQxGL0pE
- Chap12-Practical Database Design Methodology and Use of UML DiagramsUploaded bynomaddarcy
- 17-6897-CustomizingDocumentumWebPublisher_442Uploaded byintech1
- CS10-1L SyllabusUploaded byakladffja
- Chapter 01 the Gamma and Beta Functions (01)Uploaded byMuhammad Ashfaq Ahmed
- 20150006023Uploaded byUmair Liaqat
- Piccolo InfoUploaded byCARLOS
- Ordinary least squaresUploaded byNha Nha
- 1. Solving Linear Equations[1]Uploaded byHao Lu
- Lab 5 - A VHDL Reaction TimerUploaded byMayank Agarwal
- Unit 1 SBA OutlineUploaded byElizabeth Dardaine
- 3G refresherUploaded byAhmad Salam Abdoulrasool
- AutoCAD 2006 Dynamic Blocks Part 2 White Paper v2Uploaded byyunus913
- Android Guide ParseUploaded byJollyann Seda
- Domain and Range of a FunctionUploaded bySomen Saha
- dm3730-TRMUploaded byVenkatakishore Ch
- Pages From SAS_A00-240Uploaded byChirag Sachdeva
- csp-900rmm-2_i1r34pUploaded byrobiny
- Huawei Quality Installation Standard TdP 2G 3G_V3.4Uploaded byRenso Ramirez Jimenez
- Official 2011 US State Dept Policy on Email - Forbidding Personal UseUploaded byThe Conservative Treehouse
- Understanding OTDRUploaded byInformaticaTemple