Divisibility of integers obtained from truncated periodic sequences

2021 ◽  
pp. 1-10
Author(s):  
Artūras Dubickas ◽  
Lukas Jonuška
Keyword(s):  
Prime Number ◽  
Prime Numbers ◽  
Arithmetic Progressions ◽  
Periodic Sequences ◽  
Finite Set ◽  
Number Formula

A finite set of prime numbers [Formula: see text] is called unavoidable with respect to [Formula: see text] if for each [Formula: see text] the sequence of integer parts [Formula: see text], [Formula: see text] contains infinitely many elements divisible by at least one prime number [Formula: see text] from the set [Formula: see text]. It is known that an unavoidable set exists with respect to [Formula: see text] and that it does not exist if [Formula: see text] is an integer such that [Formula: see text] is not square free. In this paper, we show that no finite unavoidable sets exist with respect to [Formula: see text] if [Formula: see text] is a prime number or [Formula: see text] belongs to some explicitly given arithmetic progressions, for instance, [Formula: see text] and [Formula: see text], [Formula: see text]

About finding of prime numbers that follows after given prime number without using computer

2020 ◽  
pp. 81-85
Author(s):  
V. S. Malakhovsky
Keyword(s):  
Prime Number ◽  
Prime Numbers ◽  
Arithmetic Progressions

It is shown how to define one or several prime numbers following af­ter given prime number without using computer only by calculating sev­eral arithmetic progressions. Five examples of finding such prime num­bers are given.

On tamely ramified pro-p-extensions over -extensions of

2013 ◽  
Vol 156 (2) ◽  
pp. 281-294
Author(s):  
TSUYOSHI ITOH ◽  
YASUSHI MIZUSAWA
Keyword(s):  
Galois Group ◽  
Prime Number ◽  
Number Field ◽  
Rational Number ◽  
Prime Numbers ◽  
Finite Set

AbstractFor an odd prime number p and a finite set S of prime numbers congruent to 1 modulo p, we consider the Galois group of the maximal pro-p-extension unramified outside S over the ${\mathbb Z}_p$-extension of the rational number field. In this paper, we classify all S such that the Galois group is a metacyclic pro-p group.

scholarly journals On Greenberg’s generalized conjecture for imaginary quartic fields

2020 ◽  
pp. 1-11
Author(s):  
Naoya Takahashi
Keyword(s):  
Galois Group ◽  
Prime Number ◽  
Number Field ◽  
Group Ring ◽  
Algebraic Number ◽  
Algebraic Number Field ◽  
Prime Numbers ◽  
Quadratic Fields ◽  
Imaginary Quadratic Fields ◽  
Number Formula

For an algebraic number field [Formula: see text] and a prime number [Formula: see text], let [Formula: see text] be the maximal multiple [Formula: see text]-extension. Greenberg’s generalized conjecture (GGC) predicts that the Galois group of the maximal unramified abelian pro-[Formula: see text] extension of [Formula: see text] is pseudo-null over the completed group ring [Formula: see text]. We show that GGC holds for some imaginary quartic fields containing imaginary quadratic fields and some prime numbers.

IRRATIONALITY OF LAMBERT SERIES ASSOCIATED WITH A PERIODIC SEQUENCE

2014 ◽  
Vol 10 (03) ◽  
pp. 623-636 ◽  
Author(s):  
FLORIAN LUCA ◽  
YOHEI TACHIYA
Keyword(s):  
Rational Numbers ◽  
Periodic Sequence ◽  
Arithmetic Progressions ◽  
Lambert Series ◽  
Periodic Sequences ◽  
Linearly Independent ◽  
Primes In Arithmetic Progressions ◽  
Number Formula

Let q be an integer with |q| > 1 and {an}n≥1 be an eventually periodic sequence of rational numbers, not identically zero from some point on. Then the number [Formula: see text] is irrational. In particular, if the periodic sequences [Formula: see text] of rational numbers are linearly independent over ℚ, then so are the following m + 1 numbers: [Formula: see text] This generalizes a result of Erdős who treated the case of m = 1 and [Formula: see text]. The method of proof is based on the original approaches of Chowla and Erdős, together with some results about primes in arithmetic progressions with large moduli of Ahlford, Granville and Pomerance.

scholarly journals Exact reconstruction of extended exponential sums using rational approximation of their Fourier coefficients

2021 ◽  
pp. 1-35
Author(s):  
Nadiia Derevianko ◽  
Gerlind Plonka
Keyword(s):  
Rational Approximation ◽  
Fourier Coefficients ◽  
Exponential Sums ◽  
Finite Interval ◽  
Large Set ◽  
Recovery Method ◽  
Exact Reconstruction ◽  
Finite Set ◽  
Number Formula ◽  
Numerical Approaches

In this paper, we derive a new recovery procedure for the reconstruction of extended exponential sums of the form [Formula: see text], where the frequency parameters [Formula: see text] are pairwise distinct. In order to reconstruct [Formula: see text] we employ a finite set of classical Fourier coefficients of [Formula: see text] with regard to a finite interval [Formula: see text] with [Formula: see text]. For our method, [Formula: see text] Fourier coefficients [Formula: see text] are sufficient to recover all parameters of [Formula: see text], where [Formula: see text] denotes the order of [Formula: see text]. The recovery is based on the observation that for [Formula: see text] the terms of [Formula: see text] possess Fourier coefficients with rational structure. We employ a recently proposed stable iterative rational approximation algorithm in [Y. Nakatsukasa, O. Sète and L. N. Trefethen, The AAA Algorithm for rational approximation, SIAM J. Sci. Comput. 40(3) (2018) A1494A1522]. If a sufficiently large set of [Formula: see text] Fourier coefficients of [Formula: see text] is available (i.e. [Formula: see text]), then our recovery method automatically detects the number [Formula: see text] of terms of [Formula: see text], the multiplicities [Formula: see text] for [Formula: see text], as well as all parameters [Formula: see text], [Formula: see text], and [Formula: see text], [Formula: see text], [Formula: see text], determining [Formula: see text]. Therefore, our method provides a new stable alternative to the known numerical approaches for the recovery of exponential sums that are based on Prony’s method.

