answersLogoWhite

0

62 = 2*31

User Avatar

Wiki User

11y ago

What else can I help you with?

Related Questions

How do you number of os in virtual machine?

How do you number of OS in virtual machine


In 1995 the prime minister os israel was?

Benjamin netanyahu


What is the prime factorisation OS 16 using exponets?

24 = 16


What are all the factors of five?

'5' os a PRIME NUMBER. This means it can only be divided by '1' & '5' itself. So the 'factors' of '5' are , '1' & '5'


What number os 32 percent of 1000?

320


What number os 35 percent of 90?

31.5


What is the oxidation number os be?

Be is a s block element. It generally shows +2 number.


Can a number be a factor of 48 but not a factor os 16?

Yes.


What is a factor tree of 246?

First, pick a factor pair whose product is 246. Then, for each number that is not prime, choose a factor pair for it. Continue until you have reduced each branch of the tree to prime numbers. Here is a factor tree OS 246, using periods for spacing: ....246 ...../ \ ...6 x 41 ../ \ 2 x 3 The prime factors are 2, 3, and 41.


How do you configure host name and port number?

Depends on the OS (operating system)


How many electrons are in the nucleus of an atom with an atomic number os 25?

is it 3


Show the concept of unary operator plus plus in overloading?

The following example code demonstrates unary increment operator overloads. The code makes use of two classes, natural and prime, where prime inherits from natural, but where both specialise their increment operators. Note that natural numbers can never be zero, therefore if an increment causes an overflow, the number is set to 1. Prime numbers are also natural numbers but they must be greater than 1. The main function tests both the prefix and postfix increment operators for both classes. #include<iostream> class natural { private: unsigned m_data; public: natural(unsigned data=1): m_data(data?data:1) {} // prefix increment operator natural& operator++() { ++m_data; if(!m_data) m_data=1; return(*this); } // postfix increment operator natural operator++(int) { natural temp(*this); ++m_data; if(!m_data) m_data=1; return(temp); } // conversion operator operator unsigned(){ return(m_data); } }; std::ostream& operator<<(std::ostream& os, natural& num) { os<<(unsigned)num; return(os); } class prime: public natural { private: bool is_prime() { unsigned num = (unsigned)*this; if(num==1) return(false); if(num==2) return(true); if(num%2==0) return(false); unsigned max_factor = (unsigned)sqrt((double) num); for(unsigned factor=3; factor<max_factor; factor+=2) if(num%factor==0) return(false); return(true); } public: prime(): natural(2) {} prime& operator++() { do { natural::operator++(); } while(!is_prime()); return(*this); } prime operator++(int) { prime temp(*this); do { natural::operator++(); } while(!is_prime()); return(temp); } }; int main() { natural n; prime p; std::cout<<"The 1st natural number is "<<n<<std::endl; std::cout<<"The 2nd natural number is "<<++n<<std::endl; std::cout<<"The 3rd natural number is "<<++n<<std::endl; std::cout<<"The 4th natural number is "<<++n<<std::endl; std::cout<<"The 4th natural number was "<<n++<<" while the 5th is "<<n<<std::endl; std::cout<<"The 1st prime number is "<<p<<std::endl; std::cout<<"The 2nd prime number is "<<++p<<std::endl; std::cout<<"The 3rd prime number is "<<++p<<std::endl; std::cout<<"The 4th prime number is "<<++p<<std::endl; std::cout<<"The 4th prime number was "<<p++<<" while the 5th is "<<p<<std::endl; }