ŠTEVILKA CAROL

Preizkusite na GfG Practice

#practiceLinkDiv { display: none !important; }

Carolovo število je celo število v obliki 4 ⁿ- 2 ⁽ⁿ⁺¹⁾- 1. Enakovredna formula je (2 ⁿ-1) ²- 2.
Zanimiva nepremičnina:
Za n > 2 je binarna predstavitev n-tega Carolovega števila n-2 zaporednih ena, ena sama ničla na sredini in n + 1 zaporedna ena. Primer n = 4 številka pesmi je 223 in binarno število 223 je 11011111 tukaj n-2 = 4-2 = 2 zaporedni eni na začetku, nato ena 0 na sredini in nato n + 1 = 4 + 1 = 5 zaporednih enic za njo.
Glede na število n je naloga najti n-to Carolovo število. Prvih nekaj številk kolednikov je -1 7 47 223 959 ... itd.

Primeri:

Input : n = 2 Output: 7 Input : n = 4 Output: 223

Recommended Practice Carol Numbers Poskusite! C++

    // C++ program to find n'th Carol number   #include          using     namespace     std  ;   // Function to find n'th carol number   int     carol  (  int     n  )   {      int     result     =     pow  (  2       n  )     -     1  ;      return     result     *     result     -     2  ;   }   // Driver program to ru the case   int     main  ()   {      int     n     =     4  ;      cout      < <     carol  (  n  );      return     0  ;   }

Python3

    # Python program to find n'th Carol number   def   carol  (  n  ):   # a**b is a ^ b in python   result   =   (  2  **  n  )   -   1   return   result   *   result   -   2   # driver program to run the case   n   =   4   print   (  carol  (  n  ))

Java

    /* Java program to find n'th Carol number */   class   GFG     {      static     int     carol  (  int     n  )      {      double     tmp     =     Math  .  pow  (  2       n  )     -     1  ;      return     (  int  )  tmp  ;      }      public     static     void     main  (  String  []     args  )      {      int     n     =     4  ;      System  .  out  .  println  (  carol  (  n  ));      }   }

    /* C# program to find n'th Carol number */   using     System  ;   class     GFG     {      static     int     carol  (  int     n  )      {      int     result     =     (  int  )  Math  .  Pow  (  2       n  )     -     1  ;      return     result     *     result     -     2  ;      }      // Driver code      public     static     void     Main  ()      {      int     n     =     4  ;      Console  .  WriteLine  (  carol  (  n  ));      }   }   // This code is contributed by vt_m.

PHP

       // PHP program to find   // n'th Carol number   // Function to find   // n'th carol number   function   carol  (  $n  )   {   $result   =   pow  (  2     $n  )   -   1  ;   return   $result   *   $result   -   2  ;   }   // Driver Code   $n   =   4  ;   echo   carol  (  $n  );   // This code is contributed by ajit   ?>

JavaScript

     <  script  >      /* Javascript program to find n'th Carol number */          function     carol  (  n  )      {      let     result     =     Math  .  pow  (  2       n  )     -     1  ;      return     result     *     result     -     2  ;      }          let     n     =     4  ;      document  .  write  (  carol  (  n  ));        <  /script>