Write a recursive program to compute the number of ways in which an integer k * can be written as sum, each of whose operands is greater than one but less * than k.

Example:

javac MyRecursiveClass.java
java MyRecursiveClass 10

Integer 10 can be written as 11 sums.

Integer 10 written as sums:
1 : 2 + 8
2 : 2 + 2 + 6
3 : 2 + 2 + 2 + 4
4 : 2 + 2 + 2 + 2 + 2
5 : 2 + 2 + 3 + 3
6 : 2 + 3 + 5
7 : 2 + 4 + 4
8 : 3 + 7
9 : 3 + 3 + 4
10 : 4 + 6
11 : 5 + 5
Academic Honesty!
It is not our intention to break the school's academic policy. Projects posted are only used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly fill out the form. Please provide a valid email address and we'll get back to you in less than 24 hours. We will be sending an invoice through PayPal upon confirmation. We are a non profit organization however we need an amount to keep this organization running, and to be able to complete our research and development.