Answer:
The program is given below with appropriate comments for better understanding
Explanation:
#Program
# foot stride = 2.5 feet
# 1 mile = 5280 feet
no_stride_first_min = int(input('Enter the number strides made durng the first minute of jogging: '))
no_stride_last_min = int(input('Enter the number strides made durng the last minute of jogging: '))
avg_stride_one_min = (no_stride_first_min + no_stride_last_min)/2 # calculates the average stride per minute
jogging_duration = float(input('Enter the total time spent jogging in hours and minute: '))
jogging_duration_hours = int(jogging_duration) # gets the hour
jogging_duration_min = jogging_duration - int(jogging_duration) # gets the minute
tot_jogging_duration_min = jogging_duration_hours*60 + jogging_duration_min # calculates total time in minutes
dist_feet = (avg_stride_one_min*2.5)*tot_jogging_duration_min # calculates the total distance in feet
dist_miles = dist_feet/5280 # calculates the total distance in mile
print('Distance traveled in miles = {0:.2f} miles'.format(dist_miles))
Answer:
32582657
Explanation:
If any number is in the form of 2^{n}-1 is known as Mersenne prime. Here, n is a prime number.
For example:
If n is 3 then the corresponding binary number is as follows:
P=2^{3}-1
P=7
Here, the binary representation of P is (111)₂.
The number of binary digits is 3 which are equal to n.
Consider the given expression
P=2^32582657-1
This is also in the form 2^{n}-1
Here the value of n is 32582657.
Hence, the number of binary digits for the given prime number is 32582657
