ﻻ يوجد ملخص باللغة العربية
Given an integer $k$, define $C_k$ as the set of integers $n > max(k,0)$ such that $a^{n-k+1} equiv a pmod{n}$ holds for all integers $a$. We establish various multiplicative properties of the elements in $C_k$ and give a sufficient condition for the infinitude of $C_k$. Moreover, we prove that there are finitely many elements in $C_k$ with one and two prime factors if and only if $k>0$ and $k$ is prime. In addition, if all but two prime factors of $n in C_k$ are fixed, then there are finitely many elements in $C_k$, excluding certain infinite families of $n$. We also give conjectures about the growth rate of $C_k$ with numerical evidence. We explore a similar question when both $a$ and $k$ are fixed and prove that for fixed integers $a geq 2$ and $k$, there are infinitely many integers $n$ such that $a^{n-k} equiv 1 pmod{n}$ if and only if $(k,a) eq (0,2)$ by building off the work of Kiss and Phong. Finally, we discuss the multiplicative properties of positive integers $n$ such that Carmichael function $lambda(n)$ divides $n-k$.
In this paper, we introduce a new type of generalized alternating hyperharmonic numbers $H_n^{(p,r,s_{1},s_{2})}$, and show that Euler sums of the generalized alternating hyperharmonic numbers $H_n^{(p,r,s_{1},s_{2})}$ can be expressed in terms of li
Some new results concerning the equation $sigma(N)=aM, sigma(M)=bN$ are proved. As a corollary, there are only finitely many odd superperfect numbers with a fixed number of distinct prime factors.
Recently the new q-Euler numbers are defined. In this paper we derive the the Kummer type congruence related to q-Euler numbers and we introduce some interesting formulae related to these q-Euler numbers.
In this paper we investigate the properties of the Euler functions. By using the Fourier transform for the Euler function, we derive the interesting formula related to the infinite series. Finally we give some interesting identities between the Euler numbers and the second kind stirling numbers.
Let s be an integer greater than or equal to 2. A real number is simply normal to base s if in its base-s expansion every digit 0, 1, ..., s-1 occurs with the same frequency 1/s. Let X be the set of positive integers that are not perfect powers, henc