LIST OF PUBLICATIONS OF BUI MINH PHONG
|
|
|
- Tracy Mosley
- 8 years ago
- Views:
Transcription
1 Annales Univ. Sci. Budapest., Sect. Comp. 38 (2012) LIST OF PUBLICATIONS OF BUI MINH PHONG [1] On the connection between the rank of apparition of a prime p in Fibonacci sequence and the Fibonacci primitive roots, Fibonacci Quart., 15 (4) (1977), (with P. Kiss) [2] On a function concerning second-order recurrences, Annales Univ. Sci. Budapest. Sect. Math., 21 (1978), (with P. Kiss) [3] Divisibility properties in second order recurrences, Publ. Math. Debrecen, 26 (3-4) (1979), (with P. Kiss) [4] A generalization of A. Makowski s theorem on pseudoprime numbers, Tap chi Toan hoc, 7 (1979), (in Vietnamese). [5] On Lucas pseudoprimes which are products of s primes, Fibonacci numbers and their applications, Patras, 1984, Math. Appl., 28, Reidel, Dordrecht, 1986, (with P. Kiss and E. Lieuwens) [6] Lucas- és Lehmer-pszeudoprím számokról, Mat. Lapok, 33 (1-3) (1982/86), (On Lucas and Lehmer pseudoprime numbers) (Hungarian) [7] On super pseudoprimes which are products of three primes, Annales Univ. Sci. Budapest. Sect. Math., 30 (1987), [8] Kapcsolatok a különböző típusú Lucas pszeudoprímek között, Tudományos Közl. Eger, (1987), (Connections between Lucas pseudoprimes of different types (in Hungarian)) [9] On a problem of A. Rotkiewicz, Math. Comp., 48 (1987), (with P. Kiss) [10] Rotkiewicz egy problémájának általánosított megoldása, Mat. Lapok, 34 (1-3) (1987), Generalized solution of Rotkiewicz s problem (in Hungarian) [11] Lehmer sorozatok és Lehmer pszeudoprím számok, kandidátusi értekezés, Budapest, (Lehmer sequences and Lehmer pseudoprime numbers (in Hungarian), Candidate of Sciences Thesis) [12] Multiplicative functions satisfying a congruence property, Proceedings of the Regional Mathematical Conference, Kalsk, 1988, Pedagog. Univ. Zielona Góra, Zielona Góra, 1990,
![, 15 (4) (1977), 347-349. (with P. Kiss) [2] On a function concerning second-order recurrences, Annales Univ. Sci. Budapest. Sect. Math., 21 (1978), 119-122. (with P. Kiss) [3] Divisibility properties in second order recurrences, Publ.](/docs-images/42/6678942/images/page_1.jpg "Math. Debrecen, 26 (3-4) (1979), 187-197. (with P. Kiss) [4] A generalization of A. Makowski s theorem on pseudoprime numbers, Tap chi Toan hoc, 7 (1979), 16-19. (in Vietnamese).")
2 14 Bui Minh Phong [13] On super Lucas and super Lehmer pseudoprimes, Studia Sci. Math. Hungar., 23 (3-4) (1988), [14] On two Diophantine equations concerning Lucas sequences, Publ. Math. Debrecen, 35 (3-4) (1988), (with I. Joó) [15] Weakly composite Lucas numbers, Annales Univ. Sci. Budapest. Sect. Math., 31 (1988), (with P. Kiss) [16] The reciprocal sum of prime divisors of Lucas numbers, Tudományos Közl. Eger, (1989), (with P. Kiss) [17] On super Lehmer pseudoprimes, Studia Sci. Math. Hungar., 25 (1-2) (1990), (with I. Joó) [18] Multiplicative functions satisfying a congruence property II., Annales Univ. Sci. Budapest. Sect. Math., 33 (1990), [19] Note on multiplicative functions satisfying a congruence property, Annales Univ. Sci. Budapest. Sect. Math., 33 (1990), (with J. Fehér) [20] Note on a theorem of J.-L. Mauclaire and Leo Murata on multiplicative functions, Annales Univ. Sci. Budapest. Sect. Math., 33 (1990), [21] Multiplicative functions satisfying a congruence property, Studia Sci. Math. Hungar., 26 (1) (1991), [22] Multiplicative functions satisfying a congruence property III., Publ. Math. Debrecen, 39 (1-2) (1991), [23] Lucas primitive roots, Fibonacci Quart., 29 (1) (1991), [24] On generalized Lehmer sequences, Acta Math. Hungar., 57 (3-4) (1991), [25] Characterization of additive functions with values in a compact abelian group, Publ. Math. Debrecen, 40 (3-4) (1992), [26] On additive functions with values in a compact abelian group, Acta Sci. Math. Szeged, 56 (3-4) (1992), [27] On a theorem of Kátai-Wirsing, Acta Sci. Math. Szeged, 56 (3-4) (1992), [28] A note on multiplicative functions with regularity properties, Publ. Math. Debrecen, 41 (1-2) (1992), [29] Quadratic residues and related problems, Annales Univ. Sci. Budapest. Sect. Comp., 13 (1992), (with J.P. Jones) [30] Arithmetic functions with regularity properties, Österreichisch-Ungarisch- Slowakisches Kolloquium über Zahlentheorie, Maria Trost, 1992, Karl- Franzens-Univ. Graz, Grazer Math. Ber. 318 (1993),
![Kiss) [16] The reciprocal sum of prime divisors of Lucas numbers, Tudományos Közl. Eger, (1989), 47-54. (with P. Kiss) [17] On super Lehmer pseudoprimes, Studia Sci. Math. Hungar.](/docs-images/42/6678942/images/page_2.jpg ", 25 (1-2) (1990), 121-124. (with I. Joó) [18] Multiplicative functions satisfying a congruence property II., Annales Univ. Sci. Budapest. Sect. Math., 33 (1990), 253-259.")
3 List of publications 15 [31] Arithmetical functions with congruence properties, Annales Univ. Sci. Budapest. Sect. Math., 35 (1992), (with I. Joó) [32] Multiplicative functions satisfying a congruence property V., Acta Math. Hungar., 62 (1-2) (1993), [33] Recurrence sequences and pseudoprimes, Acta Acad. Paed. Agriensis, Sect. Mat., (1993), [34] A characterization of some arithmetical multiplicative functions, Acta Math. Hungar., 63 (1) (1994), [35] On the distribution of Lucas and Lehmer pseudoprimes, Annales Univ. Sci. Budapest. Sect. Comp., 14 (1994), [36] Characterization of pairs of additive functions with values in compact abelian groups, Annales Univ. Sci. Budapest. Sect. Comp., 14 (1994), [37] Characterizations of the logarithm as an additive function, Annales Univ. Sci. Budapest. Sect. Comp., 16 (1996), [38] A new characteristic of the identity function, J. Number Theory, 63 (2) (1997), (with J.-M. De Koninck and I. Kátai) [39] A characterization of the identity function, Acta Acad. Paedagog. Agriensis, Sect. Mat. (N.S.), 24 (1993), 3-9. [40] On some pairs of multiplicative functions correlated by an equation, New trends in probability and statistics, Vol. 4, Palanga, 1996, VSP, Utrecht, 1997, (with I. Kátai) [41] Multiplicative functions with regularity properties, Leaflets in Mathematics, Pécs, 1998, [42] On multiplicative functions satisfying a special relation, Acta Sci. Math. Szeged, 64 (1-2) (1998), (with J. Fehér and I. Kátai) [43] Quasi-multiplicative functions with congruence property, Acta Acad. Paedagog. Agriensis Sect. Mat. (N.S.), 25 (1998), [44] Note on multiplicative functions satisfying congruence property II., Math. Pannon., 10 (1) (1999), (with J. Fehér) [45] Reduced residue systems and a problem for multiplicative functions, Annales Univ. Sci. Budapest. Sect. Comp., 18 (1999), [46] Additive uniqueness sets for multiplicative functions, Publ. Math. Debrecen, 55 (3-4) (1999), (with P.V. Chung) [47] Perfect numbers concerning Fibonacci sequence, Acta Acad. Paedagog. Agriensis Sect. Mat. (N.S.), 26 (1999), 3-8.
![[34] A characterization of some arithmetical multiplicative functions, Acta Math. Hungar., 63 (1) (1994), 29-43. [35] On the distribution of Lucas and Lehmer pseudoprimes, Annales Univ. Sci. Budapest.](/docs-images/42/6678942/images/page_3.jpg "Sect. Comp., 14 (1994), 145-163. [36] Characterization of pairs of additive functions with values in compact abelian groups, Annales Univ. Sci. Budapest. Sect. Comp., 14 (1994), 165-173.")
4 16 Bui Minh Phong [48] On some pairs of multiplicative functions correlated by an equation II., Aequationes Math., 59 (3) (2000), (with I. Kátai) [49] A characterization of n s as a multiplicative function, Acta Math. Hungar., 87 (4) (2000), (with I. Kátai) [50] On completely additive functions satisfying a congruence, Annales Univ. Sci. Budapest. Sect. Comp., 19 (2000), (with A. Kovács) [51] A characterization of some unimodular multiplicative functions, Publ. Math. Debrecen, 57 (3-4) (2000), [52] On a problem of Fabrykowski and Subbarao concerning quasi multiplicative functions satisfying a congruence property, Acta Math. Hungar., 89 (1-2) (2000), (with J. Fehér) [53] Reduced residue systems and a problem for multiplicative functions II., Annales Univ. Sci. Budapest. Sect. Comp., 20 (2001), [54] Multiplicative functions satisfying a congruence property IV., Acta Acad. Paedagog. Agriensis Sect. Mat. (N.S.), 28 (2001), [55] A characterization of some unimodular multiplicative functions II., Annales Univ. Sci. Budapest. Sect. Comp., 21 (2002), [56] On arithmetical functions satisfying congruence properties, Annales Univ. Sci. Budapest. Sect. Comp., 22 (2003), [57] On additive functions satisfying congruence properties, Acta Acad. Paedagog. Agriensis Sect. Mat. (N.S.), 30 (2003), [58] Elementary problems which are equivalent to the Goldbach s conjecture, Acta Acad. Paedagog. Agriensis Sect. Mat. (N.S.), 31 (2004), (with D.D. Li) [59] On sets characterizing the identity function, Annales Univ. Sci. Budapest. Sect. Comp., 24 (2004), [60] A characterization of the identity function with an equation of Hosszú type, Publ. Math. Debrecen, 69 (1-2) (2006), [61] On completely multiplicative functions whose values are roots of unity, Acta Math. Hungar., 113 (1-2) (2006), [62] Additive uniqueness sets for multiplicative functions, Annales Univ. Sci. Budapest. Sect. Comp., 26 (2006), (with K.-H. Indlekofer) [63] On integer-valued arithmetical functions satisfying congruence properties, Annales Univ. Sci. Budapest. Sect. Comp., 27 (2007), [64] On a problem of Kátai and Subbarao, Analytic and probabilistic methods in number theory, TEV, Vilnius, 2007,
![Kátai) [50] On completely additive functions satisfying a congruence, Annales Univ. Sci. Budapest. Sect. Comp., 19 (2000), 237-249. (with A.](/docs-images/42/6678942/images/page_4.jpg "Kovács) [51] A characterization of some unimodular multiplicative functions, Publ. Math. Debrecen, 57 (3-4) (2000), 339-366.")
5 List of publications 17 [65] On some pairs of multiplicative functions with small increments, Annales Univ. Sci. Budapest. Sect. Comp., 28 (2008), [66] A characterization of the identity function with functional equations, Annales Univ. Sci. Budapest. Sect. Comp., 32 (2010), [67] On the pair of multiplicative functions satisfying a congruence property, Annales Univ. Sci. Budapest. Sect. Comp., 33 (2010), [68] On the pairs of multiplicative functions with a special relation, Annales Univ. Sci. Budapest. Sect. Comp., 34 (2011), [69] On multiplicative functions with shifted arguments, Annales Univ. Sci. Budapest. Sect. Comp., 35 (2011), [70] On real valued additive functions modulo 1, Annales Univ. Sci. Budapest. Sect. Comp., 36 (2012), (with K. Chakraborty and I. Kátai) [71] On additive functions satisfying some relations, Annales Univ. Sci. Budapest. Sect. Comp., 38 (2012), (with K. Chakraborty and I. Kátai) [72] On the values of arithmetic functions in short intervals, Annales Univ. Sci. Budapest. Sect. Comp., 38 (2012), (with K. Chakraborty and I. Kátai)
![[67] On the pair of multiplicative functions satisfying a congruence property, Annales Univ. Sci. Budapest. Sect. Comp., 33 (2010), 101-122.](/docs-images/42/6678942/images/page_5.jpg "[68] On the pairs of multiplicative functions with a special relation, Annales Univ. Sci. Budapest. Sect. Comp., 34 (2011), 45-66.")
On the largest prime factor of x 2 1
On the largest prime factor of x 2 1 Florian Luca and Filip Najman Abstract In this paper, we find all integers x such that x 2 1 has only prime factors smaller than 100. This gives some interesting numerical
LUC: A New Public Key System
LUC: A New Public Key System Peter J. Smith a and Michael J. J. Lennon b a LUC Partners, Auckland UniServices Ltd, The University of Auckland, Private Bag 92019, Auckland, New Zealand. b Department of
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
FACTORING. n = 2 25 + 1. fall in the arithmetic sequence
FACTORING The claim that factorization is harder than primality testing (or primality certification) is not currently substantiated rigorously. As some sort of backward evidence that factoring is hard,
B elektronikus számológép, NIM DOK (1965), 3 14. 3. O. Kis, P. Vértesi, Numerikus és grafikus módszerek (Egységes egyetemi jegyzet),
LIST OF PUBLICATIONS OF P. VÉRTESI 1. B. Almássy, P. Vértesi, Csővezetékhálózatok számítása (A National-Elliott 803 B elektronikus számológép alkalmazása. Statika, hidraulika, külfejtés, geodézia.), NIM
BABCSÁNYI ISTVÁN PUBLIKÁCIÓI HIVATKOZÁSOKKAL
BABCSÁNYI ISTVÁN PUBLIKÁCIÓI HIVATKOZÁSOKKAL (2007. február 26.) 1. A félperfekt kváziautomatákról, Mat. Lapok, 21, 1970, pp. 95-102 (in Hungarian with English summary). [MR 46.5070; Zbl 223.94028] h1/1.
List of publications 2014. A. Peer Reviewed Articles: 1. J.M. De Koninck, On a class of arithmetical functions, Duke Math.J., 39 (1972), 807-818.
List of publications 2014 A. Peer Reviewed Articles: 1. J.M. De Koninck, On a class of arithmetical functions, Duke Math.J., 39 (1972), 807-818. 2. J.M. De Koninck, Sums of quotients of additive functions,
On Generalized Fermat Numbers 3 2n +1
Applied Mathematics & Information Sciences 4(3) (010), 307 313 An International Journal c 010 Dixie W Publishing Corporation, U. S. A. On Generalized Fermat Numbers 3 n +1 Amin Witno Department of Basic
Numbers, Functions, Equations 2013 (NFE 13) Hotel Visegrád, Visegrád (Hungary), June 28 30, 2013. Program
June 28, Friday 12:30 14:00 Lunch 1 ST Afternoon Session Chairman: Zsolt Páles 14:00 14:10 Conference opening 14:10 14:35 Járai, Antal: On regularity properties of solutions defined on positive definite
ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS
ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS YANN BUGEAUD, FLORIAN LUCA, MAURICE MIGNOTTE, SAMIR SIKSEK Abstract If n is a positive integer, write F n for the nth Fibonacci number, and ω(n) for the number
COMMUTATIVITY DEGREE, ITS GENERALIZATIONS, AND CLASSIFICATION OF FINITE GROUPS
COMMUTATIVITY DEGREE, ITS GENERALIZATIONS, AND CLASSIFICATION OF FINITE GROUPS ABSTRACT RAJAT KANTI NATH DEPARTMENT OF MATHEMATICS NORTH-EASTERN HILL UNIVERSITY SHILLONG 793022, INDIA COMMUTATIVITY DEGREE,
UNIVERSITY GRADUATE STUDIES PROGRAM SILLIMAN UNIVERSITY DUMAGUETE CITY. Master of Science in Mathematics
1 UNIVERSITY GRADUATE STUDIES PROGRAM SILLIMAN UNIVERSITY DUMAGUETE CITY Master of Science in Mathematics Introduction The Master of Science in Mathematics (MS Math) program is intended for students who
8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
Integer Factorization using the Quadratic Sieve
Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give
Monogenic Fields and Power Bases Michael Decker 12/07/07
Monogenic Fields and Power Bases Michael Decker 12/07/07 1 Introduction Let K be a number field of degree k and O K its ring of integers Then considering O K as a Z-module, the nicest possible case is
Chapter 1 A Pri Characterization of T m e Pairs w in Proceedings NCUR V. (1991), Vol. I, pp. 362{366. Jerey F. Gold Department of Mathematics, Department of Physics University of Utah DonH.Tucker Department
Continued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
Math 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
THE SEARCH FOR AURIFEUILLIAN-LIKE FACTORIZATIONS
THE SEARCH FOR AURIFEUILLIAN-LIKE FACTORIZATIONS S. S. Wagstaff, Jr. 1 Department of Computer Science, Purdue University, West Lafayette, IN 47097, USA ssw@cerias.purdue.edu Received:, Revised:, Accepted:,
ON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME
ON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME Alexey Chuprunov Kazan State University, Russia István Fazekas University of Debrecen, Hungary 2012 Kolchin s generalized allocation scheme A law of
Cryptography and Network Security Chapter 8
Cryptography and Network Security Chapter 8 Fifth Edition by William Stallings Lecture slides by Lawrie Brown (with edits by RHB) Chapter 8 Introduction to Number Theory The Devil said to Daniel Webster:
Homework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
On the largest prime factor of the Mersenne numbers
On the largest prime factor of the Mersenne numbers Kevin Ford Department of Mathematics The University of Illinois at Urbana-Champaign Urbana Champaign, IL 61801, USA ford@math.uiuc.edu Florian Luca Instituto
CHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
FACTORING CERTAIN INFINITE ABELIAN GROUPS BY DISTORTED CYCLIC SUBSETS
International Electronic Journal of Algebra Volume 6 (2009) 95-106 FACTORING CERTAIN INFINITE ABELIAN GROUPS BY DISTORTED CYCLIC SUBSETS Sándor Szabó Received: 11 November 2008; Revised: 13 March 2009
CURRICULUM VITAE of Giuseppe Molteni
CURRICULUM VITAE of Giuseppe Molteni Personal information Address: Dipartimento di Matematica, Università di Milano, Via Saldini 50, I-20133 Milano (Italy) Phone number: (+39) 02 503 16144 e-mail: giuseppe.molteni1@unimi.it
MATHEMATICS. Administered by the Department of Mathematical and Computing Sciences within the College of Arts and Sciences. Degree Requirements
MATHEMATICS Administered by the Department of Mathematical and Computing Sciences within the College of Arts and Sciences. Paul Feit, PhD Dr. Paul Feit is Professor of Mathematics and Coordinator for Mathematics.
NEW DIGITAL SIGNATURE PROTOCOL BASED ON ELLIPTIC CURVES
NEW DIGITAL SIGNATURE PROTOCOL BASED ON ELLIPTIC CURVES Ounasser Abid 1, Jaouad Ettanfouhi 2 and Omar Khadir 3 1,2,3 Laboratory of Mathematics, Cryptography and Mechanics, Department of Mathematics, Fstm,
2 Primality and Compositeness Tests
Int. J. Contemp. Math. Sciences, Vol. 3, 2008, no. 33, 1635-1642 On Factoring R. A. Mollin Department of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada, T2N 1N4 http://www.math.ucalgary.ca/
Smooth numbers and the quadratic sieve
Algorithmic Number Theory MSRI Publications Volume 44, 2008 Smooth numbers and the quadratic sieve CARL POMERANCE ABSTRACT. This article gives a gentle introduction to factoring large integers via the
RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES
RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES DARRYL MCCULLOUGH AND ELIZABETH WADE In [9], P. W. Wade and W. R. Wade (no relation to the second author gave a recursion formula that produces Pythagorean
An Introductory Course in Elementary Number Theory. Wissam Raji
An Introductory Course in Elementary Number Theory Wissam Raji 2 Preface These notes serve as course notes for an undergraduate course in number theory. Most if not all universities worldwide offer introductory
THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0
THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0 RICHARD J. MATHAR Abstract. We count solutions to the Ramanujan-Nagell equation 2 y +n = x 2 for fixed positive n. The computational
A generalized allocation scheme
Annales Mathematicae et Informaticae 39 (202) pp. 57 70 Proceedings of the Conference on Stochastic Models and their Applications Faculty of Informatics, University of Debrecen, Debrecen, Hungary, August
International Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013
FACTORING CRYPTOSYSTEM MODULI WHEN THE CO-FACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II Mohammedia-Casablanca,
Optimal and nearly optimal online and semi-online algorithms for some scheduling problems
Optimal and nearly optimal online and semi-online algorithms for some scheduling problems Ph.D. thesis Made by: Dósa György Supervisor: Vízvári Béla University of Szeged, Faculty of Science Doctoral School
Groups with the same orders and large character degrees as PGL(2, 9) 1. Introduction and preliminary results
Quasigroups and Related Systems 21 (2013), 239 243 Groups with the same orders and large character degrees as PGL(2, 9) Behrooz Khosravi Abstract. An interesting class of problems in character theory arises
Chapter 4 Complementary Sets Of Systems Of Congruences Proceedings NCUR VII. è1993è, Vol. II, pp. 793í796. Jeærey F. Gold Department of Mathematics, Department of Physics University of Utah Don H. Tucker
Master of Arts in Mathematics
Master of Arts in Mathematics Administrative Unit The program is administered by the Office of Graduate Studies and Research through the Faculty of Mathematics and Mathematics Education, Department of
EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION
EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION CHRISTIAN ROBENHAGEN RAVNSHØJ Abstract. Consider the Jacobian of a genus two curve defined over a finite field and with complex multiplication.
Primality - Factorization
Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.
Alex, I will take congruent numbers for one million dollars please
Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory
ON SUPERCYCLICITY CRITERIA. Nuha H. Hamada Business Administration College Al Ain University of Science and Technology 5-th st, Abu Dhabi, 112612, UAE
International Journal of Pure and Applied Mathematics Volume 101 No. 3 2015, 401-405 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v101i3.7
COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS
COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V. EROVENKO AND B. SURY ABSTRACT. We compute commutativity degrees of wreath products A B of finite abelian groups A and B. When B
PRIME FACTORS OF CONSECUTIVE INTEGERS
PRIME FACTORS OF CONSECUTIVE INTEGERS MARK BAUER AND MICHAEL A. BENNETT Abstract. This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in
Probability and Statistics
Probability and Statistics Syllabus for the TEMPUS SEE PhD Course (Podgorica, April 4 29, 2011) Franz Kappel 1 Institute for Mathematics and Scientific Computing University of Graz Žaneta Popeska 2 Faculty
THE CONGRUENT NUMBER PROBLEM
THE CONGRUENT NUMBER PROBLEM KEITH CONRAD 1. Introduction A right triangle is called rational when its legs and hypotenuse are all rational numbers. Examples of rational right triangles include Pythagorean
2015-2016 Academic Catalog
2015-2016 Academic Catalog Master of Science in Secondary Mathematics Education Graduate Arts and Sciences Tetyana Berezovski, Ph.D., Direct, Five-year Mathematics Education Program Barbelin Hall 237,
MATH. ALGEBRA I HONORS 9 th Grade 12003200 ALGEBRA I HONORS
* Students who scored a Level 3 or above on the Florida Assessment Test Math Florida Standards (FSA-MAFS) are strongly encouraged to make Advanced Placement and/or dual enrollment courses their first choices
Sequence of Mathematics Courses
Sequence of ematics Courses Where do I begin? Associates Degree and Non-transferable Courses (For math course below pre-algebra, see the Learning Skills section of the catalog) MATH M09 PRE-ALGEBRA 3 UNITS
Mathematics (MAT) MAT 061 Basic Euclidean Geometry 3 Hours. MAT 051 Pre-Algebra 4 Hours
MAT 051 Pre-Algebra Mathematics (MAT) MAT 051 is designed as a review of the basic operations of arithmetic and an introduction to algebra. The student must earn a grade of C or in order to enroll in MAT
ON HENSEL S ROOTS AND A FACTORIZATION FORMULA IN Z[[X]]
![ON HENSEL S ROOTS AND A FACTORIZATION FORMULA IN Z[[X]]](/thumbs/33/16419341.jpg "ON HENSEL S ROOTS AND A FACTORIZATION FORMULA IN Z[[X]]")
#A47 INTEGERS 4 (204) ON HENSEL S ROOTS AND A FACTORIZATION FORMULA IN Z[[X]] Daniel Birmaer Department of Mathematics, Nazareth College, Rochester, New Yor abirma6@naz.edu Juan B. Gil Penn State Altoona,
Recent Breakthrough in Primality Testing
Nonlinear Analysis: Modelling and Control, 2004, Vol. 9, No. 2, 171 184 Recent Breakthrough in Primality Testing R. Šleževičienė, J. Steuding, S. Turskienė Department of Computer Science, Faculty of Physics
Multiples and Divisors Steven Finch. January 27, 2004
Multiples and Divisors Steven Finch January 27, 2004 Before discussing multiplication, let us speak about addition. The number A(k) of distinct sums i + j k such that 1 i k/2, 1 j k/2 is clearly 2 bk/2c
Every Positive Integer is the Sum of Four Squares! (and other exciting problems)
Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer
Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
On some Formulae for Ramanujan s tau Function
Revista Colombiana de Matemáticas Volumen 44(2010)2, páginas 103-112 On some Formulae for Ramanujan s tau Function Sobre algunas fórmulas para la función tau de Ramanujan Luis H. Gallardo University of
A DETERMINATION OF ALL NORMAL DIVISION ALGEBRAS OVER AN ALGEBRAIC NUMBER FIELD*
A DETERMINATION OF ALL NORMAL DIVISION ALGEBRAS OVER AN ALGEBRAIC NUMBER FIELD* BY A. ADRIAN ALBERT AND HELMUT HASSE t 1. Introduction. The principal problem in the theory of linear algebras is that of
Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may
Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition
Factoring Whole Numbers
2.2 Factoring Whole Numbers 2.2 OBJECTIVES 1. Find the factors of a whole number 2. Find the prime factorization for any number 3. Find the greatest common factor (GCF) of two numbers 4. Find the GCF for
Precalculus REVERSE CORRELATION. Content Expectations for. Precalculus. Michigan CONTENT EXPECTATIONS FOR PRECALCULUS CHAPTER/LESSON TITLES
Content Expectations for Precalculus Michigan Precalculus 2011 REVERSE CORRELATION CHAPTER/LESSON TITLES Chapter 0 Preparing for Precalculus 0-1 Sets There are no state-mandated Precalculus 0-2 Operations
Grade 7 & 8 Math Circles October 19, 2011 Prime Numbers
1 University of Waterloo Faculty of Mathematics Centre for Education in Mathematics and Computing Grade 7 & 8 Math Circles October 19, 2011 Prime Numbers Factors Definition: A factor of a number is a whole
Grade 7/8 Math Circles Fall 2012 Factors and Primes
1 University of Waterloo Faculty of Mathematics Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Fall 2012 Factors and Primes Factors Definition: A factor of a number is a whole
Complexity problems over algebraic structures
Complexity problems over algebraic structures Theses of PhD dissertation Created by: Horváth Gábor Mathematical Doctoral School Theor. Mathematical Doctoral Program Dir. of School: Dr. Laczkovich Miklós
Finding Carmichael numbers
Finding Carmichael numbers Notes by G.J.O. Jameson Introduction Recall that Fermat s little theorem says that if p is prime and a is not a multiple of p, then a p 1 1 mod p. This theorem gives a possible
Big Ideas in Mathematics
Big Ideas in Mathematics which are important to all mathematics learning. (Adapted from the NCTM Curriculum Focal Points, 2006) The Mathematics Big Ideas are organized using the PA Mathematics Standards
Wald s Identity. by Jeffery Hein. Dartmouth College, Math 100
Wald s Identity by Jeffery Hein Dartmouth College, Math 100 1. Introduction Given random variables X 1, X 2, X 3,... with common finite mean and a stopping rule τ which may depend upon the given sequence,
How To Understand And Solve Algebraic Equations
College Algebra Course Text Barnett, Raymond A., Michael R. Ziegler, and Karl E. Byleen. College Algebra, 8th edition, McGraw-Hill, 2008, ISBN: 978-0-07-286738-1 Course Description This course provides
How To Find Out How To Build An Elliptic Curve Over A Number Field
Numbers Volume 2015, Article ID 501629, 4 pages http://dx.doi.org/10.1155/2015/501629 Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions Rintaro Kozuma College of International
Florida Math for College Readiness
Core Florida Math for College Readiness Florida Math for College Readiness provides a fourth-year math curriculum focused on developing the mastery of skills identified as critical to postsecondary readiness
COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS
Bull Austral Math Soc 77 (2008), 31 36 doi: 101017/S0004972708000038 COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V EROVENKO and B SURY (Received 12 April 2007) Abstract We compute
Benford s Law and Fraud Detection, or: Why the IRS Should Care About Number Theory!
Benford s Law and Fraud Detection, or: Why the IRS Should Care About Number Theory! Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller/ Bronfman Science
Counting Primes whose Sum of Digits is Prime
2 3 47 6 23 Journal of Integer Sequences, Vol. 5 (202), Article 2.2.2 Counting Primes whose Sum of Digits is Prime Glyn Harman Department of Mathematics Royal Holloway, University of London Egham Surrey
Powers of Two in Generalized Fibonacci Sequences
Revista Colombiana de Matemáticas Volumen 462012)1, páginas 67-79 Powers of Two in Generalized Fibonacci Sequences Potencias de dos en sucesiones generalizadas de Fibonacci Jhon J. Bravo 1,a,B, Florian
On continued fractions of the square root of prime numbers
On continued fractions of the square root of prime numbers Alexandra Ioana Gliga March 17, 2006 Nota Bene: Conjecture 5.2 of the numerical results at the end of this paper was not correctly derived from
Cryptography and Network Security Number Theory
Cryptography and Network Security Number Theory Xiang-Yang Li Introduction to Number Theory Divisors b a if a=mb for an integer m b a and c b then c a b g and b h then b (mg+nh) for any int. m,n Prime
MATH 537 (Number Theory) FALL 2016 TENTATIVE SYLLABUS
MATH 537 (Number Theory) FALL 2016 TENTATIVE SYLLABUS Class Meetings: MW 2:00-3:15 pm in Physics 144, September 7 to December 14 [Thanksgiving break November 23 27; final exam December 21] Instructor:
MATHEMATICAL SCIENCES, BACHELOR OF SCIENCE (B.S.) WITH A CONCENTRATION IN APPLIED MATHEMATICS
VCU MATHEMATICAL SCIENCES, BACHELOR OF SCIENCE (B.S.) WITH A CONCENTRATION IN APPLIED MATHEMATICS The curriculum in mathematical sciences promotes understanding of the mathematical sciences and their structures,
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
How To Factorize Of Finite Abelian Groups By A Cyclic Subset Of A Finite Group
Comment.Math.Univ.Carolin. 51,1(2010) 1 8 1 A Hajós type result on factoring finite abelian groups by subsets II Keresztély Corrádi, Sándor Szabó Abstract. It is proved that if a finite abelian group is
SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
Higher Education in Hungary
in Hungary Institute for Theoretical Physics Eötvös University RECFA visit to Hungary, October 4-5, 2013 Some facts about Hungary Population: 9.9 million GDP (2012): 98 billion EUR GDP per capita (2012):
The cyclotomic polynomials
The cyclotomic polynomials Notes by G.J.O. Jameson 1. The definition and general results We use the notation e(t) = e 2πit. Note that e(n) = 1 for integers n, e(s + t) = e(s)e(t) for all s, t. e( 1 ) =
Mathematics INDIVIDUAL PROGRAM INFORMATION 2014 2015. 866.Macomb1 (866.622.6621) www.macomb.edu
Mathematics INDIVIDUAL PROGRAM INFORMATION 2014 2015 866.Macomb1 (866.622.6621) www.macomb.edu Mathematics PROGRAM OPTIONS CREDENTIAL TITLE CREDIT HOURS REQUIRED NOTES Associate of Arts Mathematics 62
ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION
ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION Aldrin W. Wanambisi 1* School of Pure and Applied Science, Mount Kenya University, P.O box 553-50100, Kakamega, Kenya. Shem Aywa 2 Department of Mathematics,
Determining the Optimal Combination of Trial Division and Fermat s Factorization Method
Determining the Optimal Combination of Trial Division and Fermat s Factorization Method Joseph C. Woodson Home School P. O. Box 55005 Tulsa, OK 74155 Abstract The process of finding the prime factorization
Best Monotone Degree Bounds for Various Graph Parameters
Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer
Ideal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen
CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents
MATHEMATICS (MATH) 3. Provides experiences that enable graduates to find employment in sciencerelated
194 / Department of Natural Sciences and Mathematics MATHEMATICS (MATH) The Mathematics Program: 1. Provides challenging experiences in Mathematics, Physics, and Physical Science, which prepare graduates
NUMERICAL CALCULATION OF THE DENSITY OF PRIME NUMBERS WITH A GIVEN LEAST PRIMITIVE ROOT
MATHEMATICS OF COMPUTATION Volume 71, Number 240, Pages 1781 1797 S 0025-5718(01)01382-5 Article electronically published on November 28, 2001 NUMERICAL CALCULATION OF THE DENSITY OF PRIME NUMBERS WITH
CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA
We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical
Georgia Department of Education Kathy Cox, State Superintendent of Schools 7/19/2005 All Rights Reserved 1
Accelerated Mathematics 3 This is a course in precalculus and statistics, designed to prepare students to take AB or BC Advanced Placement Calculus. It includes rational, circular trigonometric, and inverse
Number Theory Hungarian Style. Cameron Byerley s interpretation of Csaba Szabó s lectures
Number Theory Hungarian Style Cameron Byerley s interpretation of Csaba Szabó s lectures August 20, 2005 2 0.1 introduction Number theory is a beautiful subject and even cooler when you learn about it
Office of Institutional Research & Planning
NECC Northern Essex Community College NECC College Math Tutoring Center Results Spring 2011 The College Math Tutoring Center at Northern Essex Community College opened its doors to students in the Spring
Congruent Number Problem
University of Waterloo October 28th, 2015 Number Theory Number theory, can be described as the mathematics of discovering and explaining patterns in numbers. There is nothing in the world which pleases
CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
( ) ( ) [2],[3],[4],[5],[6],[7]
![( ) ( ) [2],[3],[4],[5],[6],[7]](/thumbs/39/20163578.jpg "( ) ( ) [2],[3],[4],[5],[6],[7]")
( ) ( ) Lebesgue Takagi, - []., [2],[3],[4],[5],[6],[7].,. [] M. Hata and M. Yamaguti, The Takagi function and its generalization, Japan J. Appl. Math., (984), 83 99. [2] T. Sekiguchi and Y. Shiota, A
s-convexity, model sets and their relation
s-convexity, model sets and their relation Zuzana Masáková Jiří Patera Edita Pelantová CRM-2639 November 1999 Department of Mathematics, Faculty of Nuclear Science and Physical Engineering, Czech Technical
Hilberts Entscheidungsproblem, the 10th Problem and Turing Machines
Hilberts Entscheidungsproblem, the 10th Problem and Turing Machines Nitin Saxena (Hausdorff Center for Mathematics, Bonn) [Happy] [100 th ] [Alan] [Mathison] [Turing!][][][]... **all pictures are works