Search

Let ω ( n ) denote the number of distinct prime factors of n and let τ k ( n ) denote the k-fold divisor function. Adapting a method of Granville and Soundararajan, we evaluate the centralized moments of ω ( n ) , weighted by τ k ( n ) , and deduce a weighted version of the Erdős-Kac Theorem.

In this paper, we study the Cartesian product of signed graphs as defined by Germina, Hameed and Zaslavsky (2011). Here we focus on its algebraic properties and look at the chromatic number of some Cartesian products. One of our main results is the unicity of the prime factor decomposition of signed graphs. This leads us to present an algorithm to compute this decomposition in linear time based on a decomposition algorithm for oriented graphs by Imrich and Peterin (2018). We also study the chromatic number of a signed graph, that is the minimum order of a signed graph to which the input signed graph admits a homomorphism, of graphs with underlying graph of the form P n □ P m , of Cartesian products of signed paths, of Cartesian products of signed complete graphs and of Cartesian products of signed cycles.

We study the normal number of prime factors of a f ( p ) + a g ( p ) with p prime and f , g distinct Hecke eigenforms of weight two. Assuming a quasi-generalized Riemann hypothesis, we show that the normal order is log log p . We also obtain an estimate for the number of primes p for which a f ( p ) + a g ( p ) = 0 .

Let p be a rational prime and q a power of p. Let n be a non-constant monic polynomial in F q [ t ] which has a prime factor of degree prime to q − 1 . In this paper, we define a Drinfeld modular curve Y 1 Δ ( n ) over A [ 1 / n ] and study the structure around cusps of its compactification X 1 Δ ( n ) , in a parallel way to Katz-Mazur's work on classical modular curves. Using them, we also define a Hodge bundle over X 1 Δ ( n ) such that Drinfeld modular forms of level Γ 1 ( n ) , weight k and some type are identified with global sections of its k-th tensor power.

Semi-prime factorization is an increasingly important number theoretic problem, since it is computationally intractable. Further, this property has been applied in public-key cryptography, such as the Rivest–Shamir–Adleman (RSA) encryption systems for secure digital communications. Hence, alternate approaches to solve the semi-prime factorization problem are proposed. Recently, Pythagorean tuples to factor semi-primes have been explored to consider Fermat’s Christmas theorem, with the two squares having opposite parity. This paper is motivated by the property that the integer separating these two squares being odd reduces the search for semi-prime factorization by half. In this paper, we prove that if a Pythagorean quadruple is known and one of its squares represents a Pythagorean triple, then the semi-prime is factorized. The problem of semi-prime factorization is reduced to the problem of finding only one such sum of three squares to factorize a semi-prime. We modify the Lebesgue identity as the sum of four squares to obtain four sums of three squares. These are then expressed as four Pythagorean quadruples. The Brahmagupta–Fibonacci identity reduces these four Pythagorean quadruples to two Pythagorean triples. The greatest common divisors of the sides contained therein are the factors of the semi-prime. We then prove that to factor a semi-prime, it is sufficient that only one of these Pythagorean quadruples be known. We provide the algorithm of our proposed semi-prime factorization method, highlighting its complexity and comparative advantage of the solution space with Fermat’s method. Our algorithm has the advantage when the factors of a semi-prime are congruent to 1 modulus 4. Illustrations of our method for real-world applications, such as factorization of the 768-bit number RSA-768, are established. Further, the computational viabilities, despite the mathematical constraints and the unexplored properties, are suggested as opportunities for future research.

Let N be a sufficiently large real number. In this paper, it is proved that, for $$1

In this paper, we give a new framework for constructing perfect sequences, called generalized Milewski sequences, over various alphabets including Polyphase (PSK) as well as Amplitude-and-Polyphase (APSK) in general, and for constructing optimal sets of such perfect sequences by using combinatorial designs, called circular Florentine arrays. Specifically, we prove that, given any positive integer $m\geq 1$ , (i) there exists a perfect sequence of period $mN^{2}$ for any positive integer $N$ if there exists a perfect sequence (polyphase or not) of length $m$ ; (ii) an optimal $k$ -set of perfect sequences of length $mN^{2}$ can be constructed if there exist both a $k \times N$ circular Florentine array and an optimal $k$ -set of perfect sequences all of length $m$ . This enables us to find some optimal $k$ -set of perfect sequences where $k > p_{\text {min}}-1$ , where $p_{\text {min}}$ is the smallest prime factor of $mN^{2}$ .

Let [Formula: see text] be a fixed positive number. Define [Formula: see text] as the number of positive integers [Formula: see text] having no prime factors [Formula: see text], and define [Formula: see text] as the number of positive integers [Formula: see text] having [Formula: see text] prime factors [Formula: see text], with all the other prime factors [Formula: see text]. In this paper, we give an asymptotic estimate for the ratio [Formula: see text], provided that [Formula: see text], [Formula: see text], and [Formula: see text] as [Formula: see text]. Also, combining this estimate with conventional ones for [Formula: see text], we provide sharp estimates for [Formula: see text].