scholarly journals The continuity of prime numbers can lead to even continuity(The ultimate)

2021 ◽  
Author(s):  
Xie Ling
Keyword(s):  
Prime Number ◽  
Prime Numbers ◽  
Original Group

Abstract n continuous prime numbers can combine a group of continuous even numbers. If an adjacent prime number is followed, the even number will continue. For example, if we take prime number 3, we can get even number 6. If we follow an adjacent prime number 5, we can get even numbers by using 3 and 5: 6, 8 and 10. If a group of continuous prime numbers 3,5,7,11,... P, we can get a group of continuous even numbers 6,8,10,12,..., 2n. Then if an adjacent prime number q is followed, the original group of even numbers 6,8,10,12,..., 2n will be finitely extended to 2 (n + 1) or more adjacent even numbers. My purpose is to prove that the continuity of prime numbers will lead to even continuity as long as 2 (n + 1) can be extended. If the continuity of even numbers is discontinuous, it violates the Bertrand Chebyshev theorem of prime numbers. Because there are infinitely many prime numbers: 3, 5, 7, 11,... We can get infinitely many continuous even numbers: 6,8,10,12,...

scholarly journals The continuity of prime numbers can lead to even continuity(The ultimate)

2021 ◽  
Author(s):  
Xie Ling
Keyword(s):  
Prime Number ◽  
Prime Numbers ◽  
Original Group

Abstract n continuous prime numbers can combine a group of continuous even numbers. If an adjacent prime number is followed, the even number will continue. For example, if we take prime number 3, we can get even number 6. If we follow an adjacent prime number 5, we can get even numbers by using 3 and 5: 6, 8 and 10. If a group of continuous prime numbers 3,5,7,11,... P, we can get a group of continuous even numbers 6,8,10,12,..., 2n. Then if an adjacent prime number q is followed, the original group of even numbers 6,8,10,12,..., 2n will be finitely extended to 2 (n + 1) or more adjacent even numbers. My purpose is to prove that the continuity of prime numbers will lead to even continuity as long as 2 (n + 1) can be extended. If the continuity of even numbers is discontinuous, it violates the Bertrand Chebyshev theorem of prime numbers. Because there are infinitely many prime numbers: 3, 5, 7, 11,... We can get infinitely many continuous even numbers: 6,8,10,12,...

scholarly journals RSA algorithm using key generator ESRKGS to encrypt chat messages with TCP/IP protocol

2020 ◽  
Vol 8 (2) ◽  
pp. 113-120
Author(s):  
Aminudin Aminudin ◽  
Gadhing Putra Aditya ◽  
Sofyan Arifianto
Keyword(s):  
Prime Number ◽  
Instant Messaging ◽  
Prime Numbers ◽  
Public Key ◽  
Key Generation ◽  
Security Testing ◽  
Rsa Algorithm ◽  
Computer Resource ◽  
Encryption And Decryption ◽  
Private And Public

This study aims to analyze the performance and security of the RSA algorithm in combination with the key generation method of enhanced and secured RSA key generation scheme (ESRKGS). ESRKGS is an improvement of the RSA improvisation by adding four prime numbers in the property embedded in key generation. This method was applied to instant messaging using TCP sockets. The ESRKGS+RSA algorithm was designed using standard RSA development by modified the private and public key pairs. Thus, the modification was expected to make it more challenging to factorize a large number n into prime numbers. The ESRKGS+RSA method required 10.437 ms faster than the improvised RSA that uses the same four prime numbers in conducting key generation processes at 1024-bit prime number. It also applies to the encryption and decryption process. In the security testing using Fermat Factorization on a 32-bit key, no prime number factor was found. The test was processed for 15 hours until the test computer resource runs out.

scholarly journals ON THE DENSITY OF INTEGERS OF THE FORM (p−1)2−n IN ARITHMETIC PROGRESSIONS

2008 ◽  
Vol 78 (3) ◽  
pp. 431-436 ◽  
Author(s):  
XUE-GONG SUN ◽  
JIN-HUI FANG
Keyword(s):  
Positive Integer ◽  
Prime Number ◽  
Arithmetic Progression ◽  
Arithmetic Progressions ◽  
Asymptotic Density ◽  
Natural Numbers ◽  
Positive Proportion ◽  
Covering System

AbstractErdős and Odlyzko proved that odd integers k such that k2n+1 is prime for some positive integer n have a positive lower density. In this paper, we characterize all arithmetic progressions in which natural numbers that can be expressed in the form (p−1)2−n (where p is a prime number) have a positive proportion. We also prove that an arithmetic progression consisting of odd numbers can be obtained from a covering system if and only if those integers in such a progression which can be expressed in the form (p−1)2−n have an asymptotic density of zero.

Sign in / Sign up

Export Citation Format

Share Document