Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Trying to make a largest divisor solver.
Write a method largestDivisor that takes an integer argument and returns the largest positive integer which is less than the argument that divides the argument. (For example, 10 is the largest divisor of 20.) You may assume that the argument is positive. If the argument is 1, return 0 to indicate that there is no such divisor.
what I have so far:
public static void main(String[] args {
int[][] a = {{10,9,8,7,6,5,4,3,2,1}};
System.out.println(Arrays.toString(a[0]));
}
}
Re: Trying to make a largest divisor solver.
You need to think this through mathematically as to how you would do it (for example with pencil and paper). Then convert that to Java code.
Regards,
Jim
Reply With Quote