ON POLYNOMIAL SELECTION FOR THE GENERAL NUMBER FIELD SIEVE
|
|
- Augustine Richard
- 5 years ago
- Views:
Transcription
1 MATHEMATICS OF COMPUTATIO Volume 75, umber 256, October 26, Pages S (6)187-9 Article electronically ublished on June 28, 26 O POLYOMIAL SELECTIO FOR THE GEERAL UMBER FIELD SIEVE THORSTE KLEIJUG Abstract. The general number field sieve (GFS) is the asymtotically fastest algorithm for factoring large integers. Its runtime deends on a good choice of a olynomial air. In this article we resent an imrovement of the olynomial selection method of Montgomery and Murhy which has been used in recent GFS records. 1. The olynomial selection method of Montgomery and Murhy In this section we briefly discuss the roblem of olynomial selection for GFS. We also sketch the olynomial selection method of Montgomery and Murhy. The first ste in GFS (see [3]) for factoring an integer consists in the choice of two corime olynomials f 1 and f 2 sharing a common root modulo. If we denote the corresonding homogenized olynomials by F 1,res.F 2, the next (and most time consuming) ste in GFS consists in finding many airs (a, b) Z 2 of corime integers for which both values F i (a, b), i =1, 2, are roducts of rimes below some smoothness bounds B i, i =1, 2 (we will refer to these airs as sieve reorts). This is usually done by a sieving rocedure which identifies (most of) these airs in some region A Z 2. In the case of line sieving A is of the form [ A, A] [1,B] Z 2 for some A and B. For lattice sieving the form of this region is more comlicated, but we could use a rectangle as above as an aroximation. The sieving region A and the smoothness bounds B i, i =1, 2, are chosen such that one finds aroximately π(b 1 )+π(b 2 ) sieve reorts (π(x) denotes the number of rimes below x). The time sent for sieving mainly deends on the size of the region A, i.e., 2AB. So we are left with two roblems for the olynomial selection hase: how to find such olynomial airs and, having found more than one, how to select a olynomial air which minimizes sieving time. Both roblems are addressed in several articles ([4], [5], [6]). We give a short descrition of the results of these articles. Let ρ(x) be Dickman s function which roughly is the robability that the largest rime factor of a natural number n is at most n 1 x. A first aroximation for the number of sieve reorts is given by 6 π 2 A ( log(f1 (x, y)) ρ log(b 1 ) ) ρ ( log(f2 (x, y)) log(b 2 ) ) dxdy Received by the editor December 22, 24 and, in revised form, June 22, Mathematics Subject Classification. Primary 11Y5, 11Y16. Key words and hrases. Integer factorization, GFS, olynomial selection. 237 c 26 American Mathematical Society Reverts to ublic domain 28 years from ublication
2 238 THORSTE KLEIJUG (the factor 6 π takes the robability of two integers being corime into account). 2 This aroximation can be refined by considering the number of roots of F i, i =1, 2, modulo small rimes. Let r(f, ) be the number of linear factors of the homogeneous olynomial F modulo and let α i = small ( 1 r(f i,) +1 ) log() 1. Then a better aroximation for the number of sieve reorts is given by 6 ( log(f1 (x, y)) + α ) ( 1 log(f2 (x, y)) + α ) 2 π 2 ρ ρ dxdy. A log(b 1 ) log(b 2 ) Since this exression is difficult to comute, one needs simler aroximations. ote that we only need a method to rank several olynomial airs, since we are only interested in finding the best one. We now assume that f 2 is of degree one (which imlies that α 2 does not deend on f 2 )andthatlog(f 2 (x, y)) does not vary much over the sieving region (this will be the case for the olynomials in the algorithm below). Then the term ρ((log(f 2 (x, y)) + α 2 )/ log(b 2 )) can be omitted so that the integrand only deends on f 1. A further simlification consists in considering α ( ) 2 log F1 2 (x, y)dxdy. A Here the contribution from the left summand α 1 is called root roerty and the contribution from the right summand is called size roerty. ote that we want to minimize this exression, whereas we want to maximize the reviously given aroximations. Before outlining the algorithm of Montgomery and Murhy, we have to discuss some methods to imrove the quality of a given olynomial air. From a corime olynomial air (f 1,f 2 ) sharing a common root modulo, we can roduce other airs by two methods: (1) we can translate it by an integer t getting the air ( f 1, f 2 )where f i (x+t) = f i (x), or (2) we can add a Z[x]-multile of one olynomial to the other. Translation reserves the value of α 1, whilst the second method may change it. Another method to otimize the quality is to change the shae of the sieving region A (without changing the area of A). A rectangle of given areeends only on the ratio s = A B which we will call the skewness of the sieving region. Changing the skewness also reserves α 1. We now sketch the algorithm of Montgomery and Murhy. Let the number, adegreed, and a bound,max for the leading coefficient be given, and set =. Then execute the following stes: Choose the next good (good means that has some small rime divisors). If a [ d >,max ] terminate the algorithm. d Set m = and determine the next two coefficients 1, 2 of the base-m-exansion of. If 2 is not sufficiently small, go to the first ste. Determine the comlete base-m-exansion of which gives an initial f 1 and set f 2 = x m. Otimize this air as exlained above by changing the skewness, translating, and adding multiles of f 2 to f 1. If the coefficients of f 1 are too big, go to the first ste.
3 POLYOMIAL SELECTIO FOR THE GEERAL UMBER FIELD SIEVE 239 Using a sieve identify those f 1 +cf 2 which have good root roerties, where c is a olynomial of small degree with bounded coefficients, and outut these airs (f 1 + cf 2,f 2 ). Go to the first ste. This algorithm oututs a lot of olynomial airs which can be ranked as described above. In the next sections we will describe an imrovement of the first two stes of the algorithm above. The otimization ste and the sieving ste will not be affected. 2. onmonic linear olynomials In this section we consider a substitute for the base-m-exansion in the case of a nonmonic olynomial f 2. Denote the linear olynomial by f 2 (x) =x m and assume that and m are corime. We want to find a olynomial f 1 = d i= a ix i of degree d such that f 1 ( m ) d = holds, and the coefficients of f 1 should be as small as ossible. As in the method described above we assume that the leading coefficient is given. If the congruence (2.1) m d (mod ) does not hold, no olynomial f 1 satisfying f 1 ( m ) d = exists. Lemma 2.1. Let, d,,, and m be given such that m d (mod ) holds. Define m := d and assume m m. Then there exists a olynomial f 1 (x) = d i= a ix i satisfying f 1 ( m ) d =, m m 1 <+ d,and a i <+ m for i d 2. Proof. Let r d = and choose successively for i = d 1,..., r i = r i+1 a i+1 m i+1 and a i = r i m + δ i i with δ i <such that r i a i m i (mod ) holds. Then the r i satisfy = m d + + a i+1 m i+1 d i 1 + r i d i or i r i = a j m j i j for i =,...,d. j= So we will get a olynomial satisfying the first roerty. The second roerty follows from r d 1 = 1 m d = (md m d ) < (m m)dmd 1 and the definition of 1. For showing the last roerty we use r i 1 = 1 r i a i m i = 1 δ im i <m i and the definition of a i.
4 24 THORSTE KLEIJUG The lemma above allows us to extend the first art of the Montgomery-Murhy olynomial selection algorithm to nonmonic linear olynomials. We choose and, solve the congruence (2.1), and, for each solution m, we comute the (first 3 coefficients of the) olynomial f 1 examining it more closely if 2 is sufficiently small. After that we go to the next air (,). This will not seed u the algorithm, in fact it will slow it down a bit since the olynomial exansion is now more exensive. But we have an overwhelming number of triles (,,m) at our disosal so that we can imose further restrictions on them in order to seed u the olynomial exansion. This will be done in the next section. 3. The imrovement We begin with iscussion of measuring the size of the olynomial f 1. We will work with the su-norm of olynomials which is defined as follows: Definition 3.1. Let f(x) = d i= a ix i R[x] be a olynomial of degree d and s a ositive real number (skewness). We define su(f,s) =max a i s i d 2 i and su(f) =min su(f,s). s> The (An) s for which the minimum is attained will be called otimal skewness. Remark 3.2. We can also define the L 2 -norm by 1 1 ( ( sx ) ( ys ) d ) 2dxdy su(f,s) = f L 2 y and su(f) =min su (f,s). L 2 s> L 2 This seems to give better estimates for the size roerties of a olynomial, but we do not know how to use it in the following algorithm. We can at least bound the quotient of the two norms by constants (for fixed degree d). From now on we assume d 4. This is reasonable since at the crossover oint of MPQS and GFS degree 4 olynomials are otimal. It is also ossible to carry over the algorithm below (with some modifications) to the case d =3andeven d = 2. For the case d = 4, see also Remark 3.8. Below we will resent an algorithm for finding olynomials whose first three coefficients, 1, 2 are below some bounds,max, 1,max,res. 2,max. It is ossible to use these three bounds as inut for the algorithm. However, in ractice the following aroach seems to be referable. Let M< d+1 be a bound on the su-norm of the olynomials we want to find. as above. We will allow a and a 1 to be of size For a given let m = d m. For an uer bound on the skewness we immediately get s ( M ) 2 d.togeta lower bound we assume that in the olynomial exansion of Lemma 2.1 the worst
5 POLYOMIAL SELECTIO FOR THE GEERAL UMBER FIELD SIEVE 241 case haens for the first coefficient, namely a 1 = m. With this assumtion we obtain ( ) 2 ( ) 2 m d 2 M d (3.1) s min = s smax = M for the otimal skewness. This immediately yields the bound ( ) M 2d 2 1 d 3 for. We also get the bounds a i Ms d 2 i min =: a i,max for d 2 i < d, and a i Ms d 2 i max =: a i,max for i< d 2 which deend on. We now assume that m is chosen near m and that 1,max and m holds. Then the olynomial exansion of Lemma 2.1 imlies that the coefficient 1 is of order and so is within the bounds. The other coefficients are of size m, soa 1 and a are also within the bounds. Our task is to get the coefficients 2,...,a 2 sufficiently small. In the following we will show how to quickly estimate the size of 2. We now choose = l i=1 i,where i 1(mod d) are (small) rimes, (, )= 1, and 1,max. This choice imlies that the equation x d (mod ) has either no solution or d l solutions. In the latter case these can be written as (3.2) x µ = l x i,µi, i=1 where µ = (µ 1,...,µ l ) with µ i {1,...,d}, x i,µi <, x i,µi, and {x i,j mod i j =1,...,d} are the d solutions of x d (mod i ). Remark 3.3. From each of these d l solutions x µ we will construct a olynomial air via Lemma 2.1. The corresonding variables will get an additional subscrit µ (e.g., 1 becomes 1,µ ). We will reresent some of these variables in a form such as (3.2), since in this form the d l variables on the left-hand side are linear combinations of the ld variables on the right-hand side. Let m be the smallest integer bigger than m and divisible by and let { m + x i,j, i =1, (3.3) m i,j = x i,j, i > 1. Then m µ = l i=1 m i,µ i = m + x µ are d l solutions of x d (mod ) near m. Lemma 3.4. otations as above. There exist integers e i,j <where 1 i l and 1 j d (see formula (3.6)) such that l (3.4) 1,µ = satisfies i=1 e i,µi (3.5) 1,µ m d 1 µ m d µ (mod ). Hence 1,µ canbeusedintheexansionof for the air (, m µ ). i
6 242 THORSTE KLEIJUG Proof. First note that given 1,µ modulo for all µ by equation (3.5), it is sufficient to solve (3.4) modulo since we can reduce the e i,j modulo to satisfy e i,j <. ote also that the e i,j are not uniquely determined, since we can add a constant to all e i,j, i fixed, 1 j l (reducing modulo if necessary) and subtract the same constant from all e i,j, i fixed, 1 j l. Fix a 1 i l, andletµ =(µ 1,...,µ l ), µ =(µ 1,...,µ l )withµ j = µ j for j i. We will show that 1,µ 1,µ mod does not deend on µ j for j i, but only on µ i and µ i. This allows us to set (3.6) e 1,1 1,(j,1,...,1) (mod ), e i,1 = for i>1and e i,j 1,(1,...,1,j,1,...,1) 1,(1,...,1) (mod ) for i>1,j >1 (in the last line j aears at the ith lace). Because of the indeendence these e i,j satisfy (3.4). Let µ =( µ 1,..., µ l )and µ =( µ 1,..., µ l) be another air with µ j = µ j for j i and µ i = µ i, µ i = µ i (omitting or adding a means that everything outside the ith lace remains constant; a means that the ith lace stays constant). We have to rove (3.7) 1,µ 1,µ 1, µ 1, µ (mod k ), 1 k l. We now multily (3.5) by 1 m µ mod and get 1,µ 1 a m d µ dm µ (mod ). For k i we have m µ m µ = x µ x µ = x i,µi x i,µ i (mod k ), whence we get 1,µ 1,µ m m d µ m d µ µ m dm d 1 µ x i,µ i i,µ i µ i i d x i,µ i i,µ i i i (mod ), i roving (3.7) for k i. For showing it modulo i we note that m µ m µ (mod i ) and get (as above) 1,µ 1, µ m m d µ m d µ µ d(m µ m µ ) and analogously for 1,µ 1, µ. Therefore (mod i ) 1,µ 1,µ 1, µ + 1, µ d(m µ m µ m µ + m µ ) which comletes the roof. (mod i ), ow we consider the next coefficient in the olynomial exansion corresonding to m µ, and want to estimate its size. We use the aroximation m µ m because m is much bigger than and m µ differs from m by at most l. Since we are
7 POLYOMIAL SELECTIO FOR THE GEERAL UMBER FIELD SIEVE 243 free to add multiles of (x m µ )x d 2 to the olynomial exansion, we want that is very near to an integer. An aroximation of this quantity is given by 2,µ m 2,µ m r d 2,µ m d 1 = m d µ 1,µ m d 1 µ 2 m d 1 m d d(m µ m )m d 1 1,µ m d 1 2 m d 1 = m d 2 m d 1 + d(m µ m ) 1,µ 2. The transition from the first to the second line is done by using the binomial exansions of (m +(m µ m )) a, a = d, d 1, and omitting all monomials in the numeratorforwhichtheowerofm is less than d 1. Definition 3.5. Let f = m d 2 m d 1 and for 1 i l, 1 j d, f i,j = dx i,j 2 e i,j. With this definition the aroximation above becomes 2,µ l f + f i,µi. m TheerrormadeisO( dl2 (d +) m ). We now resent an algorithm which, given an integer and egree d 4, roduces a list of olynomial airs (f 1,f 2 )withacommonrootmodulo such that the first three coefficients of f 1 are small. Algorithm 3.6. Inut: a number, adegreed 4off 1, a bound M for the su-norm of f 1 (or alternatively three bounds,max, 1,max and 2,max for the first three coefficients), a bound l on the minimal number of rime factors of, and a bound b for these rime factors. (1) Set P = {r 1(modd) r rime, r and r< b } and set =. ( ) M (2) Increase and terminate the algorithm if it exceeds,max = 2d 2 1 d 3. Otherwise set Q( )={r P (mod r) is th ower modulo r}. Also comute aroximately m = d, 1,max = M 2 m and 2,max = ( ) M 2d 6 1 d 2. m d 4 (3) For all subsets P of at least l elements of Q( ) such that = r P r 1,max holds, execute the following three stes: (a) Comute x i,j, m i,j,ande i,j as in (3.2), (3.3), and (3.6), resectively. (b) Finally comute f and f i,j as in Definition 3.5. (c) Set ɛ = 2,max m and find those vectors µ for which l f + f i,µi mod Z [ ɛ, ɛ] i=1 i=1
8 244 THORSTE KLEIJUG holds and outut the corresonding olynomial air. This can be done by setting l =[ l 2 ], comuting the two lists f + l i=1 f i,µ i mod Z and l i=l +1 f i,µ i mod Z, sorting these two lists, and checking each element of the second list to see whether it is in an ɛ-neighbourhood of an element of the first list. Go to ste (2). Remark 3.7. In one ass of stes 3(a) (c) we check d l olynomial airs in time O(d l 2 log d) resulting in a runtime of O(d l 2 log d) er checked olynomial air. So we try to choose l as large as ossible. Remark 3.8. For smaller numbers (less than 15 digits, say) a olynomial air of degree (4,1), i.e., d = 4, will be suerior to one of degree (5,1). In this case the following modification roduces better olynomial airs. We no longer require that a 1 is of size m which will restrict the degree of the olynomial c in the root sieve to, i.e., we search among f 1 + c f 2, c Z, c small for olynomials having good root roerties. Then the bounds (3.1) will be relaced by m M s min = M s s max = a 4 giving ( ) 1 ) 1 M 8 3 M 11 6 a 4, a3 (, and a2 M. The outut of the algorithm above consists of olynomials such that all coefficients with the ossible excetion of a 1 are small enough. We then check whether a 1 also lies within the bounds (for a suitable skewness). We now describe some variants of the algorithm above: (1) Instead of considering every we may only consider those which are divisible by a roduct of some small rimes (6, say). This increases the root roerties of the olynomial f 1 by adding rojective roots modulo these small rimes. On the other hand it reduces the number of available leading coefficients which may force us to decrease the number l of rime factors in which in turn slows down ste 3(c) of the algorithm. Alternatively it is also ossible to identify good using a sieve. (2) For degree d = 5 and smaller l a large art of time is sent in the initialization of ste 3(a). By also considering roducts of the form = i=1 i, l where is a number (not necessarily rime) such that x d (mod ) has exactly one solution, we can decrease the ercentage of the initialization cost. For a set P we first roceed as in arts 3(a) (c) of the algorithm (this corresonds to = 1). Then we do these stes with other values of such that 1,max holds. For these values we can reuse some of the comutations done for =1. (3) For very large the number of admissible values for is huge. We may decrease the su-norm bound M, thereby shrinking the admissible -interval, but we risk getting no olynomial satisfying this reduced su-norm bound. So we can only restrict the search interval by selecting some of the. Since we want to have the number l of different rime factors of as large as ossible (for very large ste 3(c) dominates the runtime), we reverse
9 POLYOMIAL SELECTIO FOR THE GEERAL UMBER FIELD SIEVE 245 the roles of and in the following way: select l rimes out of P whose roduct is smaller than 1,max.ow must be congruent to times th ower modulo each of the l rimes dividing, and it has to satisfy a restriction on its size. So we get another knasack roblem whose solutions give airs (,). We may include informations modulo 6 into the knasack roblem to get only those which are divisible by 6. As in the revious variant we may also use an auxiliary factor, but since the initialization costs are not a roblem, it is robably better to increase l. 4. Simle heuristic analysis In this section we want to examine which quality we can exect using a given amount of time. This will only be a rough analysis not involving the root sieve and assuming that the number of examined olynomials is not too big. As above let be the integer to be factored, d 4 the degree of the algebraic olynomial f 1 = d i= a ix i,andm a bound on its su-norm. We want to search for olynomials whose su-norm is less than M. Furthermore let b< d 1 2 be an integer. Using the algorithm described above we search for olynomials such that there exists a skewness s 1 such that the following holds: (4.1) a i Ms d 2 i d for b i d and Ms d 2 b. Since the coefficients a,...,a b 1 will be of size d, these conditions imly that the de-skewed su-norm is at most M. The second condition imlies that we can doa(b + 1)-dimensional root sieve, i.e., using a sieve over olynomials c Z[x] of degree b with small coefficients, we search for olynomials f 1 + cf 2 having good root roerties. In the revious section we only considered the case b =1. For a olynomial exansion we have by Lemma max(, )and a i d for i = d 2,...,. Therefore we get the restriction Ms 1 d 2. Then the average number W of olynomials we have to check in order to find one olynomial satisfying (4.1) is W = d 2 i=b+1 max 1, d Ms d 2 i. These checks consist of a quick check of the size of 2 and for the d 3 d W = max 1, i=b+1 Ms d 2 i survivors of this a slower check of the sizes of the remaining coefficients. Choosing as a roduct of l rimes, this can be done in time O( W )+O(W ). This is d 2 l minimal if is as large as ossible, so we assume from now on that = Ms d 2. If we substitute this and multily out, we get W = M s z,wherez and W = M s z,wherez forb 1. In order to minimize the work we choose d s as small as ossible for b>, i.e., = Ms d 2 b, since a smaller s imlies a
10 246 THORSTE KLEIJUG larger bound on and therefore a larger l. In this case the second argument in the roducts above is always the maximum and we get W = ( ) (d 2 b)(d 1 b) d(d 1 2b) M d+1 or d(d 1 2b) d+1 W (d+1)(d 2 b)(d 1 b). M = 1 We now assume that the O( W )-term dominates the O(W )-term. By checking one d 2 l olynomial we obtain M = 1 d+1 as exected. If we want to imrove this by a factor f we have to check f (d+1)(d 2 b)(d 1 b) d(d 1 2b) olynomials on average. For small values of d and b this exonent is tabulated in the following table: b d We note that this function takes the same values for b =andb =1,namely (d+1)(d 2) d. So in these cases the amount of work for finding a olynomial with small su-norm is equal, but for b = 1 we have a larger root sieve and can exect better root roerties (always neglecting the O(W )-term). 5. Exerimental results This algorithm has been used for the olynomial selection stage of the factorization of many numbers. The largest number whose factorization has been comleted and where a number of similar size has been factored using the original Montgomery-Murhy method is a comosite 143-digit factor of We used the following arameters: a 5 ranged over all multiles of 6 between 1 and ca , was comosed of 7 rimes 1 (mod 5) less than 1 and an auxiliary factor less than This took aroximately 3 days on four 233 MHz Pentiums. Comared with the olynomial air used for the factorization of the (slightly smaller) 143-digit comosite 92! + 1 which has been generated by the original Montgomery-Murhy method, the yield has been increased by 4%. We also have done a short search for the 512-bit RSA challenge number factored in August 1999 ([1]). In this exeriment was comosed of 7 rimes 1(mod5) and an auxiliary factor. The range for the leading coefficient a 5 was [1, 2], a 5 being a multile of 6. Only for those olynomials whose de-skewed su-norm was less than a root sieve was erformed. The best olynomial air found was f 1 = x x x 3 and x x f 2 = x
11 POLYOMIAL SELECTIO FOR THE GEERAL UMBER FIELD SIEVE 247 This olynomial air has a yield aroximately 32% higher than that of the olynomial air used for the factorization. The time sent for the search was less than 9 hours on a 1 GHz Pentium. For the 576-bit RSA challenge number factored in December 23 ([2]), the algorithm resented in this article was intensely used. The best olynomial air we found was f 1 = x x x 3 and x x f 2 = x , and it was used for the factorization. References 1. S. Cavallar, W. M. Lioen, H. J. J. teriele, B. Dodson, A. K. Lenstra, P. L. Montgomery, B. Murhy et al., Factorization of a 512-bit RSA modulus, Reort MAS-R7, CWI. 2. J. Franke, T. Kleinjung et al., RSA-576, announcement, 23. htt:// 3. A. K. Lenstra and H. W. Lenstra, Jr. (eds.), The Develoment of the umber Field Sieve, Lecture otes in Math. 1554, Sringer, MR B. A. Murhy and R. P. Brent, On Quadratic Polynomials for the umber Field Sieve, Comuting Theory 98, ACSC 2(3) (1998), MR (2i:11189) 5. B. A. Murhy, Modelling the Yield of umber Field Sieve Polynomials, Algorithmic umber Theory - ATS III, LCS 1443 (1998), MR (21d:1129) 6. B. A. Murhy, Polynomial selection for the umber Field Sieve Integer Factorisation Algorithm, Ph.D. thesis, The Australian ational University, Deartment of Mathematics, University of Bonn, Beringstrasse 1, Bonn, Germany address: thor@math.uni-bonn.de
On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve
On onlinear Polynomial Selection and Geometric Progression (mod ) for umber Field Sieve amhun Koo, Gooc Hwa Jo, and Soonhak Kwon Email: komaton@skku.edu, achimheasal@nate.com, shkwon@skku.edu Det. of Mathematics,
More informationCERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education
CERIAS Tech Reort 2010-01 The eriod of the Bell numbers modulo a rime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education and Research Information Assurance and Security Purdue University,
More informationHENSEL S LEMMA KEITH CONRAD
HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More informationON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS
#A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,
More informationGOOD MODELS FOR CUBIC SURFACES. 1. Introduction
GOOD MODELS FOR CUBIC SURFACES ANDREAS-STEPHAN ELSENHANS Abstract. This article describes an algorithm for finding a model of a hyersurface with small coefficients. It is shown that the aroach works in
More informationMath 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,
MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write
More informationThe Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001
The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse-Minkowski Theorem rovides a characterization of the rational quadratic forms. What follows is a roof of the Hasse-Minkowski
More informationApplicable Analysis and Discrete Mathematics available online at HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS
Alicable Analysis and Discrete Mathematics available online at htt://efmath.etf.rs Al. Anal. Discrete Math. 4 (010), 3 44. doi:10.98/aadm1000009m HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS Zerzaihi
More informationMA3H1 TOPICS IN NUMBER THEORY PART III
MA3H1 TOPICS IN NUMBER THEORY PART III SAMIR SIKSEK 1. Congruences Modulo m In quadratic recirocity we studied congruences of the form x 2 a (mod ). We now turn our attention to situations where is relaced
More informationThe inverse Goldbach problem
1 The inverse Goldbach roblem by Christian Elsholtz Submission Setember 7, 2000 (this version includes galley corrections). Aeared in Mathematika 2001. Abstract We imrove the uer and lower bounds of the
More information4. Score normalization technical details We now discuss the technical details of the score normalization method.
SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules
More informationMATH 361: NUMBER THEORY EIGHTH LECTURE
MATH 361: NUMBER THEORY EIGHTH LECTURE 1. Quadratic Recirocity: Introduction Quadratic recirocity is the first result of modern number theory. Lagrange conjectured it in the late 1700 s, but it was first
More informationLinear diophantine equations for discrete tomography
Journal of X-Ray Science and Technology 10 001 59 66 59 IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa,
More informationπ(x) π( x) = x<n x gcd(n,p)=1 The sum can be extended to all n x, except that now the number 1 is included in the sum, so π(x) π( x)+1 = n x
Math 05 notes, week 7 C. Pomerance Sieving An imortant tool in elementary/analytic number theory is sieving. Let s begin with something familiar: the sieve of Ertatosthenes. This is usually introduced
More informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationMobius Functions, Legendre Symbols, and Discriminants
Mobius Functions, Legendre Symbols, and Discriminants 1 Introduction Zev Chonoles, Erick Knight, Tim Kunisky Over the integers, there are two key number-theoretic functions that take on values of 1, 1,
More informationThe Fekete Szegő theorem with splitting conditions: Part I
ACTA ARITHMETICA XCIII.2 (2000) The Fekete Szegő theorem with slitting conditions: Part I by Robert Rumely (Athens, GA) A classical theorem of Fekete and Szegő [4] says that if E is a comact set in the
More information#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS
#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS Ramy F. Taki ElDin Physics and Engineering Mathematics Deartment, Faculty of Engineering, Ain Shams University, Cairo, Egyt
More informationECE 534 Information Theory - Midterm 2
ECE 534 Information Theory - Midterm Nov.4, 009. 3:30-4:45 in LH03. You will be given the full class time: 75 minutes. Use it wisely! Many of the roblems have short answers; try to find shortcuts. You
More informationBrownian Motion and Random Prime Factorization
Brownian Motion and Random Prime Factorization Kendrick Tang June 4, 202 Contents Introduction 2 2 Brownian Motion 2 2. Develoing Brownian Motion.................... 2 2.. Measure Saces and Borel Sigma-Algebras.........
More informationMath 229: Introduction to Analytic Number Theory Elementary approaches II: the Euler product
Math 9: Introduction to Analytic Number Theory Elementary aroaches II: the Euler roduct Euler [Euler 737] achieved the first major advance beyond Euclid s roof by combining his method of generating functions
More informationCryptanalysis of Pseudorandom Generators
CSE 206A: Lattice Algorithms and Alications Fall 2017 Crytanalysis of Pseudorandom Generators Instructor: Daniele Micciancio UCSD CSE As a motivating alication for the study of lattice in crytograhy we
More informationIntrinsic Approximation on Cantor-like Sets, a Problem of Mahler
Intrinsic Aroximation on Cantor-like Sets, a Problem of Mahler Ryan Broderick, Lior Fishman, Asaf Reich and Barak Weiss July 200 Abstract In 984, Kurt Mahler osed the following fundamental question: How
More informationAn Estimate For Heilbronn s Exponential Sum
An Estimate For Heilbronn s Exonential Sum D.R. Heath-Brown Magdalen College, Oxford For Heini Halberstam, on his retirement Let be a rime, and set e(x) = ex(2πix). Heilbronn s exonential sum is defined
More informationMATH 361: NUMBER THEORY ELEVENTH LECTURE
MATH 361: NUMBER THEORY ELEVENTH LECTURE The subjects of this lecture are characters, Gauss sums, Jacobi sums, and counting formulas for olynomial equations over finite fields. 1. Definitions, Basic Proerties
More informationMath 104B: Number Theory II (Winter 2012)
Math 104B: Number Theory II (Winter 01) Alina Bucur Contents 1 Review 11 Prime numbers 1 Euclidean algorithm 13 Multilicative functions 14 Linear diohantine equations 3 15 Congruences 3 Primes as sums
More informationA construction of bent functions from plateaued functions
A construction of bent functions from lateaued functions Ayça Çeşmelioğlu, Wilfried Meidl Sabancı University, MDBF, Orhanlı, 34956 Tuzla, İstanbul, Turkey. Abstract In this resentation, a technique for
More informationFactorability in the ring Z[ 5]
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Dissertations, Theses, and Student Research Paers in Mathematics Mathematics, Deartment of 4-2004 Factorability in the ring
More information#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS
#A47 INTEGERS 15 (015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS Mihai Ciu Simion Stoilow Institute of Mathematics of the Romanian Academy, Research Unit No. 5,
More informationSolvability and Number of Roots of Bi-Quadratic Equations over p adic Fields
Malaysian Journal of Mathematical Sciences 10(S February: 15-35 (016 Secial Issue: The 3 rd International Conference on Mathematical Alications in Engineering 014 (ICMAE 14 MALAYSIAN JOURNAL OF MATHEMATICAL
More informationMATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK
Comuter Modelling and ew Technologies, 5, Vol.9, o., 3-39 Transort and Telecommunication Institute, Lomonosov, LV-9, Riga, Latvia MATHEMATICAL MODELLIG OF THE WIRELESS COMMUICATIO ETWORK M. KOPEETSK Deartment
More informationLattice Attacks on the DGHV Homomorphic Encryption Scheme
Lattice Attacks on the DGHV Homomorhic Encrytion Scheme Abderrahmane Nitaj 1 and Tajjeeddine Rachidi 2 1 Laboratoire de Mathématiques Nicolas Oresme Université de Caen Basse Normandie, France abderrahmanenitaj@unicaenfr
More informationTowards understanding the Lorenz curve using the Uniform distribution. Chris J. Stephens. Newcastle City Council, Newcastle upon Tyne, UK
Towards understanding the Lorenz curve using the Uniform distribution Chris J. Stehens Newcastle City Council, Newcastle uon Tyne, UK (For the Gini-Lorenz Conference, University of Siena, Italy, May 2005)
More informationQUADRATIC RESIDUES AND DIFFERENCE SETS
QUADRATIC RESIDUES AND DIFFERENCE SETS VSEVOLOD F. LEV AND JACK SONN Abstract. It has been conjectured by Sárközy that with finitely many excetions, the set of quadratic residues modulo a rime cannot be
More informationNUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:
NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two oerations defined on them, addition and multilication,
More information3 Properties of Dedekind domains
18.785 Number theory I Fall 2016 Lecture #3 09/15/2016 3 Proerties of Dedekind domains In the revious lecture we defined a Dedekind domain as a noetherian domain A that satisfies either of the following
More informationERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION
ERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION JOSEPH H. SILVERMAN Acknowledgements Page vii Thanks to the following eole who have sent me comments and corrections
More informationEstimation of the large covariance matrix with two-step monotone missing data
Estimation of the large covariance matrix with two-ste monotone missing data Masashi Hyodo, Nobumichi Shutoh 2, Takashi Seo, and Tatjana Pavlenko 3 Deartment of Mathematical Information Science, Tokyo
More informationOn split sample and randomized confidence intervals for binomial proportions
On slit samle and randomized confidence intervals for binomial roortions Måns Thulin Deartment of Mathematics, Usala University arxiv:1402.6536v1 [stat.me] 26 Feb 2014 Abstract Slit samle methods have
More informationarxiv: v1 [physics.data-an] 26 Oct 2012
Constraints on Yield Parameters in Extended Maximum Likelihood Fits Till Moritz Karbach a, Maximilian Schlu b a TU Dortmund, Germany, moritz.karbach@cern.ch b TU Dortmund, Germany, maximilian.schlu@cern.ch
More informationProbability Estimates for Multi-class Classification by Pairwise Coupling
Probability Estimates for Multi-class Classification by Pairwise Couling Ting-Fan Wu Chih-Jen Lin Deartment of Comuter Science National Taiwan University Taiei 06, Taiwan Ruby C. Weng Deartment of Statistics
More informationUniversity of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): 10.
Booker, A. R., & Pomerance, C. (07). Squarefree smooth numbers and Euclidean rime generators. Proceedings of the American Mathematical Society, 45(), 5035-504. htts://doi.org/0.090/roc/3576 Peer reviewed
More informationLARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS
LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS HELMUT MAIER AND MICHAEL TH. RASSIAS Abstract. We rove a modification as well as an imrovement
More informationOutline. EECS150 - Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Simple Error Detection Coding
Outline EECS150 - Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Error detection using arity Hamming code for error detection/correction Linear Feedback Shift
More informationMath 5330 Spring Notes Prime Numbers
Math 5330 Sring 208 Notes Prime Numbers The study of rime numbers is as old as mathematics itself. This set of notes has a bunch of facts about rimes, or related to rimes. Much of this stuff is old dating
More informationA CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract
A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS CASEY BRUCK 1. Abstract The goal of this aer is to rovide a concise way for undergraduate mathematics students to learn about how rime numbers behave
More informationSUMS OF TWO SQUARES PAIR CORRELATION & DISTRIBUTION IN SHORT INTERVALS
SUMS OF TWO SQUARES PAIR CORRELATION & DISTRIBUTION IN SHORT INTERVALS YOTAM SMILANSKY Abstract. In this work we show that based on a conjecture for the air correlation of integers reresentable as sums
More information1. INTRODUCTION. Fn 2 = F j F j+1 (1.1)
CERTAIN CLASSES OF FINITE SUMS THAT INVOLVE GENERALIZED FIBONACCI AND LUCAS NUMBERS The beautiful identity R.S. Melham Deartment of Mathematical Sciences, University of Technology, Sydney PO Box 23, Broadway,
More informationarxiv: v2 [math.ho] 24 Nov 2014
arxiv:88.48v2 [math.ho] 24 Nov 24 There are infinitely many rime numbers in all arithmetic rogressions with first term and difference corime. (By Mr. Lejeune-Dirichlet) [Read to the Academy of Sciences
More informationNew weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function - a review
University of Wollongong Research Online Faculty of Informatics - Paers (Archive) Faculty of Engineering and Information Sciences 1999 New weighing matrices and orthogonal designs constructed using two
More informationMath 261 Exam 2. November 7, The use of notes and books is NOT allowed.
Math 261 Eam 2 ovember 7, 2018 The use of notes and books is OT allowed Eercise 1: Polynomials mod 691 (30 ts In this eercise, you may freely use the fact that 691 is rime Consider the olynomials f( 4
More informationChapter 7 Rational and Irrational Numbers
Chater 7 Rational and Irrational Numbers In this chater we first review the real line model for numbers, as discussed in Chater 2 of seventh grade, by recalling how the integers and then the rational numbers
More information#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS
#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS Norbert Hegyvári ELTE TTK, Eötvös University, Institute of Mathematics, Budaest, Hungary hegyvari@elte.hu François Hennecart Université
More informationReal Analysis 1 Fall Homework 3. a n.
eal Analysis Fall 06 Homework 3. Let and consider the measure sace N, P, µ, where µ is counting measure. That is, if N, then µ equals the number of elements in if is finite; µ = otherwise. One usually
More informationSQUARES IN Z/NZ. q = ( 1) (p 1)(q 1)
SQUARES I Z/Z We study squares in the ring Z/Z from a theoretical and comutational oint of view. We resent two related crytograhic schemes. 1. SQUARES I Z/Z Consider for eamle the rime = 13. Write the
More informationx 2 a mod m. has a solution. Theorem 13.2 (Euler s Criterion). Let p be an odd prime. The congruence x 2 1 mod p,
13. Quadratic Residues We now turn to the question of when a quadratic equation has a solution modulo m. The general quadratic equation looks like ax + bx + c 0 mod m. Assuming that m is odd or that b
More informationPretest (Optional) Use as an additional pacing tool to guide instruction. August 21
Trimester 1 Pretest (Otional) Use as an additional acing tool to guide instruction. August 21 Beyond the Basic Facts In Trimester 1, Grade 8 focus on multilication. Daily Unit 1: Rational vs. Irrational
More informationWhen do the Fibonacci invertible classes modulo M form a subgroup?
Annales Mathematicae et Informaticae 41 (2013). 265 270 Proceedings of the 15 th International Conference on Fibonacci Numbers and Their Alications Institute of Mathematics and Informatics, Eszterházy
More information1-way quantum finite automata: strengths, weaknesses and generalizations
1-way quantum finite automata: strengths, weaknesses and generalizations arxiv:quant-h/9802062v3 30 Se 1998 Andris Ambainis UC Berkeley Abstract Rūsiņš Freivalds University of Latvia We study 1-way quantum
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 12
8.3: Algebraic Combinatorics Lionel Levine Lecture date: March 7, Lecture Notes by: Lou Odette This lecture: A continuation of the last lecture: comutation of µ Πn, the Möbius function over the incidence
More informationWhen do Fibonacci invertible classes modulo M form a subgroup?
Calhoun: The NPS Institutional Archive DSace Reository Faculty and Researchers Faculty and Researchers Collection 2013 When do Fibonacci invertible classes modulo M form a subgrou? Luca, Florian Annales
More informationp-adic Properties of Lengyel s Numbers
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.7.3 -adic Proerties of Lengyel s Numbers D. Barsky 7 rue La Condamine 75017 Paris France barsky.daniel@orange.fr J.-P. Bézivin 1, Allée
More informationRECIPROCITY LAWS JEREMY BOOHER
RECIPROCITY LAWS JEREMY BOOHER 1 Introduction The law of uadratic recirocity gives a beautiful descrition of which rimes are suares modulo Secial cases of this law going back to Fermat, and Euler and Legendre
More information#A8 INTEGERS 12 (2012) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS
#A8 INTEGERS 1 (01) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS Mohammadreza Bidar 1 Deartment of Mathematics, Sharif University of Technology, Tehran, Iran mrebidar@gmailcom
More informationCatalan s Equation Has No New Solution with Either Exponent Less Than 10651
Catalan s Euation Has No New Solution with Either Exonent Less Than 065 Maurice Mignotte and Yves Roy CONTENTS. Introduction and Overview. Bounding One Exonent as a Function of the Other 3. An Alication
More informationAN IMPROVED BABY-STEP-GIANT-STEP METHOD FOR CERTAIN ELLIPTIC CURVES. 1. Introduction
J. Al. Math. & Comuting Vol. 20(2006), No. 1-2,. 485-489 AN IMPROVED BABY-STEP-GIANT-STEP METHOD FOR CERTAIN ELLIPTIC CURVES BYEONG-KWEON OH, KIL-CHAN HA AND JANGHEON OH Abstract. In this aer, we slightly
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers:,2,..., These are constructed using Peano axioms. We will not get into the hilosohical questions related to this and simly assume the
More informationRepresenting Integers as the Sum of Two Squares in the Ring Z n
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 17 (2014), Article 14.7.4 Reresenting Integers as the Sum of Two Squares in the Ring Z n Joshua Harrington, Lenny Jones, and Alicia Lamarche Deartment
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013
18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013 In this lecture we lay the groundwork needed to rove the Hasse-Minkowski theorem for Q, which states that a quadratic form over
More informationarxiv:math/ v1 [math.nt] 3 Dec 2004
arxiv:math/0412079v1 [math.nt] 3 Dec 2004 PRIMITIVE DIVISORS OF QUADRATIC POLYNOMIAL SEQUENCES G. EVEREST, S. STEVENS, D. TAMSETT AND T. WARD Abstract. We consider rimitive divisors of terms of integer
More information2 Asymptotic density and Dirichlet density
8.785: Analytic Number Theory, MIT, sring 2007 (K.S. Kedlaya) Primes in arithmetic rogressions In this unit, we first rove Dirichlet s theorem on rimes in arithmetic rogressions. We then rove the rime
More informationOn the irreducibility of a polynomial associated with the Strong Factorial Conjecture
On the irreducibility of a olynomial associated with the Strong Factorial Conecture Michael Filaseta Mathematics Deartment University of South Carolina Columbia, SC 29208 USA E-mail: filaseta@math.sc.edu
More informationNOTES. Hyperplane Sections of the n-dimensional Cube
NOTES Edited by Sergei Tabachnikov Hyerlane Sections of the n-dimensional Cube Rolfdieter Frank and Harald Riede Abstract. We deduce an elementary formula for the volume of arbitrary hyerlane sections
More information2 Asymptotic density and Dirichlet density
8.785: Analytic Number Theory, MIT, sring 2007 (K.S. Kedlaya) Primes in arithmetic rogressions In this unit, we first rove Dirichlet s theorem on rimes in arithmetic rogressions. We then rove the rime
More information19th Bay Area Mathematical Olympiad. Problems and Solutions. February 28, 2017
th Bay Area Mathematical Olymiad February, 07 Problems and Solutions BAMO- and BAMO- are each 5-question essay-roof exams, for middle- and high-school students, resectively. The roblems in each exam are
More informationSums of independent random variables
3 Sums of indeendent random variables This lecture collects a number of estimates for sums of indeendent random variables with values in a Banach sace E. We concentrate on sums of the form N γ nx n, where
More informationOn the Multiplicative Order of a n Modulo n
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 2010), Article 10.2.1 On the Multilicative Order of a n Modulo n Jonathan Chaelo Université Lille Nord de France F-59000 Lille France jonathan.chaelon@lma.univ-littoral.fr
More informationp-adic Measures and Bernoulli Numbers
-Adic Measures and Bernoulli Numbers Adam Bowers Introduction The constants B k in the Taylor series exansion t e t = t k B k k! k=0 are known as the Bernoulli numbers. The first few are,, 6, 0, 30, 0,
More informationApplied Mathematics and Computation
Alied Mathematics and Comutation 217 (2010) 1887 1895 Contents lists available at ScienceDirect Alied Mathematics and Comutation journal homeage: www.elsevier.com/locate/amc Derivative free two-oint methods
More informationRESOLUTIONS OF THREE-ROWED SKEW- AND ALMOST SKEW-SHAPES IN CHARACTERISTIC ZERO
RESOLUTIONS OF THREE-ROWED SKEW- AND ALMOST SKEW-SHAPES IN CHARACTERISTIC ZERO MARIA ARTALE AND DAVID A. BUCHSBAUM Abstract. We find an exlicit descrition of the terms and boundary mas for the three-rowed
More informationBy Evan Chen OTIS, Internal Use
Solutions Notes for DNY-NTCONSTRUCT Evan Chen January 17, 018 1 Solution Notes to TSTST 015/5 Let ϕ(n) denote the number of ositive integers less than n that are relatively rime to n. Prove that there
More informationAsymptotically Optimal Simulation Allocation under Dependent Sampling
Asymtotically Otimal Simulation Allocation under Deendent Samling Xiaoing Xiong The Robert H. Smith School of Business, University of Maryland, College Park, MD 20742-1815, USA, xiaoingx@yahoo.com Sandee
More informationWe collect some results that might be covered in a first course in algebraic number theory.
1 Aendices We collect some results that might be covered in a first course in algebraic number theory. A. uadratic Recirocity Via Gauss Sums A1. Introduction In this aendix, is an odd rime unless otherwise
More informationMATH342 Practice Exam
MATH342 Practice Exam This exam is intended to be in a similar style to the examination in May/June 2012. It is not imlied that all questions on the real examination will follow the content of the ractice
More informationA review of the foundations of perfectoid spaces
A review of the foundations of erfectoid saces (Notes for some talks in the Fargues Fontaine curve study grou at Harvard, Oct./Nov. 2017) Matthew Morrow Abstract We give a reasonably detailed overview
More informationDeriving Indicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V.
Deriving ndicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V. Deutsch Centre for Comutational Geostatistics Deartment of Civil &
More informationFor q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i
Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA 9519-0103, USA khuri@juiter.sjsu.edu Fax: (40)94-500 Keywords:
More informationOn Wald-Type Optimal Stopping for Brownian Motion
J Al Probab Vol 34, No 1, 1997, (66-73) Prerint Ser No 1, 1994, Math Inst Aarhus On Wald-Tye Otimal Stoing for Brownian Motion S RAVRSN and PSKIR The solution is resented to all otimal stoing roblems of
More informationTAIL OF A MOEBIUS SUM WITH COPRIMALITY CONDITIONS
#A4 INTEGERS 8 (208) TAIL OF A MOEBIUS SUM WITH COPRIMALITY CONDITIONS Akhilesh P. IV Cross Road, CIT Camus,Taramani, Chennai, Tamil Nadu, India akhilesh.clt@gmail.com O. Ramaré 2 CNRS / Institut de Mathématiques
More informationCHAPTER-II Control Charts for Fraction Nonconforming using m-of-m Runs Rules
CHAPTER-II Control Charts for Fraction Nonconforming using m-of-m Runs Rules. Introduction: The is widely used in industry to monitor the number of fraction nonconforming units. A nonconforming unit is
More informationOn generalizing happy numbers to fractional base number systems
On generalizing hay numbers to fractional base number systems Enriue Treviño, Mikita Zhylinski October 17, 018 Abstract Let n be a ositive integer and S (n) be the sum of the suares of its digits. It is
More informationImproved Bounds on Bell Numbers and on Moments of Sums of Random Variables
Imroved Bounds on Bell Numbers and on Moments of Sums of Random Variables Daniel Berend Tamir Tassa Abstract We rovide bounds for moments of sums of sequences of indeendent random variables. Concentrating
More informationBEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO
BEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO ANDREW GRANVILLE, DANIEL M. KANE, DIMITRIS KOUKOULOPOULOS, AND ROBERT J. LEMKE OLIVER Abstract. We determine for what
More informationUniformly best wavenumber approximations by spatial central difference operators: An initial investigation
Uniformly best wavenumber aroximations by satial central difference oerators: An initial investigation Vitor Linders and Jan Nordström Abstract A characterisation theorem for best uniform wavenumber aroximations
More informationPaper C Exact Volume Balance Versus Exact Mass Balance in Compositional Reservoir Simulation
Paer C Exact Volume Balance Versus Exact Mass Balance in Comositional Reservoir Simulation Submitted to Comutational Geosciences, December 2005. Exact Volume Balance Versus Exact Mass Balance in Comositional
More informationMersenne and Fermat Numbers
NUMBER THEORY CHARLES LEYTEM Mersenne and Fermat Numbers CONTENTS 1. The Little Fermat theorem 2 2. Mersenne numbers 2 3. Fermat numbers 4 4. An IMO roblem 5 1 2 CHARLES LEYTEM 1. THE LITTLE FERMAT THEOREM
More informationON THE DISTRIBUTION OF THE PARTIAL SUM OF EULER S TOTIENT FUNCTION IN RESIDUE CLASSES
C O L L O Q U I U M M A T H E M A T I C U M VOL. * 0* NO. * ON THE DISTRIBUTION OF THE PARTIAL SUM OF EULER S TOTIENT FUNCTION IN RESIDUE CLASSES BY YOUNESS LAMZOURI, M. TIP PHAOVIBUL and ALEXANDRU ZAHARESCU
More informationTHE LEAST PRIME QUADRATIC NONRESIDUE IN A PRESCRIBED RESIDUE CLASS MOD 4
THE LEAST PRIME QUADRATIC NONRESIDUE IN A PRESCRIBED RESIDUE CLASS MOD 4 PAUL POLLACK Abstract For all rimes 5, there is a rime quadratic nonresidue q < with q 3 (mod 4 For all rimes 3, there is a rime
More information