Abstract
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].
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
