Hello :)
Suppose I input an int value with Scanner sc = new Scanner(System.in)... and I want to count how many divisors that value has, how would I proceed in "recognizing" a divisor? if ((input/2)%10 == 0)? I'd prefer doing this recursively somehow. Can someone help? :)
Best Wishes!
Jump to Posta is a divisor of b iff (b%a == 0)
I have no idea how (or why) you would do this recursively - you just need a loop to try all values of a from 1 to sqrt(b)
a is a divisor of b iff (b%a == 0)
I have no idea how (or why) you would do this recursively - you just need a loop to try all values of a from 1 to sqrt(b)
Ok, just needed what you said JamesCherrill. :) Thanks for the tips. I solved it now!
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.