All categories

2 years ago

Choose the multipules of 3

Mathematics

1 answer:

Zolol [24]2 years ago

8 0

Answer:

I need a pic but here is a couple of them.

3,6,9,12,15,18,21,24,27,30,33,36,39,,42,45,48,51,54,5760,63,66,69,72,75,78,8184,87,90,93,96,99,102,105, 108, 111, 114, 117, 120, 123, 126, 129, 132, 135, 138, 141, 144, 147,150,153,159,162,165,168,,171,174,177,180

Step-by-step explanation:

Hope u have a nice day!! And also can I get the brainiest plz

You might be interested in

What is the absolute value of -6

patriot [66]

Answer:

Step-by-step explanation:

Absolute value just means you make negatives into positives so it's just 6.

8 0

3 years ago

Read 2 more answers

Why is a circle not a polygon

Goryan [66]

Because a polygon is a shape that has equal sides and no curves.

4 0

3 years ago

Read 2 more answers

The Fabulous Fish Market orders tilapia, which costs $3 per pound, and salmon, which costs $5 per pound. The market budgets $210

lesya [120]

Answer:3x+5y=210

Step-by-step explanation:

We dont know how much of each fish they bought so we would add an x and a y. A answer you can put are:

35 pounds of tilapia and 21 pounds of salmon.

4 0

3 years ago

Read 2 more answers

1. Let L be a list of numbers in non-decreasing order, and x be a given number. Describe an algorithm that counts the number of

e-lub [12.9K]

Answer:

Algorithm

Start

Int n // To represent the number of array

Input n

Int countsearch = 0

float search

Float [] numbers // To represent an array of non decreasing number

// Input array elements but first Initialise a counter element

Int count = 0, digit

// Check if element to be inserted is the first element

If(count == 0) Then

Input numbers[count]

Else

lbl: Input digit

If(digit > numbers[count-1]) then

numbers[count] = digit

Else

Output "Number must be greater than the previous number"

Goto lbl

Endif

count = count + 1

While(count<n)

count = 0

// Input element to count

input search

// Begin searching and counting

if(numbers [count] == search)

countsearch = countsearch+1;

End if

While (count < n)

Output count

Program to illustrate the above

// Written in C++

// Comments are used for explanatory purpose

#include<iostream>

using namespace std;

int main()

{

// Variable declaration

float [] numbers;

int n, count;

float num, searchdigit;

cout<<"Number of array elements: ";

cin>> n;

// Enter array element

for(int I = 0; I<n;I++)

{

if(I == 0)

{

cin>>numbers [0]

}

else

{

lbl: cin>>num;

if(num >= numbers [I])

{

numbers [I] = num;

}

else

{

goto lbl;

}

// Search for a particular number

int search;

cin>>searchdigit;

for(int I = 0; I<n; I++)

{

if(numbers[I] == searchdigit

search++

}

// Print result

cout<<search;

return 0;

}

8 0

3 years ago

Simplify the following expressions and remember to pay attention to the signs plz help me

ioda

2 negatives can be converted to a plus sign. -(-x) can be +x or just x.

-54--23

-54+23

23-54=-31

78--4

78+4=82

-48/-6

Now let's pause fer a sec. When a negative is being divided by another negative, the quotient(answer to division problem) becomes a positive.

-48/-6=8

50*-4=-200

---

hope it helps

7 0

3 years ago

Read 2 more answers