Solve MATLAB Exercise: Number of Positive Integers < n Divisible by a or b

AI Thread Summary
The discussion centers on creating a MATLAB function to count positive integers less than n that are divisible by a or b. The example provided illustrates that for n = 1000, a = 3, and b = 5, the expected output is 466. Participants express confusion about implementing the logic for divisibility and displaying results, despite having reviewed class notes and online tutorials. Key functions mentioned include "floor" for rounding and "mod" for checking divisibility. The conversation highlights the challenge of understanding MATLAB's syntax and functions for this specific exercise.
M1ZeN
Messages
17
Reaction score
0

Homework Statement


Write a Matlab function that takes as input three integers n, a and b, and outputs the number
of positive integers less than n that are divisible by a or b. For example, with n = 1000, a = 3
and b = 5, the output should be 466.


Homework Equations


MATLAB's use of entering in the program into editor. I do not know of any functions in which to use.

The Attempt at a Solution


I have read over my classes notes over and over again (popping adderalls). I have spent a total of three full days non stop reading and trying to understand (and yes I have had sleep). I have gone through many online tutorials for MATLAB and understanding it's features and commands. However this particular homework exercise has left me completely lost.

First. I'm writing the function into the MATLAB editor. The only work I have done so far is my attempt in defining the variables (n, a & b) for the integers and my attempt at entering in the user input command where you would put in values from the Command Window.

I do know somewhere in the program I'm going to have use the operator of less than. I'm confused on the divisible part and also how to define a command to display the output of the integer that is less than n that are divisible by a or b.
 
Physics news on Phys.org


There are two ways to solve this, a clever way and a "brute force" way.

Some useful functions:

floor(A) : rounds down to the nearest integer.

mod(X, Y) : modulus after division - this is the same as the remainder when both X and Y are positive
If X is evenly divisible by Y, then mod(X, Y) will return 0.
 

Similar threads

Replies
1
Views
2K
Replies
10
Views
2K
Replies
4
Views
5K
Replies
10
Views
2K
Replies
1
Views
2K
Replies
5
Views
3K
Replies
21
Views
3K
Replies
1
Views
3K
Back
Top