0
Numbers
Numbers are our way to quantify, label, and organize the world around us in a logical manner. However, the systems used to obtain this goal differ geographically, historically, and by relative utility. All questions pertaining to numbers, including historic labeling systems, bases of numerical systems, constants, and the various ways they're grouped together, should be placed into this category.
46,867 Questions
What are the two correct ways of enscribing 1999 into Roman numerals?
Under today's modern rules governing the Roman numeral system 1999 is considered to be MCMXCIX which makes it almost impossible for any form of numerical interaction with other numerals.
But it can be proven that the Romans themselves in the past would have actually calculated the equivalent of 1999 as MDCCCCLXXXXVIIII which can be methodically contracted to IMM (2000-1) yet retaining its original numerical value and therefore facilitating the speed and ease of mathematical operations with other numerals.
Note that if: -I+MM = MDCCCCLXXXXVIIII
Then it follows that: MM = MDCCCCLXXXXVIIII+I
QED
What is the lowest number that 1575 has to be multiplied to make it a square number?
I'm really trying to figure this out, I asked on google, this came up, so I clicked this.. Did this answer my question? NO not really. First time. Please submit an answer, ASAP. Thanks!
- FROM Anonymous
Is multiplying a mathematical practice?
Yes of course. It is one of the four basic mathematical practices, namely addition, subtraction, multiplying, and division.
What is the smallest number you can make out of these numbers 569873246813542815448456?
Anytime a question like this is asked, put the smallest digits first and go from there. Start with all of the 1's. After you have all of them put all of the 2's, and so on.
How did counting numbers evalued to realnumbers?
Please explain "evalued" since that is not a word in any English dictionary that I can find.
How can you print prime numbers uing turbo c?
A prime number is a number that has no factors other than 1 and itself. For instance, 1, 2 and 3 are prime numbers. However, 4 isn't because it can also be divided evenly by 2.
Although a complicated floating-point function can be written to test if the division of a number is even, the C modulus operator (%) is far quicker. If 'n' modulus 'm' is zero, then the division is even - there is no fractional component.
Using this rule, the pseudo-code for testing if a number is prime is as follows:
- if number is zero, return false
- if number is less than 4, return true since 1, 2 and 3 are primes
- iterate a variable 'c' from 2 until the number 'n' minus 1
- if n modulus c is zero, return false, since 'n' has 'c' as a factor
- return true
All that remains is converting the above code to C (or any other programming language) using inline code or a function.
3 x 5 x 5 = 75
How do you find the prime factorization of large numbers?
The same way as with smaller numbers, it may take longer. Just keep dividing by prime numbers until all the factors are prime.
