<<<<<<< HEAD Code Wars - Brett Crafton

Count Odd Numbers below n

Question

Given a number n, return the number of positive odd numbers below n, EASY! Examples (Input -> Output)

* 7 -> 3 (because odd numbers below 7 are [1, 3, 5]) * 15 -> 7 (because odd numbers below 15 are [1, 3, 5, 7, 9, 11, 13])

Solution by -

My Solution


	function oddCount(n){
		return Math.floor(n/2)
		}
				

Try it yourself - CodeWars

======= Code Wars - Brett Crafton

Count Odd Numbers below n

Question

Given a number n, return the number of positive odd numbers below n, EASY! Examples (Input -> Output)

* 7 -> 3 (because odd numbers below 7 are [1, 3, 5]) * 15 -> 7 (because odd numbers below 15 are [1, 3, 5, 7, 9, 11, 13])

Solution by -

My Solution


	function oddCount(n){
		return Math.floor(n/2)
		}
				

Try it yourself - CodeWars

>>>>>>> 0e614172debaa009c8d31330edbeb3b765b59c39