DOIAbstract
... integers, then there is a sum a, \ + #2 H V &k w *th aι € A \ 9 ci2 € A2,...,akeAk that is divisible by a "small " prime
... integers, then there is a sum a, \ + #2 H V &k w *th aι € A \ 9 ci2 € A2,...,akeAk that is divisible by a "small " prime
Abstract. Let p be an odd prime and γ(k, pn) be the smallest positive integer s such that every inte...
Let σ(n) be the sum of the divisors of n. Although much attention has been paid to the possible valu...
Denote by ρ(k) the smallest prime number with digital sum k (not a multiple of 3). Richard K. Guy as...
We determine the exact power of a prime p which divides the power sum 1n+2n+· · ·+(bm−1)n provided t...
Waring’s problem with small prime factors by Gergely Harcos (Budapest) 1. Introduction. As a natural...
AbstractGiven a positive integer l, this paper establishes the existence of constants η > 1 and δ > ...
There is a body of work in the literature on various restricted sums of the number of divisors of an...
restricted sums of the number of divisors of an integer function including that described in [2{9, 1...
Notation. We denote the sum of the digits of a positive integer n by SD(n). The notation a | b mean...
A number of sequences based on sums of powers of integers is pre-sented. This approach provides a si...
This Demonstration gives simple ways to quickly tell if an integer is divisible by the numbers 1-9Co...
Abstract. For each positive integer n, let s(n) denote the sum of the proper divisors of n. If s(n)&...
Let Ω(n) denote the number of prime divisors of n counting multiplicity. One can show that for any p...
Let ƒn denote the sum of the divisors of the positive integer n and ƒ (n - a), a \u3c n. similarly d...
I n school we generally study divisibility by divisors from 2 to 12 (except 7 in some syllabi). In...
Abstract. Let p be an odd prime and γ(k, pn) be the smallest positive integer s such that every inte...
Let σ(n) be the sum of the divisors of n. Although much attention has been paid to the possible valu...
Denote by ρ(k) the smallest prime number with digital sum k (not a multiple of 3). Richard K. Guy as...
We determine the exact power of a prime p which divides the power sum 1n+2n+· · ·+(bm−1)n provided t...
Waring’s problem with small prime factors by Gergely Harcos (Budapest) 1. Introduction. As a natural...
AbstractGiven a positive integer l, this paper establishes the existence of constants η > 1 and δ > ...
There is a body of work in the literature on various restricted sums of the number of divisors of an...
restricted sums of the number of divisors of an integer function including that described in [2{9, 1...
Notation. We denote the sum of the digits of a positive integer n by SD(n). The notation a | b mean...
A number of sequences based on sums of powers of integers is pre-sented. This approach provides a si...
This Demonstration gives simple ways to quickly tell if an integer is divisible by the numbers 1-9Co...
Abstract. For each positive integer n, let s(n) denote the sum of the proper divisors of n. If s(n)&...
Let Ω(n) denote the number of prime divisors of n counting multiplicity. One can show that for any p...
Let ƒn denote the sum of the divisors of the positive integer n and ƒ (n - a), a \u3c n. similarly d...
I n school we generally study divisibility by divisors from 2 to 12 (except 7 in some syllabi). In...
Abstract. Let p be an odd prime and γ(k, pn) be the smallest positive integer s such that every inte...
Let σ(n) be the sum of the divisors of n. Although much attention has been paid to the possible valu...
Denote by ρ(k) the smallest prime number with digital sum k (not a multiple of 3). Richard K. Guy as...
Add to ORKG