1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
lbvjy [14]
4 years ago
13

Who wants to talk? I am willing to talk to anyone! I AM SO BORED!!

Computers and Technology
2 answers:
wolverine [178]4 years ago
4 0

Answer:

I want to talk. Im bored too

Explanation:

satela [25.4K]4 years ago
3 0

I'd love to talk with you :)

You might be interested in
The part of the computer that provides access too the internet is?
koban [17]
The modem I believe...
6 0
3 years ago
Read 2 more answers
A.<br> Post-It note<br> b.<br> notebook<br> c.<br> tutor<br> d.<br> spell check
Ostrovityanka [42]
What is this for? like what is the question?


4 0
3 years ago
Your program will search for prime numbers. You will first ask the user for the range of values to search, and use for loops to
Stells [14]

Answer:

Java code is given below

Explanation:

import java.util.Scanner;

public class Prime {

public static void main(String args[]) {

int first, last, flag = 0, i, j;

Scanner s = new Scanner(System.in);

System.out.println("Enter the lower limit :");

first = s.nextInt();

System.out.println("Enter the upper limit :");

last = s.nextInt();

System.out.println("The prime numbers in between the entered limits are :");

int x = 0;

for (i = first; i <= last; i++) {

for (j = 2; j < i; j++) {

if (i % j == 0) {

flag = 0;

break;

} else {

flag = 1;

}

}

if (flag == 1) {

x++;

System.out.println(i + " ");

}

}

System.out.println("Total number of prime numbes between " + first + " and " + last + " are " + x);

}

}

7 0
3 years ago
A program similar to mtr, ____, is available as a command-line utility in Windows operating systems.
KATRIN_1 [288]

Answer:

pathping

Explanation:

3 0
3 years ago
Write c++ program from 1to 100 to find prime numbers using statement.​​
olasank [31]

#include <iostream> using namespace std; int isPrimeNumber(int); int main() { bool isPrime; for(int n = 2; n < 100; n++) { // isPrime will be true for prime numbers isPrime = isPrimeNumber(n); if(isPrime == true) cout<<n<<" "; } return 0; } // Function that checks whether n is prime or not int isPrimeNumber(int n) { bool isPrime = true; for(int i = 2; i <= n/2; i++) { if (n%i == 0) { isPrime = false; break; } } return isPrime; }

5 0
3 years ago
Other questions:
  • what would happen if a large number of computer users are attempting to access a web site at the same time that you are
    15·2 answers
  • Maia notices that her paragraphs are too close to one another. She wants to increase the space. Which arrangement of steps does
    6·2 answers
  • Which category of software would programming languages fall into?
    8·2 answers
  • A technician selected the GUI interface on a wireless router and added a DNS address of 208.67.220.220. The technician then imme
    6·1 answer
  • Which type of microscope can only be used to view non-living specimens?
    10·2 answers
  • Which of the following describes an iteration in a computer program?
    8·1 answer
  • What will be displayed in the console when this program runs?
    15·1 answer
  • A good look of a web page depends upon?​
    8·1 answer
  • Multiple Choice
    9·1 answer
  • there are n houses in a row numbered from 1 to n. an array infected houses contains the houses the houses which are infected wit
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!