A natural variant of Lehmer’s conjecture that the Ramanujan $$\tau $$ -function never vanishes asks whether, for any given integer $$\alpha $$ , there exist any $$n \in \mathbb {Z}^+$$ such that $$\tau (n) = \alpha $$ . A series of recent papers excludes many integers as possible values of the $$\tau $$ -function using the theory of primitive divisors of Lucas numbers, computations of integer points on curves, and congruences for $$\tau (n)$$ . We synthesize these results and methods to prove that if $$0< \left| \alpha \right| < 100$$ and $$\alpha \notin T := \{2^k, -24,-48, -70,-90, 92, -96\}$$ , then $$\tau (n) \ne \alpha $$ for all $$n > 1$$ . Moreover, if $$\alpha \in T$$ and $$\tau (n) = \alpha $$ , then n is square-free with prescribed prime factorization. Finally, we show that a strong form of the Atkin-Serre conjecture implies that $$\left| \tau (n) \right| > 100$$ for all $$n > 2$$ .

The purpose of this study was to describe students' communication in solving prime factors using written and oral communication. This study uses a qualitative and descriptive approach. The subjects of this study were 46 seventh grade students of Simanjaya Lamongan, East Java, Indonesia, Middle School who had obtained prime factor material. Data analysis was obtained by using a test of prime factors and interviews. Based on the results of data analysis, it was concluded that: 1) Written communication, as many as 40 students were able to communicate in writing with a percentage of 87% and 6 students were unable to communicate in writing with a percentage of 13%; 2) Oral communication, at this stage interviews were conducted by taking the subject as many as two students taken from one student who is able to communicate in writing and one student who is not able to communicate in writing, the results obtained that students are able to communicate in writing are also able to communicate verbally. verbally, while students who are not able to communicate in writing, it turns out that students are able to communicate orally. From the explanation above, it can be concluded that students are able to explain concepts into mathematical language, students are able to explain mathematical arithmetic operations, students are able to explain mathematical solutions and students are able to convey ideas or opinions. Thus, students can communicate in writing and orally well in solving prime factors.

