Answers are grounded in this paper and cite their sources.
This notes presents results related to divisibility or multiplicity between two numbers in the class of integers called smoothly undulating numbers of the type uz[n]. The main result is to characterize and display types of divisors of some types of numbers uz[n], and we show an algorithm to determine the greatest common divisor between two numbers uz[n].
No takes yet. Share an insight, caveat, or question.
Santos et al. (2023) studied this question.
Synapse has enriched 6 related papers. Consider them for comparative context: