User talk:Gohil kartik

Given a number 'p', develop a logic and write a Python program to determine the smallest integer 'n' in the sum of the reciprocals ( 1 + 1/2 + 1/3 + ⋅⋅⋅ + 1/n) that makes the summation to be greater than 'p'. Print the value of 'n' and the sum 's'. For example, when p=3, the sum of the reciprocals continues to be added until the value of s become greater than 3 i.e. n is 11

Input Format:

Value of n

Output Format:

Sum of reciprocals

Boundary Conditions:

n>0