Answer:
0.127 miles ; 5.458 *10^8 miles
Explanation:
Number of bytes needed to store a page = 2000
Number of pages (Harry Potter's book) = 800
Total memory required to store entire book = (2000 * 800) = 1600000 = 16 * 10^5 bytes
Hence,
1 byte of memory will store : (height of each book / memory size of each book)
= 3 ÷ 16 * 10^5
= 1.875 * 10^-6
For 32 bit memory space :
(1.875 * 10^-6 * 2^32) = 8053.06368 inches
1 inch = 1.578 * 10^-5 mile
8053.06368 inches = 8053.06368 * (1.578 * 10^-5) = 0.1270773448704 miles
= 0.127 miles
For 64 bit memory size :
(1.875 * 10^-6 * (2^64)) = 3.45876 * 10^13 inches
(3.45876 * 10^13) * (1.578 * 10^-5)
= 5.458 *10^8 miles
Answer:
The first Industrial Revolution began in Great Britain in the mid-to-late 1700s, when innovation led to goods being produced in large quantities due to machine manufacturing.
This process began in Britain in the 18th century and from there spread to other parts of the world. Although used earlier by French writers, the term Industrial Revolution was first popularized by the English economic historian Arnold Toynbee (1852–83) to describe Britain's economic development from 1760 to 1840.
Answer:
bruh please join back im a new fnaf fandom and i need some help to understand what that is
Explanation:
Answer:
The Solution Code is written in Java.
- public class Main {
- public static void main(String[] args) {
- System.out.print("Please enter an integer: ");
- Scanner input = new Scanner(System.in);
- int number = input.nextInt();
- System.out.print("Prime numbers less than or equal to " + number + " : ");
- for(int i=2; i <= number; i++){
- if(checkPrime(i)){
- System.out.print(i + " ");
- }
- }
- }
- public static Boolean checkPrime(int num){
- for(int i=2; i < num; i++)
- {
- if(num % i == 0){
- return false;
- }
- }
- return true;
- }
- }
Explanation:
Firstly, we create a function to check if a number is prime (Line 18 - 27).
- This function will take one input value which is an integer, num.
- To check if the input num is a prime, we can use modulus operator, %, to confirm if the num is divisible by any number starting from 2 to num - 1 (Line 19 - 24).
- If the num is divisible by any number expect 1 and itself, it should equal to zero and return false to indicate it is not a prime number.
- If all the num (except 1 and itself) is not divisible, the function will return true (Line 25).
Next, in our main program part (Line 3 - 16)
- Prompt the user to input a number (Line 5 - 7)
- Using a for-loop, we can keep calling the checkPrime() function by passing a current number (starting from 2 to input number) as argument (Line 12). The checkPrime() function will run and return true it the current number is prime, return false if it is not prime.
- If the checkPrime() function return true, it will print the current number before proceed to the iteration of the for-loop to repeat the same check prime procedure (Line 13)
- At the end all the prime numbers less than or equal to the input number will be printed out in the terminal