Our initial problem is to represent classes $$m$$ modulo $$q$$ by a sum of three terms, two being taken from rather small sets $$\mathcal A$$ and $$\mathcal B$$ and the third one having an odd number of prime factors (the so-called irregular numbers in S. Ramanujan’s terminology) and lying in an interval $$[q^{20r},q^{20r}+q^{16r}]$$ for some given $$r\ge1$$ . We show that it is always possible to do so provided that $$|\mathcal A|\cdot|\mathcal B|\ge q(\log q)^2$$ . The proof leads us to study the trigonometric polynomials over irregular numbers in a short interval and to seek very sharp bounds for them. We prove in particular that $$\sum_{q^{20r}\le s \le q^{20r}+q^{16r}}e(sa/q)\ll q^{16r}(\log q)/\sqrt{\varphi(q)}$$ uniformly in $$r$$ , where $$s$$ ranges over the irregular numbers. We develop a technique initiated by Selberg and Motohashi to do so. In short, we express the characteristic function of the irregular numbers via a family of bilinear decompositions akin to Iwaniec’s amplification process, and that uses pseudo-characters or local models. The technique applies to the Liouville function, to the Mobius function and also to the von Mangoldt function, in which case it is slightly more difficult. It is however simple enough to warrant explicit estimates, and we prove, for instance, that $$\bigl|\sum_{X

We introduceadmissible collectionsfor a finite group 𝐺 and use them to prove that most of the finite classical groups in non-defining characteristic satisfy theQuillen dimension at 𝑝 property, a strong version of Quillen’s conjecture, at a given odd prime divisor 𝑝 of|G|\lvert G\rvert. Compared to the methods in [M. Aschbacher and S. D. Smith, On Quillen’s conjecture for the 𝑝-groups complex,Ann. of Math. (2)137(1993), 3, 473–529], our techniques are simpler.

Let X be a smooth, complex Fano 4-fold, and rho(X) its Picard number. If X contains a prime divisor D with rho(X)-rho(D)>2, then either X is a product of del Pezzo surfaces, or rho(X)=5 or 6. In this setting, we completely classify the case where rho(X)=5; there are 6 families, among which one is new. We also deduce the classification of Fano 4-folds with rho(X)>4 with an elementary divisorial contraction sending a divisor to a curve., 16 pages

International audience; We establish new Bombieri-Vinogradov type estimates for a wide class of multiplicative arithmetic functions and derive several applications, including: a new proof of a recent estimate by Drappeau and Topacogullari for arithmetical correlations; a theorem of Erdős-Wintner type with support equal to the level set of an additive function at shifted argument; and a law of iterated logarithm for the distribution of prime factors of integers weighted by τ (n − 1) where τ denotes the divisor function.

A famous conjecture of Hardy and Littlewood claims the subadditivity of the prime counting function, namely that ?(x+y) ? ?(x)+?(y) holds for all integers x, y ? 2, where ?(x) is the number of primes not exceeding x. It is widely believed nowadays that this conjecture is not true since Hensley and Richards stunningly discovered an incompatibility with the prime k-tuples conjecture. Despite this drawback, here we generalize the subadditivity conjecture to subsets of prime numbers possessing a rich collection of preassigned structures. We show that subadditivity holds in this extended manner over certain ranges of the parameters which are wide enough to imply that it holds in an almost all sense. Under the prime k-tuples conjecture, very large values of convex combinations of the prime counting function are obtained infinitely often, thereby indicating a strong deviation of ?(x) from being convex, even in a localized form. Finally, a Tauberian type condition is given for subsets of prime numbers which in turn implies an extension of a classical phenomenon, originally suggested by Legendre, about the asymptotically best fit functions to ?(x) of the shape x/(log x ? A)., NA

We obtain a common generalization of the results by Wong and Birkenmeier-Kim-Park, respectively, which say that a reduced ring with unity is strongly (respectively, weakly) regular if and only if all of its prime homomorphic images are division rings (respectively, simple domains). Our arguments are different from those in the known proofs and are quite simple. They also give a characterization of weakly regular reduced rings without unity. This characterization implies in particular that the class of weakly regular reduced rings forms a radical class. However, even if a weakly regular reduced ring has no unity, its prime homomorphic images must be simple domains with unity. In the second part of the paper, we study reduced rings whose prime homomorphic images are simple domains (not necessarily with unity).

In mathematics, the Riemann Hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part $\frac{1}{2}$. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution. In 1915, Ramanujan proved that under the assumption of the Riemann Hypothesis, the inequality $\sigma(n) < e^{\gamma } \times n \times \log \log n$ holds for all sufficiently large $n$, where $\sigma(n)$ is the sum-of-divisors function and $\gamma \approx 0.57721$ is the Euler-Mascheroni constant. In 1984, Guy Robin proved that the inequality is true for all $n > 5040$ if and only if the Riemann Hypothesis is true. Let $n > 5040$ be $n = r \times q$, where $q$ denotes the largest prime factor of $n$. If $n > 5040$ is the smallest number such that Robin inequality does not hold, then we show the following inequality is also satisfied: $\sqrt[q]{e} + \frac{\log \log r}{\log \log n} > 2$.

We revisit the problem of integer factorization with number-theoretic oracles, including a well-known problem: can we factor an integer $N$ unconditionally, in deterministic polynomial time, given the value of the Euler totient $ϕ(N)$? We show that this can be done, under certain size conditions on the prime factors of N. The key technique is lattice basis reduction using the LLL algorithm. Among our results, we show for example that if $N$ is a squarefree integer with a prime factor $p > √ N$ , then we can recover p in deterministic polynomial time given $ϕ(N)$. We also shed some light on the analogous problems for Carmichael's function, and the order oracle that is used in Shor's quantum factoring algorithm.

In this research, the authors consider and evaluate a method to find a prime number that satisfies the condition to construct type(h, m) Gauss period Normal Basis. More precisely, we use methods for prime factorization, elliptic curve method, to determine the suitability of a prime number for the construction. In addition, we consider the condition of parameters that easy to find such a prime.

Quantum computers are capable of very fast computation as compared to the classical counterpart. Problems impossible for the classical computer are efficiently solved on a quantum computer. Shor's factoring algorithm (SFA) calculates the prime factors of a given number exponentially quicker than the available classical algorithm. The paper deals with a vivid explanation of the methodology and various other future possibilities related to the development of the SFA. The paper also emphasizes the three-qubit realization of the quantum Fourier transform on the IBM Q experience.

Non-convex quadratically constrained problems frequently appear in chemical engineering when optimizing process networks. Some of these problems can be solved to global optimality by deterministic solvers like BARON and ANTIGONE that mostly use linear programming relaxations coupled with spatial branch and bound. An alternative is to rely on piecewise relaxations, which work by simultaneously partitioning the domain of one variable in every bilinear term and can be significantly tighter, even when setting the number of intervals in the partitions, N , to a small value. In this short note, we generalize the mixed-integer linear programming relaxation formulation from the multiparametric disaggregation technique, to benefit from a logarithmic partitioning scheme in a wide variety of settings. The idea is to select the optimal interval in the partition of a variable by using a mixed-radix numeral system, following the prime factorization of N .

The tiling number problem is closely related to the arithmetic of elliptic curves. In this paper, we construct a family of tiling numbers with multiple prime factors by using Birch lemma and the induction method developed by one of the authors(Ye Tian) to prove the non-torsioness of Heegner points. In addition, we prove the $2$-part BSD conjecture of the related elliptic curves. We deal with the quadratic twist family of elliptic curves without complex multiplication and the distribution of $2$-Selmer groups of this family is not predicted by the general conjecture or the known results.