A SHORT NOTE ON INTEGER COMPLEXITY STEFAN STEINERBERGER Abstract Let f(n) be the minimum number of 1's needed in con- junction with arbitrarily many +*
Subtracting Integers “Same/Change/Change (SCC)” Rule: The sign of the first number stays the same change subtraction to addition
View the video lesson take notes and complete the problems below Definition: The integers are all positive whole numbers and their opposites and
The numbers that include natural numbers Integer A counting number zero or the negative of a counting number To make as short as possible
A prime number (or prime for short) is an integer p > 1 whose only divisors are ±1 and ±p; the set of primes is denoted P: p ? P ?? p > 1
These are lecture notes for the Number Theory course taught at CMU Divisibility in the ring of integers primes the fundamental theorem of arith-
– 1 is multiplicative identity for integers i e a × 1 = 1 × a = a for any integer a – Integers show distributive property of multiplication over addition
13 fév 2017 · INTEGERS 17 (2017) A SHORT NOTE ON REDUCED RESIDUES Pascal Stumpf Department of Mathematics University of Würzburg Germany
Note that when writing numbers in words if there is zero between numbers we use word 'and' Example 1 BODMAS is the short form of the following:
950_6r4.pdf #A4INTEGERS17(2017)
ASHORTNOTEONREDUCEDRESIDUES
PascalStumpf
DepartmentofMathematics,UniversityofW¨urzburg,Germany littlefriend@mathlino.org Received:11/25/14,Revised:5/31/16,Accepted:1/26/17,Published:2/13/17
Abstract
WeansweraquestionduetoBernardoRecam´anaboutthelowerboundbehavior ofthemaximumpossiblelengthamongarithmeticprogressionsintheleastreduced residuesystemmodulon,asn!1.Wealsoprovideanupperbound.
1.Introduction
Foranypositiveintegern>1,let
1 p 2 ...p d )=1,forallintegersa, andhencef(n)>f(p 1 p 2 ...p d )>(p d
1)/2.Ontheotherhand,wemightagain
doabitbetterbylookingatthenumbers1+m·p 1 p 2 ...p d forminganarithmetic progressionoflengthp r11 1 p r21 2 ...p r d 1 d withcommondi↵erencep 1 p 2 ...p d ,and combiningbothideasleadsustof(n)>max{(p d
1)/2,n/(p
1 p 2 ...p d )}.
Theorem1.Foreachk2Z
+ ,thereexistsaconstantn k suchthatA(n)contains anarithmeticprogressionoflengthkforalln>n k .
Proof.LetP
2k betheproductofallprimesnotexceeding2kandputn k =k·P 2k >1·2.Moreover,letusfixsomen>n k ,and(asinLemma1)denoteitslargest primefactorbyp.Ifp>2k+1,weimmediatelyarriveat (p1)/2>((2k+1)1)/2=k. Intheothercasep<2k+1,wenotethatallprimefactorsofndonotexceed2k, implyingtheirproductPdividesP 2k ,andsoinparticular n/P>n k /P=k·P 2k /P>k·1. Combiningeverythingwereachf(n)>max{(p1)/2,n/P}>k,andourclaim follows. Sofarwemainlyworkedonlowerboundsforf(n).Asalaststep,letuschange ourpointofviewandconcludebyshowing:
Theorem2.Forn>1,wealsohavef(n)6max{(p1)/1,n/P}.
INTEGERS:17(2017)4
Proof.Supposea
1 ,a 2 ,...,a s isanarithmeticprogressionoflengthswithcommon di ↵ erenceqcontainedinA(n).Nowletusfocusabitmoreonq. Ifq>P,wecanonlycomeuptos6n/P,sinceotherwises>n/Pimplies a s =a 1 +(s1)·q>1+((n/P+1)1)·P=n+1, andourlastmemberwouldnotbeinA(n)anymore.Intheothercaseq
p 0 ,thefirstp 0 membersa 1 ,a 2 ,...,a p
0dorepresentacomplete
residuesystemmodulop 0 .Thereforeoneofthem,beingamultipleofp 0 ,couldnot lieinA(n)anymore,leavingusonlys6p 0
16p1lefthere.Unitingbothcases
wereachf(n)6max{n/P,p1},asdesired.
3.FutureWork
Afterhavingestablishedlowerandupperboundsforf(n),especiallyinthecase ofsquarefreenumbersn,aninterestingquestionseemstobewhether,onaverage, f(n)iscloserto(p1)/2orp1.Ourexamplesindicatethatitcanbevery neartoboththresholds.Anothertaskistoimproveonthegivenbordern k inour maintheorem.Forbothaimsonecouldhopetogetbetterestimatesbyusingmore advancedmethods. Acknowledgements.IwouldliketothankMiriamandherbrotherChristian Goldschmiedforalwaysencouragingmetowritethingsdownandmakingmyfirst paperpossible,andtheanonymousrefereeforveryusefulcomments.
References
[1]R.Guy,UnsolvedProblemsinNumberTheory,Springer,2004. [2]B.GreenandT.Tao,Theprimescontainarbitrarilylongarithmeticprogressions,Annalsof
Mathematics(2)167(2008),481-547.