Discover the Pattern of PDS Numbers and Find the Nth PDS Number

  • Thread starter Thread starter shekhar kumar
  • Start date Start date
shekhar kumar
Messages
1
Reaction score
0
PDS number:> a number whose product of digits is completely divisible by sum of its digits.
Now the series comes out to be: 1,2,3,4,5,6,7,8,9,10,20,22,30,36,40,44,50,60,63,66,70... so on.
(1. Numbers from 1 to 10 are already divisible by themselves.
2. Then all the multiples of 22 follow the pds series completely.
3. And finally all the numbers which contains atleast one zero are also pds number).
I have to find the general term of this pds series so that i can find the nth pds number in a single shot.
Plz help in doing that as soon as possible.
Thanks in advance...
 
Physics news on Phys.org
you have said three conditions...in that case how the numbers 36,63...will come in the list...they are neither containing zero...nor multiples of 22...


shekhar kumar said:
PDS number:> a number whose product of digits is completely divisible by sum of its digits.
Now the series comes out to be: 1,2,3,4,5,6,7,8,9,10,20,22,30,36,40,44,50,60,63,66,70... so on.
(1. Numbers from 1 to 10 are already divisible by themselves.
2. Then all the multiples of 22 follow the pds series completely.
3. And finally all the numbers which contains atleast one zero are also pds number).
I have to find the general term of this pds series so that i can find the nth pds number in a single shot.
Plz help in doing that as soon as possible.
Thanks in advance...
 
shekhar kumar said:
PDS number:> a number whose product of digits is completely divisible by sum of its digits.
Now the series comes out to be: 1,2,3,4,5,6,7,8,9,10,20,22,30,36,40,44,50,60,63,66,70... so on.
(1. Numbers from 1 to 10 are already divisible by themselves.
2. Then all the multiples of 22 follow the pds series completely.
3. And finally all the numbers which contains atleast one zero are also pds number).
I have to find the general term of this pds series so that i can find the nth pds number in a single shot.
Plz help in doing that as soon as possible.
Thanks in advance...

I don't think there is any general formula for finding the nth term. You could of course write an algorithm that generates the nth digit but the time would increase exponentially with the size of n.

BiP
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top