root
/
public
mirror of https://github.com/01-edu/public.git
14
27
Fork 0
Code Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
5466 Commits
41 Branches
11 Tags
349 MiB
 
 
 
 
 
 
Tree: 5f88f99d8e
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '5f88f99d8e'
${ noResults }
public/subjects/findprevprime
miguel 9d80904eed
implementing the main.go files at the same level as the readme for the exercise 		1 year ago
..
README.md docs(new subjects): new readmes for the exams exercises 2 years ago
main.go implementing the main.go files at the same level as the readme for the exercise 1 year ago

README.md

findprevprime

Instructions

Write a function that returns the first prime number that is equal or inferior to the int passed as parameter.

If there are no primes inferior to the int passed as parameter the function should return 0.

Expected function

func FindPrevPrime(nb int) int {

}

Usage

Here is a possible program to test your function :

package main

import "fmt"

func main() {
	fmt.Println(FindPrevPrime(5))
	fmt.Println(FindPrevPrime(4))
}

And its output :

$ go run .
5
3
$