On the congruence ∑j=1n−1jk(n−1)≡−1(modn)\sum_{j=1}^{n-1} j^{k(n-1)} \equiv -1 \pmod n . k-strong Giuga and k-Carmichael numbers

preprint2013arXivOpen access

Abstract

In this work we consider the congruence ∑j=1n−1jk(n−1)≡−1(modn)\sum_{j=1}^{n-1} j^{k(n-1)} \equiv -1 \pmod n for each k∈Nk \in \mathbb{N}, thus extending Giuga's ideas for k=1k=1. In particular, it is proved that a pair (n,k)∈N2(n,k)\in \mathbb{N}^2 satisfies this congruence if and only if nn is prime or a Giuga Number and λ(n)∣k(n−1)λ(n) \mid k(n-1). In passing, we establish new characterizations of Giuga numbers and we study some properties of the numbers nn satisfying λ(n)∣k(n−1)λ(n) \mid k(n-1).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.