DOCSLIB.ORG

Open Problems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Open Problems Pere Ara Problem. Determine the kernel of the natural map GL1(R) --t K1(R) when R is a separative exchange ring. This has been solved for unit-regular rings and regular right self-injective rings by Menal and Moncasi [Po Menal and J. Moncasi, Kl of von Neumann regular rings, J. Pure and Applied Algebra 33 (1984), 295-312], and for exchange rings with primitive factor rings Artinian by Chen and Li [H. Chen and F.-U. Li, Whitehead groups of exchange rings with primitive factor rings artinian, Preprintj. In all cases, one gets K1(R) = GL1(R)ab provided that 1/2 E R. Yoshitomo Baba Problem. For given modules M and N, we say that Mis N-injective if there exists an extension homomorphism f' from N to M for each sub­ module N' of N and each homomorphism f from N' to M. Also we say M is simple-N-injective if there exists an extension homomorphism f' from N to M for each submodule N' of N and each homomorphism f from N' to M with the image of f simple. Let R be a perfect ring and M, N given R-modules with the sode of M simple. If M is simple-N-injective, then is ManN-injective module? If R is a semiprimary ring, then we know that any simple-N-injective module is N-injective for given R-modules M and N with the so de of M simple by Proposition 2 in [Y. Baba and K. Oshiro, On a theorem of Fuller, J. Algebra 154 (1993), 86-94j. This open problem was first given by M. Hoshino of the University of Tsukuba to Y. Baba. Gary F. Birkenmeier, Jae Keol Park and Jin Yong Kim Problem. In [G. F. Birkenmeier, Idempotents and completely semiprime ideals, Comm. Algebra 11 (1983),567-580], an idempotent e E R is called left (right) semicentral if Re = eRe (eR = eRe). We use S£(R) and Sr(R) for the sets of all left and right semicentral idempotents, respectively. For an idempotent e E R, observe that S£(eRe) = {O, e} if and only if Sr (eRe) = {O, e}; when this occurs e is said to be semicentral reduced. If 1, the unity of R, is semicentral reduced, then R is said to be semicentral reduced [G. F. Birkenmeier, H. E. Heatherly, J. Y. Kim and J. K. Park, Open Problems 442 Triangular matrix representations, To appear in J. Algebra]. In the paper "Semicentral reduced algebras" by G. F. Birkenmeier, J. Y. Kim and J. K. Park in this Proceedings, it is shown that for any positive integer n, R is semicentral reduced if and only if the n-by-n full matrix ring Mn{R) is semicentral reduced. Now we ask: Is the semicentral reduced property a Morita invariant property? Yasuyuki Hirano Problem. A ring is called a quasi-Baer ring, if the left annihilator of every left ideal is generated by an idempotent. Let R be a quasi-Baer ring, G a finite group and suppose that the order of G is invertible in R. Then is the group ring R[GJ quasi-Baer? Hidetoshi Marubayashi Problem 1. Find necessary and sufficient conditions for the generalized crossed product algebras R * G to be semi-hereditary and Priifer in terms of G and R. Problem 2. Let P be a prime ideal of a fully bounded Priifer order in a simple Artinian ring. Is R/P a Goldie ring? (If R is a Dubrovin valuation ring, then the answer is affirmative.) Problem 3. Does the approximation theorem hold in the case that the order is a semi-local Bezout order without the assumption that the order is a PI-ring? We may assume that R;, are all fully bounded Dubrovin valuation rings. For definitions and relevant references, see the paper "Non­ Commutative valuation rings and their global theories" by H. Marubayashi in this Proceedings. Kaoru Motose Problem. Let <pn{x) be the cyclotomic polynomial of order n. Factorize the next number (repunit of 97 digits): 97 1097 -1 .......-....­ <P97{1O) = 10 _ 1 = 111· .. 1. Recently it has been shown that <pn{a) for 2 ::; n ::; 100 and 2 ::; a ::; 10, up to the above case n = 97 and a = 10, can be factorized. Open Problems 443 w. K. Nicholson and M. F. Yousif Problem. Following Harada, an associative ring R is called right simple­ injective if, for each right ideal T of R, every R-linear map from T into R with simple-image extends to R, i.e., the map is given by left multiplication by an element c of R. In [W. K. Nicholson and M. F. Yousif, On perfect simple-injective rings, Proc. Amer. Math. Soc. 125 (1997), 979-985]' it was shown that every semiprimary right simple-injective ring R is right self-injective, every left perfect left and right simple-injective ring R is a quasi-Frobenius ring, and an example of a left perfect left simple-injective ring was provided. It is an open question whether every left perfect right simple-injective ring is right self-injective. K. M. Rangaswamy Problem. Is a Butler module over a valuation domain completely decom­ posable? (For the definition and relevant references, see the paper "On torsion-free modules over valuation domains" by K. M. Rangaswamy in this Proceedings.) s. Tariq Rizvi If x, yare elements in a modular lattice L with x ::; y, then y/x will denote the interval [x, y], i.e., y/x = {a ELI x::; a::; y}. The Krull dimension of a partially ordered set (P, ::;), denoted by "'( P), is an ordinal number defined recursively as follows: ",(P) = -1 if and only if P is a trivial poset, where -1 is assumed to be the predecessor of zero. Let a 2 0 be an ordinal number, and assume that we have already defined which posets have Krull dimension (3 for any ordinal (3 < a. Then we define: ",(P) = a if and only if ",(P) ~ (3 for all ordinals (3 with (3 < a, and for any descending chain Xl 2 X2 2 ... 2 Xn 2 ... of elements of P, there exists a positive integer no such that "'(Xn/Xn+l) < a for all n 2 no, i.e., for all n 2 no, "'(Xn/Xn+l) has previously been defined and it is an ordinal < a. If no ordinal a exists such that ",(P) = a, we say that P does not have Krull dimension. The dual Krull dimension of the poset P, denoted by ",O(P), is defined as being the Krull dimension ",(PO) of the opposite poset pO of P (if it exists). Recall that a module MR is called quotient finite dimensional (or qfd), if every factor module of M has finite uniform (or Goldie) dimension. For Open Problems 444 any module MR, we denote: C(M) := {X ~ M I X is cyclic}; F(M) := {X ~ M I X is finitely generated}. Recently, Albu and Rizvi in [1, Theorem 1.12] have shown that MR is Artinian {:} M is qfd and r;,(C(M)) ~ O. (Here, r;,( C(M)) means the Krull dimension of the poset C(M) of all cyclic submodules of M, ordered by inclusion.) It is natural to ask whether this result can be extended to an arbitrary Krull dimension a? Hence prove or disprove: Problem 1. For any right R-module M, r;,(MR) ~ a {:} M is qfd and r;,(C(M)) ~ a. Remark. We have shown that a slightly weaker version of this problem holds true in case one replaces C(M) by F(M), see [1, Theorem 1.17]: r;,(MR) ~ a {:} M is qfd and r;,(F(M)) ~ a. In [6, Lemma 6] (also [5, Theorem 6.3]), Huynh, Dung and Smith have shown the following interesting and useful result: The following are equivalent for a module MR and an ordinal a ~ O. (1) r;,(M) ~ a. (2) Every homomorphic image of M has an essential submodule E with r;,(E) ~ a. It would be very nice to obtain a dual of this result. Hence prove or disprove: Problem 2. The following are equivalent for a module MR and an ordinal a ~ O. (1) r;,°(M) ~ a. (2) Every submodule X of M has a small submodule S with r;,°(XjS) ~ a. Remarks. We suspect that this equivalence may hold true. Note that the equivalence holds true for a = 0 since r;,°(Xj S) ~ 0 for a small submodule S of X implies that X is finitely generated. In order to prove this result in general, we only need to show that condition (2) implies that M is qfd, and then use [1, Proposition 2.2]. A module M is called extending if every submodule of M is essential in a direct summand. We call a module FI-extending if every fully invariant Open Problems 445 submodule is essential in a direct summand. In a recent paper, Birken­ meier, Muller and Rizvi [2) have shown that in contrast to the extending modules, arbitrary direct sums of FI-extending modules are always FI­ extending. (The FI-extending property is also shown to carryover to matrix rings, unlike the extending property.) It is presently unknown if the FI-extending property is inherited by direct summands of arbitrary FI-extending modules. Problem 3. Let M be an FI-extending R-module. Is every direct sum­ mand of M also FI-extending? If not, then find necessary and sufficient conditions for this to hold true. Remarks. Birkenmeier, C81ugareanu, Fuchs and Goeters in their inves­ tigations have proved that for FI-extending abelian groups, the answer to this question is yes [3, Theorem 3.2).
Recommended publications
  • An Amazing Prime Heuristic.Pdf

    An Amazing Prime Heuristic.Pdf

    This document has been moved to https://arxiv.org/abs/2103.04483 Please use that version instead. AN AMAZING PRIME HEURISTIC CHRIS K. CALDWELL 1. Introduction The record for the largest known twin prime is constantly changing. For example, in October of 2000, David Underbakke found the record primes: 83475759 264955 1: · The very next day Giovanni La Barbera found the new record primes: 1693965 266443 1: · The fact that the size of these records are close is no coincidence! Before we seek a record like this, we usually try to estimate how long the search might take, and use this information to determine our search parameters. To do this we need to know how common twin primes are. It has been conjectured that the number of twin primes less than or equal to N is asymptotic to N dx 2C2N 2C2 2 2 Z2 (log x) ∼ (log N) where C2, called the twin prime constant, is approximately 0:6601618. Using this we can estimate how many numbers we will need to try before we find a prime. In the case of Underbakke and La Barbera, they were both using the same sieving software (NewPGen1 by Paul Jobling) and the same primality proving software (Proth.exe2 by Yves Gallot) on similar hardware{so of course they choose similar ranges to search. But where does this conjecture come from? In this chapter we will discuss a general method to form conjectures similar to the twin prime conjecture above. We will then apply it to a number of different forms of primes such as Sophie Germain primes, primes in arithmetic progressions, primorial primes and even the Goldbach conjecture.
  • New Formulas for Semi-Primes. Testing, Counting and Identification

    New Formulas for Semi-Primes. Testing, Counting and Identification

    New Formulas for Semi-Primes. Testing, Counting and Identification of the nth and next Semi-Primes Issam Kaddouraa, Samih Abdul-Nabib, Khadija Al-Akhrassa aDepartment of Mathematics, school of arts and sciences bDepartment of computers and communications engineering, Lebanese International University, Beirut, Lebanon Abstract In this paper we give a new semiprimality test and we construct a new formula for π(2)(N), the function that counts the number of semiprimes not exceeding a given number N. We also present new formulas to identify the nth semiprime and the next semiprime to a given number. The new formulas are based on the knowledge of the primes less than or equal to the cube roots 3 of N : P , P ....P 3 √N. 1 2 π( √N) ≤ Keywords: prime, semiprime, nth semiprime, next semiprime 1. Introduction Securing data remains a concern for every individual and every organiza- tion on the globe. In telecommunication, cryptography is one of the studies that permits the secure transfer of information [1] over the Internet. Prime numbers have special properties that make them of fundamental importance in cryptography. The core of the Internet security is based on protocols, such arXiv:1608.05405v1 [math.NT] 17 Aug 2016 as SSL and TSL [2] released in 1994 and persist as the basis for securing dif- ferent aspects of today’s Internet [3]. The Rivest-Shamir-Adleman encryption method [4], released in 1978, uses asymmetric keys for exchanging data. A secret key Sk and a public key Pk are generated by the recipient with the following property: A message enciphered Email addresses: [email protected] (Issam Kaddoura), [email protected] (Samih Abdul-Nabi) 1 by Pk can only be deciphered by Sk and vice versa.
  • Cullen Numbers with the Lehmer Property

    Cullen Numbers with the Lehmer Property

    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000–000 S 0002-9939(XX)0000-0 CULLEN NUMBERS WITH THE LEHMER PROPERTY JOSE´ MAR´IA GRAU RIBAS AND FLORIAN LUCA Abstract. Here, we show that there is no positive integer n such that n the nth Cullen number Cn = n2 + 1 has the property that it is com- posite but φ(Cn) | Cn − 1. 1. Introduction n A Cullen number is a number of the form Cn = n2 + 1 for some n ≥ 1. They attracted attention of researchers since it seems that it is hard to find primes of this form. Indeed, Hooley [8] showed that for most n the number Cn is composite. For more about testing Cn for primality, see [3] and [6]. For an integer a > 1, a pseudoprime to base a is a compositive positive integer m such that am ≡ a (mod m). Pseudoprime Cullen numbers have also been studied. For example, in [12] it is shown that for most n, Cn is not a base a-pseudoprime. Some computer searchers up to several millions did not turn up any pseudo-prime Cn to any base. Thus, it would seem that Cullen numbers which are pseudoprimes are very scarce. A Carmichael number is a positive integer m which is a base a pseudoprime for any a. A composite integer m is called a Lehmer number if φ(m) | m − 1, where φ(m) is the Euler function of m. Lehmer numbers are Carmichael numbers; hence, pseudoprimes in every base. No Lehmer number is known, although it is known that there are no Lehmer numbers in certain sequences, such as the Fibonacci sequence (see [9]), or the sequence of repunits in base g for any g ∈ [2, 1000] (see [4]).
  • Some New Results on Odd Perfect Numbers

    Some New Results on Odd Perfect Numbers

    Pacific Journal of Mathematics SOME NEW RESULTS ON ODD PERFECT NUMBERS G. G. DANDAPAT,JOHN L. HUNSUCKER AND CARL POMERANCE Vol. 57, No. 2 February 1975 PACIFIC JOURNAL OF MATHEMATICS Vol. 57, No. 2, 1975 SOME NEW RESULTS ON ODD PERFECT NUMBERS G. G. DANDAPAT, J. L. HUNSUCKER AND CARL POMERANCE If ra is a multiply perfect number (σ(m) = tm for some integer ί), we ask if there is a prime p with m = pan, (pa, n) = 1, σ(n) = pα, and σ(pa) = tn. We prove that the only multiply perfect numbers with this property are the even perfect numbers and 672. Hence we settle a problem raised by Suryanarayana who asked if odd perfect numbers neces- sarily had such a prime factor. The methods of the proof allow us also to say something about odd solutions to the equation σ(σ(n)) ~ 2n. 1* Introduction* In this paper we answer a question on odd perfect numbers posed by Suryanarayana [17]. It is known that if m is an odd perfect number, then m = pak2 where p is a prime, p Jf k, and p = a z= 1 (mod 4). Suryanarayana asked if it necessarily followed that (1) σ(k2) = pa , σ(pa) = 2k2 . Here, σ is the sum of the divisors function. We answer this question in the negative by showing that no odd perfect number satisfies (1). We actually consider a more general question. If m is multiply perfect (σ(m) = tm for some integer t), we say m has property S if there is a prime p with m = pan, (pa, n) = 1, and the equations (2) σ(n) = pa , σ(pa) = tn hold.
  • On Types of Elliptic Pseudoprimes

    On Types of Elliptic Pseudoprimes

    journal of Groups, Complexity, Cryptology Volume 13, Issue 1, 2021, pp. 1:1–1:33 Submitted Jan. 07, 2019 https://gcc.episciences.org/ Published Feb. 09, 2021 ON TYPES OF ELLIPTIC PSEUDOPRIMES LILJANA BABINKOSTOVA, A. HERNANDEZ-ESPIET,´ AND H. Y. KIM Boise State University e-mail address: [email protected] Rutgers University e-mail address: [email protected] University of Wisconsin-Madison e-mail address: [email protected] Abstract. We generalize Silverman's [31] notions of elliptic pseudoprimes and elliptic Carmichael numbers to analogues of Euler-Jacobi and strong pseudoprimes. We inspect the relationships among Euler elliptic Carmichael numbers, strong elliptic Carmichael numbers, products of anomalous primes and elliptic Korselt numbers of Type I, the former two of which we introduce and the latter two of which were introduced by Mazur [21] and Silverman [31] respectively. In particular, we expand upon the work of Babinkostova et al. [3] on the density of certain elliptic Korselt numbers of Type I which are products of anomalous primes, proving a conjecture stated in [3]. 1. Introduction The problem of efficiently distinguishing the prime numbers from the composite numbers has been a fundamental problem for a long time. One of the first primality tests in modern number theory came from Fermat Little Theorem: if p is a prime number and a is an integer not divisible by p, then ap−1 ≡ 1 (mod p). The original notion of a pseudoprime (sometimes called a Fermat pseudoprime) involves counterexamples to the converse of this theorem. A pseudoprime to the base a is a composite number N such aN−1 ≡ 1 mod N.
  • On Repdigits As Sums of Fibonacci and Tribonacci Numbers

    On Repdigits As Sums of Fibonacci and Tribonacci Numbers

    S S symmetry Article On Repdigits as Sums of Fibonacci and Tribonacci Numbers Pavel Trojovský Department of Mathematics, Faculty of Science, University of Hradec Králové, 500 03 Hradec Králové, Czech Republic; [email protected]; Tel.: +42-049-333-2860 Received: 17 September 2020; Accepted: 21 October 2020; Published: 26 October 2020 Abstract: In this paper, we use Baker’s theory for nonzero linear forms in logarithms of algebraic numbers and a Baker-Davenport reduction procedure to find all repdigits (i.e., numbers with only one distinct digit in its decimal expansion, thus they can be seen as the easiest case of palindromic numbers, which are a “symmetrical” type of numbers) that can be written in the form Fn + Tn, for some n ≥ 1, where (Fn)n≥0 and (Tn)n≥0 are the sequences of Fibonacci and Tribonacci numbers, respectively. Keywords: Diophantine equations; repdigits; Fibonacci; Tribonacci; Baker’s theory MSC: 11B39; 11J86 1. Introduction A palindromic number is a number that has the same form when written forwards or backwards, i.e., of the form c1c2c3 ... c3c2c1 (thus it can be said that they are “symmetrical” with respect to an axis of symmetry). The first 19th palindromic numbers are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33, 44, 55, 66, 77, 88, 99 and clearly they are a repdigits type. A number n is called repdigit if it has only one repeated digit in its decimal expansion. More precisely, n has the form ! 10` − 1 n = a , 9 for some ` ≥ 1 and a 2 [1, 9] (as usual, we set [a, b] = fa, a + 1, ..
  • On Distribution of Semiprime Numbers

    On Distribution of Semiprime Numbers

    ISSN 1066-369X, Russian Mathematics (Iz. VUZ), 2014, Vol. 58, No. 8, pp. 43–48. c Allerton Press, Inc., 2014. Original Russian Text c Sh.T. Ishmukhametov, F.F. Sharifullina, 2014, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2014, No. 8, pp. 53–59. On Distribution of Semiprime Numbers Sh. T. Ishmukhametov* and F. F. Sharifullina** Kazan (Volga Region) Federal University, ul. Kremlyovskaya 18, Kazan, 420008 Russia Received January 31, 2013 Abstract—A semiprime is a natural number which is the product of two (possibly equal) prime numbers. Let y be a natural number and g(y) be the probability for a number y to be semiprime. In this paper we derive an asymptotic formula to count g(y) for large y and evaluate its correctness for different y. We also introduce strongly semiprimes, i.e., numbers each of which is a product of two primes of large dimension, and investigate distribution of strongly semiprimes. DOI: 10.3103/S1066369X14080052 Keywords: semiprime integer, strongly semiprime, distribution of semiprimes, factorization of integers, the RSA ciphering method. By smoothness of a natural number n we mean possibility of its representation as a product of a large number of prime factors. A B-smooth number is a number all prime divisors of which are bounded from above by B. The concept of smoothness plays an important role in number theory and cryptography. Possibility of using the concept in cryptography is based on the fact that the procedure of decom- position of an integer into prime divisors (factorization) is a laborious computational process requiring significant calculating resources [1, 2].
  • Cracking RSA with Various Factoring Algorithms Brian Holt

    Cracking RSA with Various Factoring Algorithms Brian Holt

    Cracking RSA with Various Factoring Algorithms Brian Holt 1 Abstract For centuries, factoring products of large prime numbers has been recognized as a computationally difficult task by mathematicians. The modern encryption scheme RSA (short for Rivest, Shamir, and Adleman) uses products of large primes for secure communication protocols. In this paper, we analyze and compare four factorization algorithms which use elementary number theory to assess the safety of various RSA moduli. 2 Introduction The origins of prime factorization can be traced back to around 300 B.C. when Euclid's theorem and the unique factorization theorem were proved in his work El- ements [3]. For nearly two millenia, the simple trial division algorithm was used to factor numbers into primes. More efficient means were studied by mathemeticians during the seventeenth and eighteenth centuries. In the 1640s, Pierre de Fermat devised what is known as Fermat's factorization method. Over one century later, Leonhard Euler improved upon Fermat's factorization method for numbers that take specific forms. Around this time, Adrien-Marie Legendre and Carl Gauss also con- tributed crucial ideas used in modern factorization schemes [3]. Prime factorization's potential for secure communication was not recognized until the twentieth century. However, economist William Jevons antipicated the "one-way" or ”difficult-to-reverse" property of products of large primes in 1874. This crucial con- cept is the basis of modern public key cryptography. Decrypting information without access to the private key must be computationally complex to prevent malicious at- tacks. In his book The Principles of Science: A Treatise on Logic and Scientific Method, Jevons challenged the reader to factor a ten digit semiprime (now called Jevon's Number)[4].
  • Which Polynomials Represent Infinitely Many Primes?

    Which Polynomials Represent Infinitely Many Primes?

    Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 14, Number 1 (2018), pp. 161-180 © Research India Publications http://www.ripublication.com/gjpam.htm Which polynomials represent infinitely many primes? Feng Sui Liu Department of Mathematics, NanChang University, NanChang, China. Abstract In this paper a new arithmetical model has been found by extending both basic operations + and × into finite sets of natural numbers. In this model we invent a recursive algorithm on sets of natural numbers to reformulate Eratosthene’s sieve. By this algorithm we obtain a recursive sequence of sets, which converges to the set of all natural numbers x such that x2 + 1 is prime. The corresponding cardinal sequence is strictly increasing. Test that the cardinal function is continuous with respect to an order topology, we immediately prove that there are infinitely many natural numbers x such that x2 + 1 is prime. Based on the reasoning paradigm above we further prove a general result: if an integer valued polynomial of degree k represents at least k +1 positive primes, then this polynomial represents infinitely many primes. AMS subject classification: Primary 11N32; Secondary 11N35, 11U09,11Y16, 11B37. Keywords: primes in polynomial, twin primes, arithmetical model, recursive sieve method, limit of sequence of sets, Ross-Littwood paradox, parity problem. 1. Introduction Whether an integer valued polynomial represents infinitely many primes or not, this is an intriguing question. Except some obvious exceptions one conjectured that the answer is yes. Example 1.1. Bouniakowsky [2], Schinzel [35], Bateman and Horn [1]. In this paper a recursive algorithm or sieve method adds some exotic structures to the sets of natural numbers, which allow us to answer the question: which polynomials represent infinitely many primes? 2 Feng Sui Liu In 1837, G.L.
  • Variations on Euclid's Formula for Perfect Numbers

    Variations on Euclid's Formula for Perfect Numbers

    1 2 Journal of Integer Sequences, Vol. 13 (2010), 3 Article 10.3.1 47 6 23 11 Variations on Euclid’s Formula for Perfect Numbers Farideh Firoozbakht Faculty of Mathematics & Computer Science University of Isfahan Khansar Iran [email protected] Maximilian F. Hasler Laboratoire CEREGMIA Univ. Antilles-Guyane Schoelcher Martinique [email protected] Abstract We study several families of solutions to equations of the form σ(n)= An + B(n), where B is a function that may depend on properties of n. 1 Introduction We recall that perfect numbers (sequence A000396 of Sloane’s Encyclopedia [8]) are defined as solutions to the equation σ(x) = 2 x, where σ(x) denotes the sum of all positive divisors of x, including 1 and x itself. Euclid showed around 300 BCE [2, Proposition IX.36] that q−1 q all numbers of the form x = 2 Mq, where Mq = 2 1 is prime (A000668), are perfect numbers. − While it is still not known whether there exist any odd perfect numbers, Euler [3] proved a converse of Euclid’s proposition, showing that there are no other even perfect numbers (cf. A000043, A006516). (As a side note, this can also be stated by saying that the even perfect 1 numbers are exactly the triangular numbers (A000217(n) = n(n + 1)/2) whose indices are Mersenne primes A000668.) One possible generalization of perfect numbers is the multiply or k–fold perfect numbers (A007691, A007539) such that σ(x) = k x [1, 7, 9, 10]. Here we consider some modified equations, where a second term is added on the right hand side.
  • Problems Archives

    Problems Archives

    Cache update: 56 minutes Problems Archives The problems archives table shows problems 1 to 651. If you would like to tackle the 10 most recently published problems then go to Recent problems. Click the description/title of the problem to view details and submit your answer. ID Description / Title Solved By 1 Multiples of 3 and 5 834047 2 Even Fibonacci numbers 666765 3 Largest prime factor 476263 4 Largest palindrome product 422115 5 Smallest multiple 428955 6 Sum square difference 431629 7 10001st prime 368958 8 Largest product in a series 309633 9 Special Pythagorean triplet 313806 10 Summation of primes 287277 11 Largest product in a grid 207029 12 Highly divisible triangular number 194069 13 Large sum 199504 14 Longest Collatz sequence 199344 15 Lattice paths 164576 16 Power digit sum 201444 17 Number letter counts 133434 18 Maximum path sum I 127951 19 Counting Sundays 119066 20 Factorial digit sum 175533 21 Amicable numbers 128681 22 Names scores 118542 23 Non-abundant sums 91300 24 Lexicographic permutations 101261 25 1000-digit Fibonacci number 137312 26 Reciprocal cycles 73631 27 Quadratic primes 76722 28 Number spiral diagonals 96208 29 Distinct powers 92388 30 Digit fifth powers 96765 31 Coin sums 74310 32 Pandigital products 62296 33 Digit cancelling fractions 62955 34 Digit factorials 82985 35 Circular primes 74645 36 Double-base palindromes 78643 37 Truncatable primes 64627 38 Pandigital multiples 55119 39 Integer right triangles 64132 40 Champernowne's constant 70528 41 Pandigital prime 59723 42 Coded triangle numbers 65704 43 Sub-string divisibility 52160 44 Pentagon numbers 50757 45 Triangular, pentagonal, and hexagonal 62652 46 Goldbach's other conjecture 53607 47 Distinct primes factors 50539 48 Self powers 100136 49 Prime permutations 50577 50 Consecutive prime sum 54478 Cache update: 56 minutes Problems Archives The problems archives table shows problems 1 to 651.
  • Introducing Quaternions to Integer Factorisation

    Introducing Quaternions to Integer Factorisation

    Journal of Physical Science and Application 5 (2) (2015) 101-107 doi: 10.17265/2159-5348/2015.02.003 D DAVID PUBLISHING Introducing Quaternions to Integer Factorisation HuiKang Tong 4500 Ang Mo Kio Avenue 6, 569843, Singapore Abstract: The key purpose of this paper is to open up the concepts of the sum of four squares and the algebra of quaternions into the attempts of factoring semiprimes, the product of two prime numbers. However, the application of these concepts here has been clumsy, and would be better explored by those with a more rigorous mathematical background. There may be real immediate implications on some RSA numbers that are slightly larger than a perfect square. Key words: Integer factorisation, RSA, quaternions, sum of four squares, euler factorisation method. Nomenclature In Section 3, we extend the Euler factoring method to one using the sum of four squares and the algebra p, q: prime factors n: semiprime pq, the product of two primes of quaternions. We comment on the development of P: quaternion with norm p the mathematics in Section 3.1, and introduce the a, b, c, d: components of a quaternion integral quaternions in Section 3.2, and its relationship 1. Introduction with the sum of four squares in Section 3.3. In Section 3.4, we mention an algorithm to generate the sum of We assume that the reader know the RSA four squares. cryptosystem [1]. Notably, the ability to factorise a In Section 4, we propose the usage of concepts of random and large semiprime n (the product of two the algebra of quaternions into the factorisation of prime numbers p and q) efficiently can completely semiprimes.