0
How do you find the number of numbers between two numbers knowing the steps?
Wiki User
∙ 12y ago
Nothing could be simpler - no steps required. The answer is always the same: an infinite number of them.
There are an infinite number of numbers between any two numbers - however close they are.
The average of any two numbers is exactly halfway between them. Then the average of one of the original numbers and the first average is between those two. And the average between that same original number and the new average is exactly between them, and the average ... Hopefully you see the pattern emerging.
NB: average = arithmetic mean
Wiki User
∙ 12y ago
Add your answer:
Earn +20 pts
Design a algorithm to generate all prime numbers within the limits l1 and l2?
Algorithm: to generate all prime numbers between the limits l1 and l2.Input: l1 and l2Output: Prime numbers between l1 and l2Method:for (n=l1 to l2 in steps of 1 do)prime=truefor (i=2 to n/2 in steps of 1 do)if (n % i =0)prime = falsebreakend_ifend_forif (prime = true)Display 'Prime number is =', nend_for
What is 5.3425 rounded to 2 decimal places?
The steps for rounding is to underline the place to round to. Look at the number to the right. If that number is 5,6,7,8,9 then add one to the underlined number and drop the numbers to the right or fill in with zeros if it is between it and the decimal. 5.3425 is about 5.34 since the 2 is not 5,6,7,8,9.
How do you convert small to large number?
There are a number of things you could do to the small number: -- Add positive numbers to it. -- Subtract negative numbers from it. -- Multiply it by numbers greater than ' 1 ' . -- Divide it by numbers less than ' 1 '. -- Raise it to positive powers greater than ' 1 '. Repeat any of these steps until the small number grows to the size you want.
If you prime factorize a number and you use the ladder method why do you always have to divide by prime numbers?
It's more efficient. You want to end up with all prime numbers. You could divide by a composite number, but you'd just have to break that number down later. It saves steps.
How many steps can you have in set of stairs?
when you add your rise and your run the two numbers have to equal between 15-17 inches. Typically there are 13.
What is a number that followed all steps above for five different 1-digit numbers?
We can't answer that without knowing the above steps.
What are the steps in rounding off numbers?
steps rounding off number
What is the difference between stairs and steps?
I think that stairs is alot of steps together and steps are only a few in numbers. Also it could be that stairs are inside and steps are outside.
Design a algorithm to generate all prime numbers within the limits l1 and l2?
Algorithm: to generate all prime numbers between the limits l1 and l2.Input: l1 and l2Output: Prime numbers between l1 and l2Method:for (n=l1 to l2 in steps of 1 do)prime=truefor (i=2 to n/2 in steps of 1 do)if (n % i =0)prime = falsebreakend_ifend_forif (prime = true)Display 'Prime number is =', nend_for
Is the relationship between the height of a staircase and the number of steps linear?
Yes, as a rule. Of course, the number of steps has to round to an integer. so the relation is not quite linear.
There are numbers from 1 to n. they have to be inverted as n to 1 . How many moves are required if only two consecutive numbers are stampled at a time?
There are (n2 - n) / 2 moves required.I am not aware that "stampled" is a word beyond a cross between stampede and trample, but I believe you wish to reverse the order of numbers from 1 to n where only two consecutive numbers can be swapped per step.This process will show a pattern of triangular numbers. For example:Let us suppose there are 3 numbers 1,2,3: To move the last (highest) number to the first place requires 2 steps. The second highest number is now in the last place. To move it to the second place requires 1 step. Finished. Total = 3 steps.Or:If there are 4 numbers, i.e. 1,2,3,4:3 steps + 2 steps + 1 step = 6 steps total. We know it is only 3 steps more than the last example because once we have moved the 4 to the first place we then simply have to do the above again (rearrange the 1,2,3, to 3,2,1).So you can see that the number of steps are all triangular numbers.A triangular number is calculated by n(n+1) / 2. So we can use this formula, but we need to alter it because the number of steps are for the previous triangular number. E.g. Where there are 4 numbers we have to do 1+2+3 steps to reorder it (see above).Therefore if we make our formula (n - 1) n / 2 = (n2 - n) / 2 then this will work.
What is 5.3425 rounded to 2 decimal places?
The steps for rounding is to underline the place to round to. Look at the number to the right. If that number is 5,6,7,8,9 then add one to the underlined number and drop the numbers to the right or fill in with zeros if it is between it and the decimal. 5.3425 is about 5.34 since the 2 is not 5,6,7,8,9.
What number is between 270 and 360?
315 degree
How do you convert small to large number?
There are a number of things you could do to the small number: -- Add positive numbers to it. -- Subtract negative numbers from it. -- Multiply it by numbers greater than ' 1 ' . -- Divide it by numbers less than ' 1 '. -- Raise it to positive powers greater than ' 1 '. Repeat any of these steps until the small number grows to the size you want.
How do you find a real number between imperfect squares?
You need to find the two nearest perfect squares roots that are close to n. Divide the given number by one of those numbers. Take the average of the number produced and the root. Check if we square this average, results in the original number or not. If you do not get an answer then repeat the steps. Hope this helped!
How do you reduce the steps for sum of n numbers?
You don't have to reduce the steps.
Consider prime numbers between 1 and 10000. Draw a flowchart to display the prime numbers.Write a pseudo code associated with the flowchart in a)?
A) Here's an example of a flowchart and pseudocode that could be used to display the prime numbers between 1 and 10000: Flowchart: START Set up an array of numbers from 1 to 10000 Set an empty array to store the prime numbers Set i = 2, the first prime number For each number in the array, check if it is divisible by i If it is divisible by i, it is not a prime number and move to the next number in the array If it is not divisible by i, it is a prime number and add it to the prime numbers array Increase i by 1 and go back to step 4 Repeat steps 4 through 7 until i is greater than the square root of 10000 Display the prime numbers array END
