Computing solutions to the congruence \(1^n + 2^n + \ldots + n^n \equiv p \pmod n\) (Q2201763)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing solutions to the congruence 1ⁿ + 2ⁿ + + n^n p n |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing solutions to the congruence \(1^n + 2^n + \ldots + n^n \equiv p \pmod n\) |
scientific article |
Statements
Computing solutions to the congruence \(1^n + 2^n + \ldots + n^n \equiv p \pmod n\) (English)
0 references
17 September 2020
0 references
power sums
0 references
primary pseudoperfect numbers
0 references
algorithm
0 references
0 references
0.7687040567398071
0 references
0.7568051218986511
0 references
