HCF-LCM

-
Highest Common Factor and Lowest Common Multiple
HCF - To find the HCF of given numbers, we make a list of the factors of the numbers and find the greatest of the common factors. This is called Factorization method.
LCM - To find the LCM of the given numbers, we write down the multiples of each of the given numbers and find the lowest of their common multiples. The LCM of two numbers cannot bigger than their product.

Watch the video on YouTube: 

Comments

Post a Comment

Popular posts from this blog

First Year Web Technology Practical Slips Solution

-
 Web Technology Practical Slips Solution ******************************* File Name : FYBBA_Practical_1 .html Q1. Write a JavaScript program to calculate the volume of a sphere. -------------------------------------------------------------------> <! DOCTYPE html > < html > < head >     < title > To calculate the volume of a sphere. </ title >     < style type = "text/css" >         .ContainerBox {             margin : 20% auto ;             width : 50% ;             border : 2px solid #ddd ;             padding : 10px ;             text-align : center ;         }     </ style > </ head > < body >     < div class = "ContainerBox" >         < label > Input radius v...
Read more

SYBSc (CS) Sem III : Data Structure Slip 14 Que - 2

-
  SAVITIBAI PHULE UNIVERSITY OF PUNE S. Y. B.Sc. (Computer Science) Semester III Practical Examination       SUBJECT: CS-233 Practical course based on CS231  /* Q. 2 A doubly ended queue allows additions and deletions from both the ends that  is front and rear. Initially additions from the front will not be possible. To avoid this situation, the array can be treated as if it were circular. Implement a  queue library (dstqueue.h) of integers using a static implementation of the  circular queue and implementing the following operations.  a. isFull(Q) b. addFront(Q) c. getRear(Q) d. deleteRear(Q) */ // File name : "dstqueue.c" #include"dstqueue.h" int init(struct Queue *q) {     q->front = q->rear = -1; } int isEmpty(struct Queue *q) {     if(q->front == q->rear)     {        return 1;     }     else{        return 0;     } } int isFul...
Read more

SYBSc (CS) Sem III : Data Structure Slip 20 Que - 2

-
    SAVITIBAI PHULE UNIVERSITY OF PUNE S. Y. B.Sc. (Computer Science) Semester III Practical Examination       SUBJECT: CS-233 Practical course based on CS231  /* Q2. There are lists where new elements are always appended at the end of the  list. The list can be implemented as a circular list with the external pointer  pointing to the last element of the list. Implement singly linked circular list  of integers with append and display operations. The operation append(L, n), appends  to the end of the list, n integers either accepted from user or randomly generated. */ #include<stdio.h> #include<stdlib.h> struct node { int data; struct node *next; }; struct node * create(struct node *head) { struct node *newnode = NULL, *temp = NULL; newnode = (struct node*) malloc(sizeof(struct node)); if(newnode!=NULL) {     printf("Enter node data");     scanf("%d",&(newnode->data));   ...
Read more