Skip to content

Instantly share code, notes, and snippets.

@nuryslyrt
Last active June 8, 2022 22:07
Show Gist options
  • Save nuryslyrt/aac7bcde08c04ac441a6bd4fe8707372 to your computer and use it in GitHub Desktop.
Save nuryslyrt/aac7bcde08c04ac441a6bd4fe8707372 to your computer and use it in GitHub Desktop.

Revisions

  1. nuryslyrt revised this gist Jun 8, 2022. 1 changed file with 3 additions and 2 deletions.
    5 changes: 3 additions & 2 deletions mersenneprimenumberlist.go
    Original file line number Diff line number Diff line change
    @@ -14,7 +14,8 @@ func IsPrime(num int64) int64 {
    fmt.Println("Number must be greater than 2.")
    return
    } **/
    sq_root := int64(math.Sqrt(float64(num)))
    var sq_root int64
    sq_root = int64(math.Sqrt(float64(num)))
    var i int64
    for i = 2; i <= sq_root; i++ {
    if num%i == 0 {
    @@ -49,4 +50,4 @@ func main() {
    var i int64
    fmt.Scan(&i)
    listOfMersenneNo(i)
    }
    }
  2. nuryslyrt revised this gist Jun 8, 2022. 1 changed file with 4 additions and 2 deletions.
    6 changes: 4 additions & 2 deletions mersenneprimenumberlist.go
    Original file line number Diff line number Diff line change
    @@ -46,5 +46,7 @@ func listOfMersenneNo(n int64) {
    }

    func main() {
    listOfMersenneNo(61)
    }
    var i int64
    fmt.Scan(&i)
    listOfMersenneNo(i)
    }
  3. nuryslyrt created this gist Jun 8, 2022.
    50 changes: 50 additions & 0 deletions mersenneprimenumberlist.go
    Original file line number Diff line number Diff line change
    @@ -0,0 +1,50 @@
    package main

    import (
    "fmt"
    "math"
    )

    // Golang program for
    // Display mersenne prime numbers from 1 to n

    func IsPrime(num int64) int64 {
    /**
    if num < 2 {
    fmt.Println("Number must be greater than 2.")
    return
    } **/
    sq_root := int64(math.Sqrt(float64(num)))
    var i int64
    for i = 2; i <= sq_root; i++ {
    if num%i == 0 {
    //fmt.Println("false")

    }
    }
    return num
    }

    // Print the Mersenne prime number
    func listOfMersenneNo(n int64) {
    // How to check if a number is a mersenne prime
    // Condition number greater than 1 And
    // Number is prime And
    // When a number is divided by 2 it's never an
    // even number till the number is zero.

    var p int64
    var num int64
    for p = 2; p <= n; p++ {
    num = (1 << p) - 1

    if IsPrime(num) == num {
    fmt.Println(num)
    }

    }
    }

    func main() {
    listOfMersenneNo(61)
    }