Volume 32 ▶ Number 1 ▷ Number 2 (Online First)
- Volume opened: 1 April 2026
- Status: In progress
On the inverse of a certain triangular matrix and its connection to the largest odd divisor
Original research paper. Pages 255–262
Sela Fried
Full paper (PDF, 196 Kb) | Abstract
A note on Leibniz rule for difference quotient
Original research paper. Pages 263–268
Taekyun Kim and Dae San Kim
Full paper (PDF, 161 Kb) | Abstract
Simpler congruences for Jacobi sum J(1,1)49 of order 49
Original research paper. Pages 269–280
Ishrat Jahan Ansari, Vikas Jadhav and Devendra Shirolkar
Full paper (PDF, 237 Kb) | Abstract
q-Leonardo polynomials
Original research paper. Pages 281–299
Naim Tuglu, Sude Sıla Ekinci and Miraç Çetin Keskin
Full paper (PDF, 327 Kb) | Abstract
Generalizing Pascal’s row sums to complex orders: A Poisson summation approach
Original research paper. Pages 300–312
Fabrizio Mancini
Full paper (PDF, 808 Kb) | Abstract
The homothetical-Hopf transformation of Pythagorean quadruples
Original research paper. Pages 313–320
Mircea Crasmareanu
Full paper (PDF, 226 Kb) | Abstract
A note on h-fold signed sumset in the set of integers
Original research paper. Pages 321–327
Mohan
Full paper (PDF, 176 Kb) | Abstract

Bhanja and Pandey [J. Number Theory, 196 (2019), 340–352] gave an optimal lower bound for the cardinality of
. They also characterized the set
when the cardinality of
attains the optimal lower bound. In this note, we revisit their results by providing new proofs. We observe that the study of obtaining the optimal lower bound for the cardinality of
, and the structure of the set
when
attains the optimal lower bound, rather than for an arbitrary set of integers, suffices when
is an arithmetic progression.
Arithmetical functions associated with divisibility sequences
Original research paper. Pages 328–334
Anthony G. Shannon
Full paper (PDF, 805 Kb) | Abstract
A proof of Spence’s formula using the reciprocity law for Dedekind sums
Original research paper. Pages 335–341
Steven Brown
Full paper (PDF, 218 Kb) | Abstract
With
being Euler’s totient function, if
is an integer, and if
![]()
are the positive integers less than
, coprime with
, then

where
is the square-free part of
, and
is the number of prime factors of
.
Spence’s proof relies on an ingenious observation considering Nagell’s totient function.
Later in 1971, Lucien Van Hamme provided an alternative proof of the result using Fourier analysis and previous work from Hubert Delange in 1968. In this paper, I propose another proof of the formula using the reciprocity law for Dedekind sums. If the formula is of interest on its own, it also plays a role in the analysis of the distribution of the
as suggested by the work from Hubert Delange.
Some new inequalities for the q-gamma and related functions, II
Original research paper. Pages 342–353
József Sándor
Full paper (PDF, 274 Kb) | Abstract
On (k,t)-Fibonacci–François numbers
Original research paper. Pages 354–373
Élis G. C. Mesquita, Francisco R. V. Alves, Eudes A. Costa
Full paper (PDF, 284 Kb) | Abstract
This volume of the International Journal “Notes on Number Theory and Discrete Mathematics” is published with the financial support of the Bulgarian National Science Fund, Grant Ref. No. KP-06-NP7/2/03.12.2025. Bulgarian National Science Fund bears no liability for the content of the published materials.
