refactorable造句

• There are still unsolved problems regarding refactorable numbers.
• Colton called such numbers " refactorable ".
• 156 is an abundant number, a pronic number, a dodecagonal number, a refactorable number and a Harshad number.
• These comments were non-offensive and not within our accepted and rightly limited bounds for when talk pages should be refactorable.
• Colton proved many results about refactorable numbers, showing that there were infinitely many and proving a variety of congruence restrictions on their distribution.
• 225 is a sum of divisors function and " & phi; " is Euler's totient function . 225 is a refactorable number.
• 152 is a refactorable number since it is divisible by the total number of divisors it has, and in base 10 it is divisible by the sum of its digits, making it a Harshad number.
• Zelinsky wondered if there exists a refactorable number n _ 0 \ equiv a \ mod m, does there necessarily exist n > n _ 0 such that " n " is refactorable and n \ equiv a \ mod m.
• Zelinsky wondered if there exists a refactorable number n _ 0 \ equiv a \ mod m, does there necessarily exist n > n _ 0 such that " n " is refactorable and n \ equiv a \ mod m.