ALGEBRAIC AND GEOMETRIC PROPERTIES OF LATTICE WALKS WITH STEPS OF EQUAL LENGTH

2016 ◽  
Vol 95 (2) ◽  
pp. 338-346
Author(s):  
KRZYSZTOF KOŁODZIEJCZYK ◽  
RAFAŁ SAŁAPATA

A lattice walk with all steps having the same length $d$ is called a $d$-walk. Denote by ${\mathcal{T}}_{d}$ the terminal set, that is, the set of all lattice points that can be reached from the origin by means of a $d$-walk. We examine some geometric and algebraic properties of the terminal set. After observing that $({\mathcal{T}}_{d},+)$ is a normal subgroup of the group $(\mathbb{Z}^{N},+)$, we ask questions about the quotient group $\mathbb{Z}^{N}/{\mathcal{T}}_{d}$ and give the number of elements of $\mathbb{Z}^{2}/{\mathcal{T}}_{d}$ in terms of $d$. To establish this result, we use several consequences of Fermat’s theorem about representations of prime numbers of the form $4k+1$ as the sum of two squares. One of the consequences is the fact, observed by Sierpiński, that every natural power of such a prime number has exactly one relatively prime representation. We provide explicit formulas for the relatively prime integers in this representation.

2021 ◽  
Author(s):  
Xie Ling

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,...


2021 ◽  
Author(s):  
Xie Ling

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,...


2020 ◽  
Vol 8 (2) ◽  
pp. 113-120
Author(s):  
Aminudin Aminudin ◽  
Gadhing Putra Aditya ◽  
Sofyan Arifianto

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.


1989 ◽  
Vol 41 (1) ◽  
pp. 14-67 ◽  
Author(s):  
M. Chacron

Let D stand for a division ring (or skewfield), let G stand for an ordered abelian group with positive infinity adjoined, and let ω: D → G. We call to a valuation of D with value group G, if ω is an onto mapping from D to G such that(i) ω(x) = ∞ if and only if x = 0,(ii) ω(x1 + x2) = min(ω (x1), ω (x2)), and(iii) ω (x1 x2) = ω (x1) + ω (x2).Associated to the valuation ω are its valuation ringR = ﹛x ∈ Dω(x) ≧ 0﹜,its maximal idealJ = ﹛x ∈ |ω(x) > 0﹜, and its residue division ring D = R/J.The invertible elements of the ring R are called valuation units. Clearly R and, hence, J are preserved under conjugation so that 1 + J is also preserved under conjugation. The latter is thus a normal subgroup of the multiplicative group Dm of D and hence, the quotient group D˙/1 + J makes sense (the residue group of ω). It enlarges in a natural way the residue division ring D (0 excluded, and addition “forgotten“).


1993 ◽  
Vol 36 (2) ◽  
pp. 289-297
Author(s):  
Angel Carocca ◽  
Rudolf Maier

Based on the theory of p-supersoluble and supersoluble groups, a prime-number parametrized family of canonical characteristic subgroups Γp(G) and their intersection Γ(G) is introduced in every finite group G and some of its properties are studied. Special interest is dedicated to an elementwise description of the largest p-nilpotent normal subgroup of Γp(G) and of the Fitting subgroup of Γ(G).


2019 ◽  
Vol 15 (05) ◽  
pp. 1037-1050
Author(s):  
Erik R. Tou

The mathematics of juggling emerged after the development of siteswap notation in the 1980s. Consequently, much work was done to establish a mathematical theory that describes and enumerates the patterns that a juggler can (or would want to) execute. More recently, mathematicians have provided a broader picture of juggling sequences as an infinite set possessing properties similar to the set of positive integers. This theoretical framework moves beyond the physical possibilities of juggling and instead seeks more general mathematical results, such as an enumeration of juggling patterns with a fixed period and arbitrary number of balls. One problem unresolved until now is the enumeration of primitive juggling sequences, those fundamental juggling patterns that are analogous to the set of prime numbers. By applying analytic techniques to previously-known generating functions, we give asymptotic counting theorems for primitive juggling sequences, much as the prime number theorem gives asymptotic counts for the prime positive integers.


Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1414
Author(s):  
Vicente Jara-Vera ◽  
Carmen Sánchez-Ávila

In this paper, we give a new proof of the divergence of the sum of the reciprocals of primes using the number of distinct prime divisors of positive integer n, and the placement of lattice points on a hyperbola given by n=pr with prime number p. We also offer both a new expression of the average sum of the number of distinct prime divisors, and a new proof of its divergence, which is very intriguing by its elementary approach.


Author(s):  
V. S. Malakhovsky

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.


2002 ◽  
Vol 8 (2) ◽  
pp. 70-76
Author(s):  
Jeffrey J. Wanko ◽  
Christine Hartley Venable

Middle school students learn about patterns, formulas, and large numbers motivated by a search for the largest prime number. Activities included.


2008 ◽  
Vol 7 (4) ◽  
pp. 751-792 ◽  
Author(s):  
Olivier Frécon

AbstractWe consider a new subgroup In(G) in any group G of finite Morley rank. This definably characteristic subgroup is the smallest normal subgroup of G from which we can hope to build a geometry over the quotient group G/ In(G). We say that G is a geometric group if In(G) is trivial.This paper is a discussion of a conjecture which states that every geometric group G of finite Morley rank is definably linear over a ring K1 ⊕…⊕ Kn where K1,…,Kn are some interpretable fields. This linearity conjecture seems to generalize the Cherlin–Zil'ber conjecture in a very large class of groups of finite Morley rank.We show that, if this linearity conjecture is true, then there is a Rosenlicht theorem for groups of finite Morley rank, in the sense that the quotient group of any connected group of finite Morley rank by its hypercentre is definably linear.


Sign in / Sign up

Export Citation Format

Share Document