For how many 9-digit prime numbers as argument does wow(x) return 8 ? - how many numbers are on a wow tcg
WOW () integer x integer
begin
s World
while (true)
sum_of_digits = s (x)
if (s is equal to x)
Break
END_IF
x = s
END_WHILE
return x
End
How many 9-digit prime number of the argument, wow (x) return 8?
Tuesday, February 16, 2010
How Many Numbers Are On A Wow Tcg For How Many 9-digit Prime Numbers As Argument Does Wow(x) Return 8 ?
3 comments:
We have last week:
http://answers.yahoo.com/question/index ...
372.
Why ask these people? Just run the same shit.
Make a list of primes up to the square root of this number is increased by 9 points.
Loop through all 9 digits if the sum of 8-digit check to see if it is the first test, if it is divisible by no number in the main list. Make sure that the sum of the numbers, first because the sum of the numbers much faster than the control primes.
This algorithm has nothing to do with prime numbers or aft. What it does is simply the sum of all digits of x recursively until it reaches a value of 1 digit, then returns.
The answer is then returned 8 of the 9-digit prime number as many digits to 9 contact numbers whose sum recursively 8th cousins
Post a Comment