相关论文: On primitive Pythagorean triples of special forms

Modulo a prime number, we define semi-primitive roots as the square of primitive roots. We present a method for calculating primitive roots from quadratic residues, including semi-primitive roots. We then present progressions that generate…

This paper presents new properties of Primitive Pythagorean Triples (PPT) that have relevance in applications where events of different probability need to be generated and in cryptography.

We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…

To represent positive integers by regular patterns on a plane or in three-dimensional space may be traced back to the Pythagoreans. The aim of the present article is to explore the possibility of extending the representation framework for…

We prove a general divisibility theorem that implies, e.g., that, in any group, the number of generating pairs (as well as triples, etc.) is a multiple of the order of the commutator subgroup. Another corollary says that, in any associative…

We introduce extremely symmetric primes and provide some elementary properties of these.

We introduce two families of transcendental numbers which we call finite factorial (FF) and partially finite factorial (PFF) numbers respectively, with the former one being subfamily of the latter one. These numbers arise naturally from…

For a primitive Hilbert modular form $f$ over $F$ of weight $k$, under certain assumptions on image of $\bar{\rho}_{f,\lambda}$, we calculate the Dirichlet density of primes $\mathfrak{p}$ for which the $\mathfrak{p}$-th Fourier coefficient…

We show that for infinitely many square-free integers q there exist infinitely many triples of rational numbers {a, b, c} such that a^2 + q, b^2 + q, c^2 + q, ab + q, ac + q and bc + q are squares of rational numbers.

A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…

A generalization of the term "generalized Clifford algebras" (as appears in papers on advances in applied Clifford algebras) is introduced. This algebra is studied by means of structure theory of central simple algebras. A graph theoretical…

Let $G$ be a finite primitive permutation group on a set $\Omega$ with nontrivial point stabilizer $G_{\alpha}$. We say that $G$ is extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus \{\alpha\}$.…

A positive definite integral quadratic form is said to be almost (primitively) universal if it (primitively) represents all but at most finitely many positive integers. In general, almost primitive universality is a stronger property than…

Triangular algebras, and maximal triangular algebras in particular, have been objects of interest for over fifty years. Rich families of examples have been studied in the context of many w$^*$- and C$^*$-algebras, but there remains a dearth…

We give a complete characterization of countable primitive groups in several settings including linear groups, subgroups of mapping class groups, groups acting minimally on trees and convergence groups. The latter category includes as a…

Let $F=\mathbb{F}_{q^m}$, $m>6$, $n$ a positive integer, and $f=p/q$ with $p$, $q$ co-prime irreducible polynomials in $F[x]$ and deg$(p)$ $+$ deg$(q)= n$. A sufficient condition has been obtained for the existence of primitive pairs…

Given ${\mathbb{F}_{p^t}}$, a field with $p^t$ elements, where $p$ is a prime power, $t$ is a positive integer. Let $f(x)$ be a polynomial over $\mathbb{F}_{p^t}$ of degree $m$ with some restrictions. In this paper, we construct a…

Suppose that $n$ is $0$ or $4$ modulo $6$. We show that there are infinitely many primes of the form $p^2 + nq^2$ with both $p$ and $q$ prime, and obtain an asymptotic for their number. In particular, when $n = 4$ we verify the `Gaussian…

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

We consider the family of polynomials $f_{d,c}(x)=x^d+c$ over the rational field $\Q$. Fixing integers $d, n\ge 2$, we show that the density of primes that can appear as primitive prime divisors of $f_{d,c}^n(0)$ for some $c\in\Q$ is…