The first one is the answer
Answer:
62990.08 N/M
Explanation:
Circumferential stress, or hoop stress, a normal stress in the tangential (azimuth) direction. axial stress, a normal stress parallel to the axis of cylindrical symmetry. radial stress, a stress in directions coplanar with but perpendicular to the symmetry axis.
See attachment for the step by step solution of the given problem..
Answer:
- Moisture/ water content w = 26%
Explanation:
- Initial mass of saturated soil w1 = mass of soil - weight of container
= 113.27 g - 49.31 g = 63.96 g
- Final mass of soil after oven w2 = mass of soil - weight of container
= 100.06 g - 49.31 g = 50.75
Moisture /water content, w =
=
= 0.26 = 26%
Void ratio = water content X specific gravity of solid
= 0.26 X 2.80 =0.728
Answer:
il(t) = e^(-100t)
Explanation:
The current from the source when the switch is closed is the current through an equivalent load of 15 + 50║50 = 15+25 = 40 ohms. That is, it is 80/40 = 2 amperes. That current is split evenly between the two parallel 50-ohm resistors, so the initial inductor current is 2/2 = 1 ampere.
The time constant is L/R = 0.20/20 = 0.01 seconds. Then the decaying current is described by ...
il(t) = e^(-t/.01)
il(t) = e^(-100t) . . . amperes
Answer:
Codes for each of the problems are explained below
Explanation:
PROBLEM 1 IN C++:
#include<iostream>
using namespace std;
//fib function that calculate nth integer of the fibonacci sequence.
void fib(int n){
// l and r inital fibonacci values for n=1 and n=2;
int l=1,r=1,c;
//if n==1 or n==2 then print 1.
if(n==1 || n==2){
cout << 1;
return;
}
//for loop runs n-2 times and calculates nth integer of fibonacci sequence.
for(int i=0;i<n-2;i++){
c=l+r;
l=r;
r=c;
cout << "(" << i << "," << c << ") ";
}
//prints nth integer of the fibonacci sequence stored in c.
cout << "\n" << c;
}
int main(){
int n; //declared variable n
cin >> n; //inputs n to find nth integer of the fibonacci sequence.
fib(n);//calls function fib to calculate and print fibonacci number.
}
PROBLEM 2 IN PYTHON:
def fib(n):
print("fib({})".format(n), end=' ')
if n <= 1:
return n
else:
return fib(n - 1) + fib(n - 2)
if __name__ == '__main__':
n = int(input())
result = fib(n)
print()
print(result)