Answer:
// here is code in C.
// headers
#include <stdio.h>
// main function
int main(void) {
// variable declaration
int favorite_number;
// ask user to enter favorite number
printf("enter your favorite number : ");
// read the number
scanf("%d",&favorite_number);
// print the message
printf("your favorite number is: %d",favorite_number);
return 0;
}
Explanation:
Declare a variable "favorite_number" of integer type.Ask user to enter favorite number and assign it to favorite_number.Then print the message which include the favorite number.
Output:
enter your favorite number : 77
your favorite number is: 77
Answer:
Trojan Horse
Explanation:
Trojan Horse is a program that disguises itself as an interesting, useful or desirable program in order to gain access to your system.
Trojan Horse is a malicious program downloaded virus which seems harmless to a computer but in reality it harms and modifies many activities of a computer. These activities may be unusual and they can also occur even when the computer is idle.
It seems like a genuine file or applications to trick you, once opened it deceives you by loading malware and make it execute on to the Operating system.
Trojan can make you fool by presenting itself like an email from a known source, but it never is. Some common types of Trojan malware are as follows:
- Backdoor Trojan provides a path to the hacker to access your device and control it.
- Downloader Trojan makes an infected device/computer to download more and more malicious softwares and install them.
Answer:
Following are the answer to this question:
Explanation:
In option 1:
The value of n is= 7, which is (base case)
![\to 3^7](https://tex.z-dn.net/?f=%5Cto%203%5E7%3C7%21%5C%5C%5Cto%202187%3C5050%5C%5C)
when n=k for the true condition:
![\to 3^k](https://tex.z-dn.net/?f=%5Cto%203%5Ek%3Ck%21......%28i%29%5C%5C%5C%5C)
when n=k+1 it tests the value:
![\to 3^{(k+1)}= 3^k,3\\\to < (k!) 3 \ substituting \ equation \\\to](https://tex.z-dn.net/?f=%5Cto%203%5E%7B%28k%2B1%29%7D%3D%203%5Ek%2C3%5C%5C%5Cto%20%3C%20%28k%21%29%203%20%5C%20substituting%20%5C%20equation%20%5C%5C%5Cto%20%3Ck%21%20%5Ccdot%20%28k%2B1%29%5C%5C)
since k>6 hence the value is KH>3 hence proved.
In option 2:
when:
for n=1:(base case)
![\log(1!)](https://tex.z-dn.net/?f=%5Clog%281%21%29%3C%3D1%5Clog%281%29)
0<=0 \\ condition is true
when the above statement holds value n=1
when n=k
![\log(k!)](https://tex.z-dn.net/?f=%5Clog%28k%21%29%20%3C%3Dk%5Clog%28k%29....%281%29)
when n=k+1
![\log(k+1)!=\log(k!)+\log(k+1)\\](https://tex.z-dn.net/?f=%5Clog%28k%2B1%29%21%3D%5Clog%28k%21%29%2B%5Clog%28k%2B1%29%5C%5C)
![](https://tex.z-dn.net/?f=%3C%3D%20k%20%5Clog%28k%29%2B%5Clog%28kH%29%5C%5C%3C%3D%20kH%5Clog%28kH%29%5C%5C)
![[\therefore KH>K \Rightarrow \log(KH>\loK)]](https://tex.z-dn.net/?f=%5B%5Ctherefore%20KH%3EK%20%5CRightarrow%20%20%5Clog%28KH%3E%5CloK%29%5D)
In option 3:
when n=1:
![A_1 \cup B=A_1 \cup B\\\\](https://tex.z-dn.net/?f=A_1%20%5Ccup%20B%3DA_1%20%5Ccup%20B%5C%5C%5C%5C)
when n=k
![\to (A_1\cap A_2 \cap.....A_k) \cup B\\=(A_1\cup B) \cap(A_2\cup B_2)....(A_k \capB).....(a)\\\to n= k+1\\ \to (A_1\cap A_2 \cap.....A_{kH}) \cup B= (A_1\cup B)\\\\\to [(A_1\cap A_2 \cap.....A_{k}) \cup B]\cap (A_{KH}\cup B)\\\\\to [(A_1\cup B) \cap (A_2 \cup B) \cap (A_3\cup B).....(A_k\cup B)\cap (A_{k+1} \cup B)\\\\ \ \ \ \ \ \ substituting \ equation \ a \\\\](https://tex.z-dn.net/?f=%5Cto%20%28A_1%5Ccap%20A_2%20%5Ccap.....A_k%29%20%5Ccup%20B%5C%5C%3D%28A_1%5Ccup%20B%29%20%5Ccap%28A_2%5Ccup%20B_2%29....%28A_k%20%5CcapB%29.....%28a%29%5C%5C%5Cto%20n%3D%20k%2B1%5C%5C%20%5Cto%20%28A_1%5Ccap%20A_2%20%5Ccap.....A_%7BkH%7D%29%20%5Ccup%20B%3D%20%28A_1%5Ccup%20B%29%5C%5C%5C%5C%5Cto%20%20%5B%28A_1%5Ccap%20A_2%20%5Ccap.....A_%7Bk%7D%29%20%5Ccup%20B%5D%5Ccap%20%28A_%7BKH%7D%5Ccup%20B%29%5C%5C%5C%5C%5Cto%20%20%5B%28A_1%5Ccup%20B%29%20%5Ccap%20%28A_2%20%5Ccup%20B%29%20%5Ccap%20%28A_3%5Ccup%20B%29.....%28A_k%5Ccup%20B%29%5Ccap%20%28A_%7Bk%2B1%7D%20%5Ccup%20B%29%5C%5C%5C%5C%20%20%5C%20%5C%20%5C%20%5C%20%5C%20%5C%20substituting%20%5C%20equation%20%5C%20a%20%5C%5C%5C%5C)
hence n=k+1 is true.
Answer:
Chronological
Explanation:
Chronological order is the method of arranging yoursubject's main points in a time sequence.