Search arXivSearch

arXiv · math/0512643

On Kummer and Stickelberger relations

Abstract

Let p be an odd prime. Let K_p = \Q(zeta_p) be the p-cyclotomic field. We apply a Kummer and Stickelberger relation of K_p to some singular not primary numbers A of K_p connected to p-class group of K_p and prove they verify the congruence A = 1 mod p^2. Let v be a primitive root mod p. This p-adic improvement on singular numbers A allows us to connect in a straightforward way the p-class group C_p to the solutions of some explicit congruence mod p: \sum_{i=1}^{p-2} X^{i-1} \times (\frac{v^{-(i-1)}-v^{-i}\times v}{p}) \equiv 0 mod p: where X is a natural integer and where v^n is understood as v^n mod p with 1 \leq v^n \leq p-1 with n integer \in \Z. The numerical verification of this congruence is completely consistent with table of irregular primes in Washington p. 410.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Roland Queme. 2005-12-30. On Kummer and Stickelberger relations. https://arxiv.org/abs/math/0512643

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT