This solution is outdated. To rescore this solution, sign in.
-
1 Comment
SAJJAD
on 10 Aug 2013
for 21 size. little editing :)
function ans = is_it_odd(n)
if mod(n,2)==0; false;
else
true
end
Suggested Problems
-
Project Euler: Problem 2, Sum of even Fibonacci
2550 Solvers
-
Project Euler: Problem 3, Largest prime factor
1616 Solvers
-
Sum of first n terms of a harmonic progression
454 Solvers
-
973 Solvers
-
7674 Solvers
More from this Author96
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!