id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

jebbert@volusia.k12.fl.us primenumbers > maxNumPrimes
prev  |  next  |  chance

Return the greatest number of factors found in any of the positive integers less than or equal to the input parameter. For example, at least one number from 2 to 90 has 6 prime factors, and no numbers in that range have more than 6 prime factors, so maxNumPrimes(90) returns 6.


maxNumPrimes(4) → 2
maxNumPrimes(9) → 3
maxNumPrimes(14) → 3

...Save, Compile, Run (ctrl-enter)

public int maxNumPrimes(int topCheck) { }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Difficulty: 440

Copyright Nick Parlante 2017 - privacy