相关论文: On the Success of Mishandling Euclid's Lemma

This short article is aimed at educators and teachers of mathematics.Its goal is simple and direct:to explore some of the basic/elementary properties of proper rational numbers.A proper rational number is a rational which is not an integer.…

An odd prime $p$ is called irregular with respect to Euler polynomials if it divides the numerator of one of the numbers $$E_1(0),E_{3}(0),\ldots,E_{p-2}(0),$$ where $E_n(x)$ is the $n$-th Euler polynomial. As in the classical case, we link…

Let $U = (U_n)_{n \geq 0}$ be a Lucas sequence and, for every prime number $p$, let $\rho_U(p)$ be the rank of appearance of $p$ in $U$, that is, the smallest positive integer $k$ such that $p$ divides $U_k$, whenever it exists.…

A classical problem in analytic number theory is to study the distribution of $\alpha p$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes $p$ such that $p+2$ is…

Let $(p_n)$ denote the sequence of prime numbers, with $2=p_1<p_2<\ldots$. We demonstrate the existence of an irrational number $\alpha$ having the property that the sequence $(\alpha p_n)$ is not well-distributed modulo $1$.

In this paper, we will see that the proportion of d as leading digit, d $\in$ 1, 9, in data (obtained thanks to the hereunder developed model) is more likely to follow a law whose probability distribution is determined by a specific upper…

Let $p$ be an odd prime. We give a formula for the bad part of $p$-class groups that is valid for $100\%$ of the abelian $p$-extensions when ordered by product of ramified primes.

Prime numbers play a key role in number theory and have applications beyond Mathematics. In particular, in the Theory of Codes and also in Cryptography, the properties of prime numbers are relevant, because, from them, it is possible to…

One of the greatest difficulties encountered by all in their first proof intensive class is subtly assuming an unproven fact in a proof. The purpose of this note is to describe a specific instance where this can occur, namely in results…

In this paper, we will see that the proportion of d as p th digit, where p > 1 and d $\in$ 0, 9, in data (obtained thanks to the hereunder developed model) is more likely to follow a law whose probability distribution is determined by a…

An odd perfect number $N$ is said to be given in Eulerian form if $N = {q^k}{n^2}$ where $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$. Similarly, an even perfect number $M$ is said to be given in Euclidean form if $M…

A classical problem in analytic number theory is to study the distribution of fractional part $\alpha p+\beta$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes…

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

We call positive integer n a near-perfect number, if it is sum of all its proper divisors, except of one of them ("redundant divisor"). We prove an Euclid-like theorem for near-perfect numbers and obtain some other results for them.

The Robinson Splitting Theorem states that a c.e. degree $\mathbf{b}$ splits over any low c.e. degree $\mathbf{c}<\mathbf{b}$. We prove that a weaker version of this theorem holds in models of $\mathrm{P}^-+\mathrm{I}\Sigma_1$, with lowness…

A folklore proof of Euclid's theorem on the infinitude of primes uses the Euler product and the irrationality of $\zeta(2) = \pi^2/6$. A quantified form of Euclid's Theorem is Bertrand's postulate $p_{n+1} < 2p_n$. By quantifying the…

The abc conjecture, one of the most famous open problems in number theory, claims that three positive integers satisfying a+b=c cannot simultaneously have significant repetition among their prime factors; in particular, the product of the…

In 1737 Leonard Euler gave what we often now think of as a new proof, based on infinite series, of Euclid's theorem that there are infinitely many prime numbers. Our short paper uses a simple modification of Euler's argument to obtain new…

Let $d(n)$ be the Dirichlet divisor function and $\Delta(x)$ denote the error term of the sum $\sum_{n\leqslant x}d(n)$ for a large real variable $x$. In this paper we focus on the sum $\sum_{p\leqslant x}\Delta^2(p)$, where $p$ runs over…

The abc conjecture is one of the most famous unsolved problems in number theory. The conjecture claims for each real $\epsilon > 0$ that there are only a finite number of coprime positive integer solutions to the equation $a+b = c$ with $c…